Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950600516.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950600516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 19K Feb 26 14:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 14:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Feb 26 14:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 232K Feb 26 14:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 14:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Feb 26 14:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 601K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679549229096

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 05:27:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 05:27:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:27:11] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-23 05:27:11] [INFO ] Transformed 536 places.
[2023-03-23 05:27:11] [INFO ] Transformed 1064 transitions.
[2023-03-23 05:27:11] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2023-03-23 05:27:11] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 108 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 535 transition count 968
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 530 transition count 963
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 530 transition count 963
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 525 transition count 958
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 525 transition count 958
Applied a total of 21 rules in 94 ms. Remains 525 /536 variables (removed 11) and now considering 958/968 (removed 10) transitions.
[2023-03-23 05:27:11] [INFO ] Flow matrix only has 946 transitions (discarded 12 similar events)
// Phase 1: matrix 946 rows 525 cols
[2023-03-23 05:27:11] [INFO ] Computed 49 place invariants in 64 ms
[2023-03-23 05:27:13] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 66 transitions.
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2023-03-23 05:27:13] [INFO ] Flow matrix only has 880 transitions (discarded 12 similar events)
// Phase 1: matrix 880 rows 525 cols
[2023-03-23 05:27:13] [INFO ] Computed 49 place invariants in 36 ms
[2023-03-23 05:27:13] [INFO ] Implicit Places using invariants in 437 ms returned [96, 111, 238, 251, 302, 488]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 444 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 519/536 places, 892/968 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 517 transition count 880
Reduce places removed 11 places and 12 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 506 transition count 868
Deduced a syphon composed of 1 places in 5 ms
Applied a total of 13 rules in 19 ms. Remains 506 /519 variables (removed 13) and now considering 868/892 (removed 24) transitions.
[2023-03-23 05:27:13] [INFO ] Flow matrix only has 856 transitions (discarded 12 similar events)
// Phase 1: matrix 856 rows 506 cols
[2023-03-23 05:27:13] [INFO ] Computed 44 place invariants in 35 ms
[2023-03-23 05:27:14] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-23 05:27:14] [INFO ] Flow matrix only has 856 transitions (discarded 12 similar events)
[2023-03-23 05:27:14] [INFO ] Invariant cache hit.
[2023-03-23 05:27:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:27:25] [INFO ] Implicit Places using invariants and state equation in 11308 ms returned []
Implicit Place search using SMT with State Equation took 11716 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 506/536 places, 868/968 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13727 ms. Remains : 506/536 places, 868/968 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Support contains 105 out of 505 places after structural reductions.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 05:27:25] [INFO ] Flatten gal took : 105 ms
[2023-03-23 05:27:25] [INFO ] Flatten gal took : 63 ms
[2023-03-23 05:27:25] [INFO ] Input system was already deterministic with 868 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 05:27:26] [INFO ] Flow matrix only has 856 transitions (discarded 12 similar events)
// Phase 1: matrix 856 rows 505 cols
[2023-03-23 05:27:26] [INFO ] Computed 43 place invariants in 19 ms
[2023-03-23 05:27:26] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 05:27:26] [INFO ] [Real]Absence check using 19 positive and 24 generalized place invariants in 27 ms returned sat
[2023-03-23 05:27:26] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 7 out of 505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 505/505 places, 868/868 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 504 transition count 824
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 460 transition count 824
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 88 place count 460 transition count 764
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 208 place count 400 transition count 764
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 209 place count 399 transition count 763
Iterating global reduction 2 with 1 rules applied. Total rules applied 210 place count 399 transition count 763
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 306 place count 351 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 308 place count 349 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 349 transition count 713
Applied a total of 310 rules in 121 ms. Remains 349 /505 variables (removed 156) and now considering 713/868 (removed 155) transitions.
[2023-03-23 05:27:27] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2023-03-23 05:27:27] [INFO ] Computed 42 place invariants in 11 ms
[2023-03-23 05:27:27] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
[2023-03-23 05:27:27] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:27:27] [INFO ] Invariant cache hit.
[2023-03-23 05:27:28] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-23 05:27:28] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:27:28] [INFO ] Invariant cache hit.
[2023-03-23 05:27:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:27:32] [INFO ] Implicit Places using invariants and state equation in 4821 ms returned []
Implicit Place search using SMT with State Equation took 5224 ms to find 0 implicit places.
[2023-03-23 05:27:33] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-23 05:27:33] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:27:33] [INFO ] Invariant cache hit.
[2023-03-23 05:27:33] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/505 places, 713/868 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6570 ms. Remains : 349/505 places, 713/868 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-01 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 (OR (LT s4 1) (LT s210 1)) (OR (LT s4 1) (LT s54 1)) (OR (LT s4 1) (LT s157 1)) (OR (LT s4 1) (LT s11 1)) (OR (LT s4 1) (LT s185 1)) (OR (LT s4 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 48 reset in 563 ms.
Stack based approach found an accepted trace after 1756 steps with 2 reset with depth 308 and stack size 308 in 10 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-01 finished in 7389 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(((!p1 U (!p2||G(!p1)))&&p0))))'
Support contains 24 out of 505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 505/505 places, 868/868 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 504 transition count 836
Reduce places removed 32 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 472 transition count 830
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 466 transition count 830
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 76 place count 466 transition count 776
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 184 place count 412 transition count 776
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 411 transition count 775
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 411 transition count 775
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 246 place count 381 transition count 745
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 248 place count 379 transition count 743
Iterating global reduction 3 with 2 rules applied. Total rules applied 250 place count 379 transition count 743
Applied a total of 250 rules in 92 ms. Remains 379 /505 variables (removed 126) and now considering 743/868 (removed 125) transitions.
[2023-03-23 05:27:34] [INFO ] Flow matrix only has 731 transitions (discarded 12 similar events)
// Phase 1: matrix 731 rows 379 cols
[2023-03-23 05:27:34] [INFO ] Computed 42 place invariants in 8 ms
[2023-03-23 05:27:35] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
[2023-03-23 05:27:35] [INFO ] Flow matrix only has 731 transitions (discarded 12 similar events)
[2023-03-23 05:27:35] [INFO ] Invariant cache hit.
[2023-03-23 05:27:35] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-23 05:27:35] [INFO ] Flow matrix only has 731 transitions (discarded 12 similar events)
[2023-03-23 05:27:35] [INFO ] Invariant cache hit.
[2023-03-23 05:27:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:27:39] [INFO ] Implicit Places using invariants and state equation in 3890 ms returned []
Implicit Place search using SMT with State Equation took 4284 ms to find 0 implicit places.
[2023-03-23 05:27:39] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-23 05:27:39] [INFO ] Flow matrix only has 731 transitions (discarded 12 similar events)
[2023-03-23 05:27:39] [INFO ] Invariant cache hit.
[2023-03-23 05:27:40] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/505 places, 743/868 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5629 ms. Remains : 379/505 places, 743/868 transitions.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p2 p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(OR (AND (GEQ s69 1) (GEQ s272 1) (GEQ s368 1)) (AND (GEQ s69 1) (GEQ s272 1) (GEQ s279 1)) (AND (GEQ s69 1) (GEQ s120 1) (GEQ s272 1)) (AND (GEQ s69 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 51 reset in 680 ms.
Stack based approach found an accepted trace after 298 steps with 0 reset with depth 299 and stack size 299 in 6 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-02 finished in 6403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 43 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 868/868 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 503 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 503 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 502 transition count 866
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 502 transition count 866
Applied a total of 5 rules in 32 ms. Remains 502 /505 variables (removed 3) and now considering 866/868 (removed 2) transitions.
[2023-03-23 05:27:40] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2023-03-23 05:27:40] [INFO ] Computed 42 place invariants in 17 ms
[2023-03-23 05:27:41] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
[2023-03-23 05:27:41] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:27:41] [INFO ] Invariant cache hit.
[2023-03-23 05:27:42] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-23 05:27:42] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:27:42] [INFO ] Invariant cache hit.
[2023-03-23 05:27:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:27:51] [INFO ] Implicit Places using invariants and state equation in 9235 ms returned []
Implicit Place search using SMT with State Equation took 9757 ms to find 0 implicit places.
[2023-03-23 05:27:51] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:27:51] [INFO ] Invariant cache hit.
[2023-03-23 05:27:52] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/505 places, 866/868 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11690 ms. Remains : 502/505 places, 866/868 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s217 1) (GEQ s377 1)) (AND (GEQ s377 1) (GEQ s429 1)) (AND (GEQ s377 1) (GEQ s430 1)) (AND (GEQ s203 1) (GEQ s377 1)) (AND (GEQ s270 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15379 reset in 559 ms.
Product exploration explored 100000 steps with 15383 reset in 597 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
[2023-03-23 05:27:54] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:27:54] [INFO ] Invariant cache hit.
[2023-03-23 05:27:54] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 05:27:54] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 108 ms returned sat
[2023-03-23 05:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:55] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2023-03-23 05:27:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:27:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-23 05:27:56] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 48 ms returned sat
[2023-03-23 05:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:27:58] [INFO ] [Nat]Absence check using state equation in 2446 ms returned sat
[2023-03-23 05:27:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:27:59] [INFO ] [Nat]Added 72 Read/Feed constraints in 287 ms returned sat
[2023-03-23 05:27:59] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 5 ms to minimize.
[2023-03-23 05:27:59] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2023-03-23 05:28:00] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 4 ms to minimize.
[2023-03-23 05:28:00] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2023-03-23 05:28:00] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2023-03-23 05:28:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1665 ms
[2023-03-23 05:28:00] [INFO ] Computed and/alt/rep : 630/2217/624 causal constraints (skipped 228 transitions) in 88 ms.
[2023-03-23 05:28:07] [INFO ] Added : 366 causal constraints over 74 iterations in 6341 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 43 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 866/866 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 502 transition count 824
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 460 transition count 824
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 460 transition count 764
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 400 transition count 764
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 300 place count 352 transition count 716
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 303 place count 349 transition count 713
Iterating global reduction 2 with 3 rules applied. Total rules applied 306 place count 349 transition count 713
Applied a total of 306 rules in 58 ms. Remains 349 /502 variables (removed 153) and now considering 713/866 (removed 153) transitions.
[2023-03-23 05:28:07] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2023-03-23 05:28:07] [INFO ] Computed 42 place invariants in 8 ms
[2023-03-23 05:28:07] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
[2023-03-23 05:28:07] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:28:07] [INFO ] Invariant cache hit.
[2023-03-23 05:28:08] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-23 05:28:08] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:28:08] [INFO ] Invariant cache hit.
[2023-03-23 05:28:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:28:12] [INFO ] Implicit Places using invariants and state equation in 3890 ms returned []
Implicit Place search using SMT with State Equation took 4285 ms to find 0 implicit places.
[2023-03-23 05:28:12] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-23 05:28:12] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:28:12] [INFO ] Invariant cache hit.
[2023-03-23 05:28:12] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/502 places, 713/866 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5583 ms. Remains : 349/502 places, 713/866 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 32 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-23 05:28:13] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:28:13] [INFO ] Invariant cache hit.
[2023-03-23 05:28:13] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-23 05:28:13] [INFO ] [Real]Absence check using 19 positive and 23 generalized place invariants in 89 ms returned sat
[2023-03-23 05:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:28:14] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-23 05:28:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:28:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-23 05:28:15] [INFO ] [Nat]Absence check using 19 positive and 23 generalized place invariants in 51 ms returned sat
[2023-03-23 05:28:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:28:16] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2023-03-23 05:28:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:28:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 173 ms returned sat
[2023-03-23 05:28:16] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 1 ms to minimize.
[2023-03-23 05:28:16] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 0 ms to minimize.
[2023-03-23 05:28:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 518 ms
[2023-03-23 05:28:16] [INFO ] Computed and/alt/rep : 429/1944/423 causal constraints (skipped 276 transitions) in 74 ms.
[2023-03-23 05:28:17] [INFO ] Added : 44 causal constraints over 9 iterations in 691 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15380 reset in 491 ms.
Product exploration explored 100000 steps with 15380 reset in 509 ms.
Support contains 43 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 713/713 transitions.
Applied a total of 0 rules in 26 ms. Remains 349 /349 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-23 05:28:18] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:28:18] [INFO ] Invariant cache hit.
[2023-03-23 05:28:19] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
[2023-03-23 05:28:19] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:28:19] [INFO ] Invariant cache hit.
[2023-03-23 05:28:19] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-23 05:28:19] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:28:19] [INFO ] Invariant cache hit.
[2023-03-23 05:28:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:28:25] [INFO ] Implicit Places using invariants and state equation in 5625 ms returned []
Implicit Place search using SMT with State Equation took 5998 ms to find 0 implicit places.
[2023-03-23 05:28:25] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-23 05:28:25] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:28:25] [INFO ] Invariant cache hit.
[2023-03-23 05:28:25] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7128 ms. Remains : 349/349 places, 713/713 transitions.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-03 finished in 44983 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((X(p0)||(p1&&F(p2)))))'
Support contains 28 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 868/868 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 503 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 503 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 502 transition count 866
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 502 transition count 866
Applied a total of 5 rules in 18 ms. Remains 502 /505 variables (removed 3) and now considering 866/868 (removed 2) transitions.
[2023-03-23 05:28:25] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2023-03-23 05:28:25] [INFO ] Computed 42 place invariants in 10 ms
[2023-03-23 05:28:26] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
[2023-03-23 05:28:26] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:26] [INFO ] Invariant cache hit.
[2023-03-23 05:28:27] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-23 05:28:27] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:27] [INFO ] Invariant cache hit.
[2023-03-23 05:28:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:28:36] [INFO ] Implicit Places using invariants and state equation in 9433 ms returned []
Implicit Place search using SMT with State Equation took 9869 ms to find 0 implicit places.
[2023-03-23 05:28:36] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:36] [INFO ] Invariant cache hit.
[2023-03-23 05:28:37] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/505 places, 866/868 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11840 ms. Remains : 502/505 places, 866/868 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s130 1) (GEQ s133 1) (GEQ s443 1)) (AND (GEQ s130 1) (GEQ s215 1) (GEQ s443 1)) (AND (GEQ s130 1) (GEQ s133 1) (GEQ s166 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 698 ms.
Product exploration explored 100000 steps with 50000 reset in 719 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-04 finished in 13568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 868/868 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 503 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 503 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 502 transition count 866
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 502 transition count 866
Applied a total of 5 rules in 21 ms. Remains 502 /505 variables (removed 3) and now considering 866/868 (removed 2) transitions.
[2023-03-23 05:28:39] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:39] [INFO ] Invariant cache hit.
[2023-03-23 05:28:40] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
[2023-03-23 05:28:40] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:40] [INFO ] Invariant cache hit.
[2023-03-23 05:28:40] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-23 05:28:40] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:40] [INFO ] Invariant cache hit.
[2023-03-23 05:28:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:28:46] [INFO ] Implicit Places using invariants and state equation in 6286 ms returned []
Implicit Place search using SMT with State Equation took 6734 ms to find 0 implicit places.
[2023-03-23 05:28:47] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:47] [INFO ] Invariant cache hit.
[2023-03-23 05:28:47] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/505 places, 866/868 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8595 ms. Remains : 502/505 places, 866/868 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s441 2) (LT s5 2) (LT s349 2) (LT s269 2) (LT s240 2) (LT s103 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 534 ms.
Product exploration explored 100000 steps with 50000 reset in 543 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-07 finished in 9829 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&&X(p0)) U G((X(p1)||F(p2)))))'
Support contains 6 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 868/868 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 504 transition count 867
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 504 transition count 867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 503 transition count 866
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 503 transition count 866
Applied a total of 4 rules in 15 ms. Remains 503 /505 variables (removed 2) and now considering 866/868 (removed 2) transitions.
[2023-03-23 05:28:49] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 503 cols
[2023-03-23 05:28:49] [INFO ] Computed 43 place invariants in 15 ms
[2023-03-23 05:28:50] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
[2023-03-23 05:28:50] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:50] [INFO ] Invariant cache hit.
[2023-03-23 05:28:50] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-23 05:28:50] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:50] [INFO ] Invariant cache hit.
[2023-03-23 05:28:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:28:56] [INFO ] Implicit Places using invariants and state equation in 6195 ms returned []
Implicit Place search using SMT with State Equation took 6668 ms to find 0 implicit places.
[2023-03-23 05:28:56] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:28:56] [INFO ] Invariant cache hit.
[2023-03-23 05:28:57] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 503/505 places, 866/868 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8748 ms. Remains : 503/505 places, 866/868 transitions.
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), false]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s257 1), p2:(GEQ s51 1), p1:(AND (GEQ s13 1) (GEQ s130 1) (GEQ s213 1) (GEQ s408 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]]
Product exploration explored 100000 steps with 6935 reset in 312 ms.
Product exploration explored 100000 steps with 6921 reset in 320 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 16 factoid took 750 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 16 factoid took 865 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 866/866 transitions.
Applied a total of 0 rules in 10 ms. Remains 503 /503 variables (removed 0) and now considering 866/866 (removed 0) transitions.
[2023-03-23 05:29:00] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:29:00] [INFO ] Invariant cache hit.
[2023-03-23 05:29:01] [INFO ] Dead Transitions using invariants and state equation in 1003 ms found 0 transitions.
[2023-03-23 05:29:01] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:29:01] [INFO ] Invariant cache hit.
[2023-03-23 05:29:02] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-23 05:29:02] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:29:02] [INFO ] Invariant cache hit.
[2023-03-23 05:29:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:29:08] [INFO ] Implicit Places using invariants and state equation in 6502 ms returned []
Implicit Place search using SMT with State Equation took 7015 ms to find 0 implicit places.
[2023-03-23 05:29:08] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:29:08] [INFO ] Invariant cache hit.
[2023-03-23 05:29:09] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9025 ms. Remains : 503/503 places, 866/866 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 25 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 304 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 6967 reset in 351 ms.
Product exploration explored 100000 steps with 6949 reset in 320 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 866/866 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 503 transition count 866
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 30 place count 503 transition count 932
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 96 place count 503 transition count 932
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 108 place count 491 transition count 920
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 120 place count 491 transition count 920
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 156 place count 491 transition count 920
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 177 place count 470 transition count 899
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 198 place count 470 transition count 899
Deduced a syphon composed of 102 places in 1 ms
Applied a total of 198 rules in 80 ms. Remains 470 /503 variables (removed 33) and now considering 899/866 (removed -33) transitions.
[2023-03-23 05:29:12] [INFO ] Flow matrix only has 887 transitions (discarded 12 similar events)
// Phase 1: matrix 887 rows 470 cols
[2023-03-23 05:29:12] [INFO ] Computed 43 place invariants in 10 ms
[2023-03-23 05:29:12] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
[2023-03-23 05:29:12] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-23 05:29:12] [INFO ] Flow matrix only has 887 transitions (discarded 12 similar events)
[2023-03-23 05:29:12] [INFO ] Invariant cache hit.
[2023-03-23 05:29:13] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 470/503 places, 899/866 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1674 ms. Remains : 470/503 places, 899/866 transitions.
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 866/866 transitions.
Applied a total of 0 rules in 10 ms. Remains 503 /503 variables (removed 0) and now considering 866/866 (removed 0) transitions.
[2023-03-23 05:29:13] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 503 cols
[2023-03-23 05:29:13] [INFO ] Computed 43 place invariants in 10 ms
[2023-03-23 05:29:14] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
[2023-03-23 05:29:14] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:29:14] [INFO ] Invariant cache hit.
[2023-03-23 05:29:15] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-23 05:29:15] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:29:15] [INFO ] Invariant cache hit.
[2023-03-23 05:29:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:29:20] [INFO ] Implicit Places using invariants and state equation in 4968 ms returned []
Implicit Place search using SMT with State Equation took 5412 ms to find 0 implicit places.
[2023-03-23 05:29:20] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
[2023-03-23 05:29:20] [INFO ] Invariant cache hit.
[2023-03-23 05:29:21] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7341 ms. Remains : 503/503 places, 866/866 transitions.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-09 finished in 32033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 505/505 places, 868/868 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 504 transition count 824
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 460 transition count 824
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 88 place count 460 transition count 764
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 208 place count 400 transition count 764
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 209 place count 399 transition count 763
Iterating global reduction 2 with 1 rules applied. Total rules applied 210 place count 399 transition count 763
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 304 place count 352 transition count 716
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 306 place count 350 transition count 714
Iterating global reduction 2 with 2 rules applied. Total rules applied 308 place count 350 transition count 714
Applied a total of 308 rules in 48 ms. Remains 350 /505 variables (removed 155) and now considering 714/868 (removed 154) transitions.
[2023-03-23 05:29:21] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
// Phase 1: matrix 702 rows 350 cols
[2023-03-23 05:29:21] [INFO ] Computed 42 place invariants in 8 ms
[2023-03-23 05:29:21] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
[2023-03-23 05:29:21] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2023-03-23 05:29:21] [INFO ] Invariant cache hit.
[2023-03-23 05:29:22] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-23 05:29:22] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2023-03-23 05:29:22] [INFO ] Invariant cache hit.
[2023-03-23 05:29:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:29:28] [INFO ] Implicit Places using invariants and state equation in 6468 ms returned []
Implicit Place search using SMT with State Equation took 6850 ms to find 0 implicit places.
[2023-03-23 05:29:28] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-23 05:29:28] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
[2023-03-23 05:29:28] [INFO ] Invariant cache hit.
[2023-03-23 05:29:29] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/505 places, 714/868 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8120 ms. Remains : 350/505 places, 714/868 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s194 1) (LT s266 2))], 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 64 reset in 382 ms.
Stack based approach found an accepted trace after 329 steps with 0 reset with depth 330 and stack size 330 in 2 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-12 finished in 8548 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)))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J06T06-LTLFireability-03
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 43 out of 505 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 505/505 places, 868/868 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 504 transition count 824
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 460 transition count 824
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 88 place count 460 transition count 764
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 208 place count 400 transition count 764
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 209 place count 399 transition count 763
Iterating global reduction 2 with 1 rules applied. Total rules applied 210 place count 399 transition count 763
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 306 place count 351 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 308 place count 349 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 349 transition count 713
Applied a total of 310 rules in 47 ms. Remains 349 /505 variables (removed 156) and now considering 713/868 (removed 155) transitions.
[2023-03-23 05:29:29] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2023-03-23 05:29:29] [INFO ] Computed 42 place invariants in 14 ms
[2023-03-23 05:29:30] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
[2023-03-23 05:29:30] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:30] [INFO ] Invariant cache hit.
[2023-03-23 05:29:30] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-23 05:29:30] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:30] [INFO ] Invariant cache hit.
[2023-03-23 05:29:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:29:35] [INFO ] Implicit Places using invariants and state equation in 4149 ms returned []
Implicit Place search using SMT with State Equation took 4542 ms to find 0 implicit places.
[2023-03-23 05:29:35] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:35] [INFO ] Invariant cache hit.
[2023-03-23 05:29:35] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 349/505 places, 713/868 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5806 ms. Remains : 349/505 places, 713/868 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s151 1) (GEQ s266 1)) (AND (GEQ s266 1) (GEQ s303 1)) (AND (GEQ s266 1) (GEQ s304 1)) (AND (GEQ s140 1) (GEQ s266 1)) (AND (GEQ s188 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15386 reset in 436 ms.
Product exploration explored 100000 steps with 15377 reset in 447 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-23 05:29:36] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:36] [INFO ] Invariant cache hit.
[2023-03-23 05:29:37] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-23 05:29:37] [INFO ] [Real]Absence check using 19 positive and 23 generalized place invariants in 61 ms returned sat
[2023-03-23 05:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:29:38] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2023-03-23 05:29:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:29:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-23 05:29:38] [INFO ] [Nat]Absence check using 19 positive and 23 generalized place invariants in 25 ms returned sat
[2023-03-23 05:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:29:40] [INFO ] [Nat]Absence check using state equation in 1124 ms returned sat
[2023-03-23 05:29:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:29:40] [INFO ] [Nat]Added 72 Read/Feed constraints in 103 ms returned sat
[2023-03-23 05:29:40] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 2 ms to minimize.
[2023-03-23 05:29:40] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 1 ms to minimize.
[2023-03-23 05:29:40] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 0 ms to minimize.
[2023-03-23 05:29:41] [INFO ] Deduced a trap composed of 143 places in 192 ms of which 1 ms to minimize.
[2023-03-23 05:29:41] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2023-03-23 05:29:41] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2023-03-23 05:29:41] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2023-03-23 05:29:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1309 ms
[2023-03-23 05:29:41] [INFO ] Computed and/alt/rep : 429/1944/423 causal constraints (skipped 276 transitions) in 53 ms.
[2023-03-23 05:29:43] [INFO ] Added : 215 causal constraints over 43 iterations in 2167 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 43 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 713/713 transitions.
Applied a total of 0 rules in 17 ms. Remains 349 /349 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-23 05:29:43] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:43] [INFO ] Invariant cache hit.
[2023-03-23 05:29:44] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
[2023-03-23 05:29:44] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:44] [INFO ] Invariant cache hit.
[2023-03-23 05:29:44] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-23 05:29:44] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:44] [INFO ] Invariant cache hit.
[2023-03-23 05:29:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:29:48] [INFO ] Implicit Places using invariants and state equation in 3597 ms returned []
Implicit Place search using SMT with State Equation took 3960 ms to find 0 implicit places.
[2023-03-23 05:29:48] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-23 05:29:48] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:48] [INFO ] Invariant cache hit.
[2023-03-23 05:29:48] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5109 ms. Remains : 349/349 places, 713/713 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 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 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-23 05:29:49] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:49] [INFO ] Invariant cache hit.
[2023-03-23 05:29:49] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-23 05:29:49] [INFO ] [Real]Absence check using 19 positive and 23 generalized place invariants in 62 ms returned sat
[2023-03-23 05:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:29:50] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2023-03-23 05:29:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:29:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-23 05:29:51] [INFO ] [Nat]Absence check using 19 positive and 23 generalized place invariants in 23 ms returned sat
[2023-03-23 05:29:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:29:52] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2023-03-23 05:29:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:29:52] [INFO ] [Nat]Added 72 Read/Feed constraints in 98 ms returned sat
[2023-03-23 05:29:55] [INFO ] Deduced a trap composed of 45 places in 2872 ms of which 1 ms to minimize.
[2023-03-23 05:29:55] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 0 ms to minimize.
[2023-03-23 05:29:55] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 0 ms to minimize.
[2023-03-23 05:29:55] [INFO ] Deduced a trap composed of 143 places in 154 ms of which 0 ms to minimize.
[2023-03-23 05:29:56] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2023-03-23 05:29:56] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2023-03-23 05:29:56] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 0 ms to minimize.
[2023-03-23 05:29:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3931 ms
[2023-03-23 05:29:56] [INFO ] Computed and/alt/rep : 429/1944/423 causal constraints (skipped 276 transitions) in 47 ms.
[2023-03-23 05:29:58] [INFO ] Added : 215 causal constraints over 43 iterations in 2156 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15376 reset in 470 ms.
Product exploration explored 100000 steps with 15383 reset in 486 ms.
Support contains 43 out of 349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 349/349 places, 713/713 transitions.
Applied a total of 0 rules in 18 ms. Remains 349 /349 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2023-03-23 05:29:59] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:59] [INFO ] Invariant cache hit.
[2023-03-23 05:29:59] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
[2023-03-23 05:29:59] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:29:59] [INFO ] Invariant cache hit.
[2023-03-23 05:30:00] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-23 05:30:00] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:30:00] [INFO ] Invariant cache hit.
[2023-03-23 05:30:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:30:05] [INFO ] Implicit Places using invariants and state equation in 5231 ms returned []
Implicit Place search using SMT with State Equation took 5592 ms to find 0 implicit places.
[2023-03-23 05:30:05] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-23 05:30:05] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2023-03-23 05:30:05] [INFO ] Invariant cache hit.
[2023-03-23 05:30:06] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6660 ms. Remains : 349/349 places, 713/713 transitions.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-03 finished in 36375 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&&X(p0)) U G((X(p1)||F(p2)))))'
Found a Lengthening insensitive property : PolyORBLF-PT-S02J06T06-LTLFireability-09
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), false]
Support contains 6 out of 505 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 505/505 places, 868/868 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 505 transition count 830
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 467 transition count 830
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 76 place count 467 transition count 770
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 196 place count 407 transition count 770
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 197 place count 406 transition count 769
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 406 transition count 769
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 270 place count 370 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 272 place count 368 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 274 place count 368 transition count 731
Applied a total of 274 rules in 43 ms. Remains 368 /505 variables (removed 137) and now considering 731/868 (removed 137) transitions.
[2023-03-23 05:30:06] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
// Phase 1: matrix 719 rows 368 cols
[2023-03-23 05:30:06] [INFO ] Computed 43 place invariants in 15 ms
[2023-03-23 05:30:07] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
[2023-03-23 05:30:07] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:07] [INFO ] Invariant cache hit.
[2023-03-23 05:30:07] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-23 05:30:07] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:07] [INFO ] Invariant cache hit.
[2023-03-23 05:30:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:30:15] [INFO ] Implicit Places using invariants and state equation in 7900 ms returned []
Implicit Place search using SMT with State Equation took 8308 ms to find 0 implicit places.
[2023-03-23 05:30:15] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:15] [INFO ] Invariant cache hit.
[2023-03-23 05:30:16] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 368/505 places, 731/868 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9688 ms. Remains : 368/505 places, 731/868 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s188 1), p2:(GEQ s40 1), p1:(AND (GEQ s12 1) (GEQ s97 1) (GEQ s152 1) (GEQ s305 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8240 reset in 315 ms.
Product exploration explored 100000 steps with 8215 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 16 factoid took 796 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 16 factoid took 931 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 368 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 731/731 transitions.
Applied a total of 0 rules in 5 ms. Remains 368 /368 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2023-03-23 05:30:19] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:19] [INFO ] Invariant cache hit.
[2023-03-23 05:30:19] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
[2023-03-23 05:30:19] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:19] [INFO ] Invariant cache hit.
[2023-03-23 05:30:20] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-23 05:30:20] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:20] [INFO ] Invariant cache hit.
[2023-03-23 05:30:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:30:28] [INFO ] Implicit Places using invariants and state equation in 8752 ms returned []
Implicit Place search using SMT with State Equation took 9156 ms to find 0 implicit places.
[2023-03-23 05:30:28] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:28] [INFO ] Invariant cache hit.
[2023-03-23 05:30:29] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10460 ms. Remains : 368/368 places, 731/731 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 8220 reset in 314 ms.
Product exploration explored 100000 steps with 8245 reset in 328 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 368/368 places, 731/731 transitions.
Applied a total of 0 rules in 23 ms. Remains 368 /368 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2023-03-23 05:30:31] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:31] [INFO ] Invariant cache hit.
[2023-03-23 05:30:32] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2023-03-23 05:30:32] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-23 05:30:32] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:32] [INFO ] Invariant cache hit.
[2023-03-23 05:30:32] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1223 ms. Remains : 368/368 places, 731/731 transitions.
Support contains 5 out of 368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 731/731 transitions.
Applied a total of 0 rules in 2 ms. Remains 368 /368 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2023-03-23 05:30:32] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:32] [INFO ] Invariant cache hit.
[2023-03-23 05:30:33] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
[2023-03-23 05:30:33] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:33] [INFO ] Invariant cache hit.
[2023-03-23 05:30:33] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-23 05:30:33] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:33] [INFO ] Invariant cache hit.
[2023-03-23 05:30:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 05:30:40] [INFO ] Implicit Places using invariants and state equation in 6466 ms returned []
Implicit Place search using SMT with State Equation took 6851 ms to find 0 implicit places.
[2023-03-23 05:30:40] [INFO ] Flow matrix only has 719 transitions (discarded 12 similar events)
[2023-03-23 05:30:40] [INFO ] Invariant cache hit.
[2023-03-23 05:30:40] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8054 ms. Remains : 368/368 places, 731/731 transitions.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-09 finished in 34768 ms.
[2023-03-23 05:30:40] [INFO ] Flatten gal took : 57 ms
[2023-03-23 05:30:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2023-03-23 05:30:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 505 places, 868 transitions and 3693 arcs took 11 ms.
Total runtime 209898 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1783/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1783/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-LTLFireability-03
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-LTLFireability-09

BK_STOP 1679549442981

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBLF-PT-S02J06T06-LTLFireability-03
ltl formula formula --ltl=/tmp/1783/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 505 places, 868 transitions and 3693 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.050 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1783/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1783/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1783/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1783/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name PolyORBLF-PT-S02J06T06-LTLFireability-09
ltl formula formula --ltl=/tmp/1783/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 505 places, 868 transitions and 3693 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.030 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1783/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1783/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1783/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1783/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x557ac22853f4]
1: pnml2lts-mc(+0xa2496) [0x557ac2285496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f79fb8e9140]
3: pnml2lts-mc(+0x405be5) [0x557ac25e8be5]
4: pnml2lts-mc(+0x16b3f9) [0x557ac234e3f9]
5: pnml2lts-mc(+0x164ac4) [0x557ac2347ac4]
6: pnml2lts-mc(+0x272e0a) [0x557ac2455e0a]
7: pnml2lts-mc(+0xb61f0) [0x557ac22991f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f79fb73c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f79fb73c67a]
10: pnml2lts-mc(+0xa1581) [0x557ac2284581]
11: pnml2lts-mc(+0xa1910) [0x557ac2284910]
12: pnml2lts-mc(+0xa32a2) [0x557ac22862a2]
13: pnml2lts-mc(+0xa50f4) [0x557ac22880f4]
14: pnml2lts-mc(+0x3f34b3) [0x557ac25d64b3]
15: pnml2lts-mc(+0x7c63d) [0x557ac225f63d]
16: pnml2lts-mc(+0x67d86) [0x557ac224ad86]
17: pnml2lts-mc(+0x60a8a) [0x557ac2243a8a]
18: pnml2lts-mc(+0x5eb15) [0x557ac2241b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f79fb724d0a]
20: pnml2lts-mc(+0x6075e) [0x557ac224375e]

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="PolyORBLF-PT-S02J06T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T06, 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 r297-tall-167873950600516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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