About the Execution of LoLa+red for CSRepetitions-COL-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 380.048 | 44715.00 | 68471.00 | 516.90 | FFFTTFFFFFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r071-smll-167814397500036.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 lolaxred
Input is CSRepetitions-COL-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397500036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.0K Feb 25 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 12:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678224024522
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 21:20:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-07 21:20:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 21:20:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-07 21:20:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 21:20:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1075 ms
[2023-03-07 21:20:28] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 498 PT places and 833.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2023-03-07 21:20:28] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 9 ms.
[2023-03-07 21:20:28] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 5 formulas.
FORMULA CSRepetitions-COL-07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Finished random walk after 59 steps, including 0 resets, run visited all 6 properties in 14 ms. (steps per millisecond=4 )
[2023-03-07 21:20:29] [INFO ] Flatten gal took : 27 ms
[2023-03-07 21:20:29] [INFO ] Flatten gal took : 5 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 7
[2023-03-07 21:20:29] [INFO ] Unfolded HLPN to a Petri net with 198 places and 245 transitions 735 arcs in 32 ms.
[2023-03-07 21:20:29] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 198 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 16 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2023-03-07 21:20:29] [INFO ] Computed 50 place invariants in 28 ms
[2023-03-07 21:20:29] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-07 21:20:29] [INFO ] Invariant cache hit.
[2023-03-07 21:20:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:30] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-07 21:20:30] [INFO ] Invariant cache hit.
[2023-03-07 21:20:30] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1149 ms. Remains : 198/198 places, 245/245 transitions.
Support contains 198 out of 198 places after structural reductions.
[2023-03-07 21:20:30] [INFO ] Flatten gal took : 60 ms
[2023-03-07 21:20:30] [INFO ] Flatten gal took : 72 ms
[2023-03-07 21:20:30] [INFO ] Input system was already deterministic with 245 transitions.
Finished random walk after 85 steps, including 0 resets, run visited all 7 properties in 11 ms. (steps per millisecond=7 )
Computed a total of 0 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 14 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:31] [INFO ] Invariant cache hit.
[2023-03-07 21:20:31] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-07 21:20:31] [INFO ] Invariant cache hit.
[2023-03-07 21:20:31] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:31] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2023-03-07 21:20:31] [INFO ] Invariant cache hit.
[2023-03-07 21:20:32] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 349 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s64 1) (GEQ s66 1) (GEQ s68 1) (GEQ s70 1) (GEQ s72 1) (GEQ s74 1) (GEQ s76 1) (GEQ s78 1) (GEQ s80 1) (GEQ s82 1) (GEQ s84 1) (GEQ s86 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8650 reset in 1422 ms.
Product exploration explored 100000 steps with 8611 reset in 1195 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 514 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 26 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 578 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-07 21:20:36] [INFO ] Invariant cache hit.
[2023-03-07 21:20:37] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2023-03-07 21:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:20:37] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-07 21:20:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:20:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2023-03-07 21:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:20:37] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-07 21:20:37] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:37] [INFO ] [Nat]Added 49 Read/Feed constraints in 18 ms returned sat
[2023-03-07 21:20:37] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-07 21:20:38] [INFO ] Added : 0 causal constraints over 0 iterations in 78 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:38] [INFO ] Invariant cache hit.
[2023-03-07 21:20:38] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-07 21:20:38] [INFO ] Invariant cache hit.
[2023-03-07 21:20:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:38] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-07 21:20:38] [INFO ] Invariant cache hit.
[2023-03-07 21:20:38] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 198/198 places, 245/245 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 552 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 358 steps, including 5 resets, run visited all 4 properties in 17 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 636 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-07 21:20:40] [INFO ] Invariant cache hit.
[2023-03-07 21:20:41] [INFO ] [Real]Absence check using 50 positive place invariants in 22 ms returned sat
[2023-03-07 21:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:20:41] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-07 21:20:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:20:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 18 ms returned sat
[2023-03-07 21:20:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:20:42] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-07 21:20:42] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:42] [INFO ] [Nat]Added 49 Read/Feed constraints in 10 ms returned sat
[2023-03-07 21:20:42] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 40 ms.
[2023-03-07 21:20:42] [INFO ] Added : 0 causal constraints over 0 iterations in 96 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 8656 reset in 1172 ms.
Product exploration explored 100000 steps with 8587 reset in 969 ms.
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:44] [INFO ] Invariant cache hit.
[2023-03-07 21:20:45] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-07 21:20:45] [INFO ] Invariant cache hit.
[2023-03-07 21:20:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:45] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-07 21:20:45] [INFO ] Invariant cache hit.
[2023-03-07 21:20:45] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 198/198 places, 245/245 transitions.
Treatment of property CSRepetitions-COL-07-LTLFireability-00 finished in 14442 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(p1)||p0))&&X(G(p2))))'
Support contains 98 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:45] [INFO ] Invariant cache hit.
[2023-03-07 21:20:46] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-07 21:20:46] [INFO ] Invariant cache hit.
[2023-03-07 21:20:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:46] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-07 21:20:46] [INFO ] Invariant cache hit.
[2023-03-07 21:20:46] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(OR (GEQ s131 1) (GEQ s129 1) (GEQ s135 1) (GEQ s133 1) (GEQ s139 1) (GEQ s137 1) (GEQ s143 1) (GEQ s141 1) (GEQ s147 1) (GEQ s145 1) (GEQ s100 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 103 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-02 finished in 951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&G(F(p1))))'
Support contains 100 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 19 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:46] [INFO ] Invariant cache hit.
[2023-03-07 21:20:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-07 21:20:46] [INFO ] Invariant cache hit.
[2023-03-07 21:20:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:46] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-07 21:20:47] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-07 21:20:47] [INFO ] Invariant cache hit.
[2023-03-07 21:20:47] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s84 1) (GEQ s99 1)) (AND (GEQ s94 1) (GEQ s99 1)) (AND (GEQ s74 1) (GEQ s99 1)) (AND (GEQ s55 1) (GEQ s99 1)) (AND (GEQ s65 1) (GEQ s99 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 366 steps with 24 reset in 4 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-05 finished in 685 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)&&F(G(p1)))))'
Support contains 98 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:47] [INFO ] Invariant cache hit.
[2023-03-07 21:20:47] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-07 21:20:47] [INFO ] Invariant cache hit.
[2023-03-07 21:20:47] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:47] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-07 21:20:47] [INFO ] Invariant cache hit.
[2023-03-07 21:20:48] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s131 1) (GEQ s129 1) (GEQ s135 1) (GEQ s133 1) (GEQ s139 1) (GEQ s137 1) (GEQ s143 1) (GEQ s141 1) (GEQ s147 1) (GEQ s145 1) (GEQ s100 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 258 steps with 2 reset in 2 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-06 finished in 904 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 49 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 246 place count 50 transition count 147
Applied a total of 246 rules in 38 ms. Remains 50 /198 variables (removed 148) and now considering 147/245 (removed 98) transitions.
// Phase 1: matrix 147 rows 50 cols
[2023-03-07 21:20:48] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 21:20:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-07 21:20:48] [INFO ] Invariant cache hit.
[2023-03-07 21:20:48] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-07 21:20:48] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-07 21:20:48] [INFO ] Invariant cache hit.
[2023-03-07 21:20:48] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/198 places, 147/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 50/198 places, 147/245 transitions.
Stuttering acceptance computed with spot in 89 ms :[p0]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s15 1) (GEQ s17 1) (GEQ s19 1) (GEQ s21 1) (GEQ s23 1) (GEQ s25 1) (GEQ s27 1) (GEQ s29 1) (GEQ s31 1) (GEQ s33 1) (GEQ s35 1) (GEQ s37 1) (GE...], 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 3447 reset in 800 ms.
Stack based approach found an accepted trace after 42 steps with 1 reset with depth 12 and stack size 12 in 1 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-07 finished in 1205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||(p1 U G(p0))))'
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2023-03-07 21:20:49] [INFO ] Computed 50 place invariants in 4 ms
[2023-03-07 21:20:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-07 21:20:49] [INFO ] Invariant cache hit.
[2023-03-07 21:20:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:49] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-07 21:20:49] [INFO ] Invariant cache hit.
[2023-03-07 21:20:50] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s0 1) (GEQ s29 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-08 finished in 818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)&&X(G(p0))) U p2))'
Support contains 98 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:50] [INFO ] Invariant cache hit.
[2023-03-07 21:20:50] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-07 21:20:50] [INFO ] Invariant cache hit.
[2023-03-07 21:20:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:50] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-07 21:20:50] [INFO ] Invariant cache hit.
[2023-03-07 21:20:51] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 845 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), true, (NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (GEQ s131 1) (GEQ s129 1) (GEQ s135 1) (GEQ s133 1) (GEQ s139 1) (GEQ s137 1) (GEQ s143 1) (GEQ s141 1) (GEQ s147 1) (GEQ s145 1) (GEQ s100 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-09 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(!p1)||X((F(p0) U p2)))))'
Support contains 100 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:51] [INFO ] Invariant cache hit.
[2023-03-07 21:20:51] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-07 21:20:51] [INFO ] Invariant cache hit.
[2023-03-07 21:20:51] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:51] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-07 21:20:51] [INFO ] Invariant cache hit.
[2023-03-07 21:20:51] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s84 1) (GEQ s99 1)) (AND (GEQ s94 1) (GEQ s99 1)) (AND (GEQ s74 1) (GEQ s99 1)) (AND (GEQ s55 1) (GEQ s99 1)) (AND (GEQ s65 1) (GEQ s99 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 924 ms.
Product exploration explored 100000 steps with 50000 reset in 567 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 9 factoid took 168 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-07-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLFireability-10 finished in 2657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p0))))'
Support contains 98 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:53] [INFO ] Invariant cache hit.
[2023-03-07 21:20:54] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-07 21:20:54] [INFO ] Invariant cache hit.
[2023-03-07 21:20:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:54] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-07 21:20:54] [INFO ] Invariant cache hit.
[2023-03-07 21:20:54] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s21 1) (GEQ s169 1)) (AND (GEQ s48 1) (GEQ s196 1)) (AND (GEQ s6 1) (GEQ s154 1)) (AND (GEQ s16 1) (GEQ s164 1)) (AND (GEQ s26 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 4322 steps with 146 reset in 83 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-13 finished in 660 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 49 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-07 21:20:54] [INFO ] Invariant cache hit.
[2023-03-07 21:20:54] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-07 21:20:54] [INFO ] Invariant cache hit.
[2023-03-07 21:20:55] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:55] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2023-03-07 21:20:55] [INFO ] Invariant cache hit.
[2023-03-07 21:20:55] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 800 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-14 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 (GEQ s64 1) (GEQ s66 1) (GEQ s68 1) (GEQ s70 1) (GEQ s72 1) (GEQ s74 1) (GEQ s76 1) (GEQ s78 1) (GEQ s80 1) (GEQ s82 1) (GEQ s84 1) (GEQ s86 1) (GE...], 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 9619 reset in 571 ms.
Product exploration explored 100000 steps with 9567 reset in 597 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 124 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 41 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-07 21:20:57] [INFO ] Invariant cache hit.
[2023-03-07 21:20:57] [INFO ] [Real]Absence check using 50 positive place invariants in 22 ms returned sat
[2023-03-07 21:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:20:57] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-07 21:20:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:20:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2023-03-07 21:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:20:57] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-07 21:20:57] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:57] [INFO ] [Nat]Added 49 Read/Feed constraints in 11 ms returned sat
[2023-03-07 21:20:57] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-07 21:20:58] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 49 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 246 place count 50 transition count 147
Applied a total of 246 rules in 22 ms. Remains 50 /198 variables (removed 148) and now considering 147/245 (removed 98) transitions.
// Phase 1: matrix 147 rows 50 cols
[2023-03-07 21:20:58] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 21:20:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-07 21:20:58] [INFO ] Invariant cache hit.
[2023-03-07 21:20:58] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-07 21:20:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-07 21:20:58] [INFO ] Invariant cache hit.
[2023-03-07 21:20:58] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/198 places, 147/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 50/198 places, 147/245 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-07-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLFireability-14 finished in 3782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 49 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 19 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2023-03-07 21:20:58] [INFO ] Computed 50 place invariants in 3 ms
[2023-03-07 21:20:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-07 21:20:58] [INFO ] Invariant cache hit.
[2023-03-07 21:20:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-07 21:20:58] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-07 21:20:58] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-07 21:20:58] [INFO ] Invariant cache hit.
[2023-03-07 21:20:59] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 837 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s131 1) (GEQ s129 1) (GEQ s135 1) (GEQ s133 1) (GEQ s139 1) (GEQ s137 1) (GEQ s143 1) (GEQ s141 1) (GEQ s147 1) (GEQ s145 1) (GEQ s100 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-15 finished in 933 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 U X(p1)))))'
Found a Lengthening insensitive property : CSRepetitions-COL-07-LTLFireability-00
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
Applied a total of 243 rules in 18 ms. Remains 52 /198 variables (removed 146) and now considering 148/245 (removed 97) transitions.
// Phase 1: matrix 148 rows 52 cols
[2023-03-07 21:20:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-07 21:20:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-07 21:20:59] [INFO ] Invariant cache hit.
[2023-03-07 21:20:59] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-07 21:20:59] [INFO ] Invariant cache hit.
[2023-03-07 21:20:59] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 52/198 places, 148/245 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 261 ms. Remains : 52/198 places, 148/245 transitions.
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s15 1) (GEQ s17 1) (GEQ s19 1) (GEQ s21 1) (GEQ s23 1) (GEQ s25 1) (GEQ s27 1) (GEQ s29 1) (GEQ s31 1) (GEQ s33 1) (GEQ s35 1) (GEQ s37 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33170 reset in 573 ms.
Product exploration explored 100000 steps with 32973 reset in 405 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 525 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 34 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 624 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-07 21:21:02] [INFO ] Invariant cache hit.
[2023-03-07 21:21:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-07 21:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:21:02] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-07 21:21:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:21:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-07 21:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:21:03] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-07 21:21:03] [INFO ] Computed and/alt/rep : 98/98/98 causal constraints (skipped 1 transitions) in 16 ms.
[2023-03-07 21:21:03] [INFO ] Added : 1 causal constraints over 1 iterations in 50 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 50 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 148/148 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-07 21:21:03] [INFO ] Invariant cache hit.
[2023-03-07 21:21:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-07 21:21:03] [INFO ] Invariant cache hit.
[2023-03-07 21:21:03] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-07 21:21:03] [INFO ] Invariant cache hit.
[2023-03-07 21:21:03] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 52/52 places, 148/148 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 500 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 671 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-07 21:21:05] [INFO ] Invariant cache hit.
[2023-03-07 21:21:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-07 21:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:21:05] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-07 21:21:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:21:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-07 21:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:21:06] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-07 21:21:06] [INFO ] Computed and/alt/rep : 98/98/98 causal constraints (skipped 1 transitions) in 14 ms.
[2023-03-07 21:21:06] [INFO ] Added : 1 causal constraints over 1 iterations in 39 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33146 reset in 651 ms.
Product exploration explored 100000 steps with 33182 reset in 438 ms.
Support contains 50 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 148/148 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-07 21:21:07] [INFO ] Invariant cache hit.
[2023-03-07 21:21:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-07 21:21:07] [INFO ] Invariant cache hit.
[2023-03-07 21:21:07] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-07 21:21:07] [INFO ] Invariant cache hit.
[2023-03-07 21:21:07] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 52/52 places, 148/148 transitions.
Treatment of property CSRepetitions-COL-07-LTLFireability-00 finished in 8508 ms.
[2023-03-07 21:21:07] [INFO ] Flatten gal took : 30 ms
[2023-03-07 21:21:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-07 21:21:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 245 transitions and 735 arcs took 4 ms.
Total runtime 40561 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CSRepetitions-COL-07
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
FORMULA CSRepetitions-COL-07-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678224069237
--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CSRepetitions-COL-07-LTLFireability-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CSRepetitions-COL-07-LTLFireability-00
lola: result : false
lola: markings : 65
lola: fired transitions : 66
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-COL-07-LTLFireability-00: LTL false LTL model checker
Time elapsed: 0 secs. Pages in use: 1
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="CSRepetitions-COL-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CSRepetitions-COL-07, 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 r071-smll-167814397500036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-07.tgz
mv CSRepetitions-COL-07 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 '
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 ;