Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397500100.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-COL-V50P50N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397500100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.0K Apr 13 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 13 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 03:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716279053104

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:10:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 08:10:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:10:54] [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.
[2024-05-21 08:10:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:10:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 526 ms
[2024-05-21 08:10:54] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 08:10:55] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 08:10:55] [INFO ] Skeletonized 7 HLPN properties in 1 ms. Removed 9 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Remains 2 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 499 steps (0 resets) in 10 ms. (45 steps per ms) remains 0/2 properties
[2024-05-21 08:10:55] [INFO ] Flatten gal took : 11 ms
[2024-05-21 08:10:55] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 08:10:55] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 107 ms.
[2024-05-21 08:10:55] [INFO ] Unfolded 15 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 34 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 08:10:55] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 08:10:55] [INFO ] Computed 5 invariants in 17 ms
[2024-05-21 08:10:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 08:11:22] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 08:11:52] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 57533ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 57590ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 50 transitions.
[2024-05-21 08:11:53] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-05-21 08:11:53] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 08:11:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 08:11:53] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:11:53] [INFO ] Invariant cache hit.
[2024-05-21 08:11:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:11:53] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2298/2348 transitions.
Applied a total of 0 rules in 19 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57905 ms. Remains : 136/138 places, 2298/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-05-21 08:11:53] [INFO ] Flatten gal took : 216 ms
[2024-05-21 08:11:54] [INFO ] Flatten gal took : 229 ms
[2024-05-21 08:11:56] [INFO ] Input system was already deterministic with 2298 transitions.
Reduction of identical properties reduced properties to check from 23 to 18
RANDOM walk for 40000 steps (92 resets) in 5192 ms. (7 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40004 steps (32 resets) in 727 ms. (54 steps per ms) remains 1/1 properties
[2024-05-21 08:11:57] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:11:57] [INFO ] Invariant cache hit.
[2024-05-21 08:11:57] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 82/425 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 109 stabilizing places and 204 stable transitions
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F((!p0&&X((!p0 U (!p1||G(!p0)))))))) U G(p2)))'
Support contains 125 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 10 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:11:58] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:11:58] [INFO ] Invariant cache hit.
[2024-05-21 08:11:58] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:12:23] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 56222ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 56246ms
[2024-05-21 08:12:54] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:12:54] [INFO ] Invariant cache hit.
[2024-05-21 08:12:54] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-21 08:12:54] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:12:54] [INFO ] Invariant cache hit.
[2024-05-21 08:12:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:12:55] [INFO ] Implicit Places using invariants and state equation in 619 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 777 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 17 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57057 ms. Remains : 134/136 places, 2298/2298 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-01
Product exploration explored 100000 steps with 25065 reset in 1102 ms.
Product exploration explored 100000 steps with 24935 reset in 858 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/134 stabilizing places and 204/2298 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 143 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 39090 steps (90 resets) in 3062 ms. (12 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Support contains 125 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:13:00] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-05-21 08:13:00] [INFO ] Computed 5 invariants in 9 ms
[2024-05-21 08:13:00] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:13:23] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 55677ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 55705ms
[2024-05-21 08:13:55] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:13:55] [INFO ] Invariant cache hit.
[2024-05-21 08:13:55] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 08:13:55] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:13:55] [INFO ] Invariant cache hit.
[2024-05-21 08:13:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:13:56] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:13:56] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:13:56] [INFO ] Invariant cache hit.
[2024-05-21 08:13:56] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:14:19] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 75457ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 75495ms
Finished structural reductions in LTL mode , in 1 iterations and 131794 ms. Remains : 134/134 places, 2298/2298 transitions.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/134 stabilizing places and 204/2298 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 29081 steps (67 resets) in 2401 ms. (12 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 701 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 326 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Product exploration explored 100000 steps with 25034 reset in 1084 ms.
Product exploration explored 100000 steps with 24975 reset in 794 ms.
Support contains 125 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 15 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:15:17] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:15:17] [INFO ] Invariant cache hit.
[2024-05-21 08:15:17] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:15:41] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 55975ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 56005ms
[2024-05-21 08:16:13] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:16:13] [INFO ] Invariant cache hit.
[2024-05-21 08:16:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 08:16:13] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:16:13] [INFO ] Invariant cache hit.
[2024-05-21 08:16:13] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:16:13] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:16:13] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:16:13] [INFO ] Invariant cache hit.
[2024-05-21 08:16:13] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:16:37] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
SMT process timed out in 75388ms, After SMT, problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 75426ms
Finished structural reductions in LTL mode , in 1 iterations and 131966 ms. Remains : 134/134 places, 2298/2298 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-01 finished in 331150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X((G(p2)||p1))&&p0)))))'
Support contains 57 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 31 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:17:29] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-05-21 08:17:29] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 08:17:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:17:53] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56486ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56510ms
[2024-05-21 08:18:26] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:18:26] [INFO ] Invariant cache hit.
[2024-05-21 08:18:26] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 08:18:26] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:18:26] [INFO ] Invariant cache hit.
[2024-05-21 08:18:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:18:26] [INFO ] Implicit Places using invariants and state equation in 650 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 861 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2297/2298 transitions.
Applied a total of 0 rules in 12 ms. Remains 134 /134 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57422 ms. Remains : 134/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-02
Entered a terminal (fully accepting) state of product in 154 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-02 finished in 57668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1 U (p2||G(p1)))||p0)))))'
Support contains 53 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:18:27] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-05-21 08:18:27] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 08:18:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:18:51] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 56925ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 56946ms
[2024-05-21 08:19:24] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:19:24] [INFO ] Invariant cache hit.
[2024-05-21 08:19:24] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-21 08:19:24] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:19:24] [INFO ] Invariant cache hit.
[2024-05-21 08:19:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:19:25] [INFO ] Implicit Places using invariants and state equation in 834 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1068 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 14 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58043 ms. Remains : 134/136 places, 2298/2298 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-03
Entered a terminal (fully accepting) state of product in 186 steps with 0 reset in 8 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-03 finished in 58263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0 U (p1||G(!p0)))&&(!p2 U (p3||G(!p2)))))))'
Support contains 127 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 414 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:19:25] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-05-21 08:19:25] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 08:19:25] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:19:49] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56493ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56517ms
[2024-05-21 08:20:22] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:20:22] [INFO ] Invariant cache hit.
[2024-05-21 08:20:22] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 08:20:22] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:20:22] [INFO ] Invariant cache hit.
[2024-05-21 08:20:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:20:22] [INFO ] Implicit Places using invariants and state equation in 405 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 520 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2297/2298 transitions.
Applied a total of 0 rules in 229 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57685 ms. Remains : 133/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-04
Product exploration explored 100000 steps with 1534 reset in 3747 ms.
Product exploration explored 100000 steps with 1476 reset in 3730 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT p1)), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND (NOT p1) p0) (AND (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) p2)))), (X (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) p2))))), (X (X (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 759 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
RANDOM walk for 1033 steps (0 resets) in 182 ms. (5 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT p1)), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND (NOT p1) p0) (AND (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) p2)))), (X (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) p2))))), (X (X (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR p1 p2 p0) (OR p1 (NOT p3) p0)))), (F (NOT p3)), (F (NOT (AND (OR (NOT p1) p2 p3) (OR p2 p3 p0)))), (F (NOT (OR (NOT p2) p3))), (F p2), (F (NOT (OR p2 p3))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0))), (F p1), (F (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 1104 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 183 ms :[(OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
[2024-05-21 08:20:33] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 08:20:33] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 08:20:35] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:20:35] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-21 08:20:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:20:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:20:37] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-21 08:20:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:20:37] [INFO ] [Nat]Added 41 Read/Feed constraints in 123 ms returned sat
[2024-05-21 08:20:37] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 96 ms.
[2024-05-21 08:20:38] [INFO ] Added : 59 causal constraints over 14 iterations in 428 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 127 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 224 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:20:38] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:20:38] [INFO ] Invariant cache hit.
[2024-05-21 08:20:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:21:02] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56659ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56682ms
[2024-05-21 08:21:35] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:21:35] [INFO ] Invariant cache hit.
[2024-05-21 08:21:35] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 08:21:35] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:21:35] [INFO ] Invariant cache hit.
[2024-05-21 08:21:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:21:35] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-05-21 08:21:35] [INFO ] Redundant transitions in 111 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:21:35] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:21:35] [INFO ] Invariant cache hit.
[2024-05-21 08:21:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:21:58] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 76161ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 76185ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 133638 ms. Remains : 133/133 places, 2297/2297 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0)))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (OR (AND (NOT p1) p0) (AND p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 904 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
RANDOM walk for 991 steps (0 resets) in 287 ms. (3 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0)))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (OR (AND (NOT p1) p0) (AND p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR p2 p1 p0) (OR (NOT p3) p1 p0)))), (F (NOT p3)), (F (NOT (AND (OR p2 p3 (NOT p1)) (OR p2 p3 p0)))), (F (NOT (OR (NOT p2) p3))), (F p2), (F (NOT (OR p2 p3))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F p1), (F (NOT (OR p1 p0))), (F (NOT (OR (AND p2 (NOT p3)) (AND (NOT p1) p0))))]
Knowledge based reduction with 10 factoid took 1117 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 200 ms :[(OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
[2024-05-21 08:22:54] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:22:54] [INFO ] Invariant cache hit.
[2024-05-21 08:22:57] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:22:57] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2024-05-21 08:22:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:22:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:22:59] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-21 08:22:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:23:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 08:23:02] [INFO ] [Nat]Added 41 Read/Feed constraints in 3016 ms returned unknown
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 161 ms :[(OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
Product exploration timeout after 80110 steps with 1177 reset in 10003 ms.
Product exploration timeout after 73480 steps with 1119 reset in 10001 ms.
Support contains 127 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 248 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:23:22] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:23:22] [INFO ] Invariant cache hit.
[2024-05-21 08:23:22] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:23:46] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56851ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56875ms
[2024-05-21 08:24:19] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:24:19] [INFO ] Invariant cache hit.
[2024-05-21 08:24:19] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 08:24:19] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:24:19] [INFO ] Invariant cache hit.
[2024-05-21 08:24:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:24:19] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-21 08:24:19] [INFO ] Redundant transitions in 126 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:24:20] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:24:20] [INFO ] Invariant cache hit.
[2024-05-21 08:24:20] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:24:43] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 75885ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 75912ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 133620 ms. Remains : 133/133 places, 2297/2297 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-04 finished in 370795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||((G(p3)||p2)&&p1))))'
Support contains 128 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 329 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:25:36] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-05-21 08:25:36] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 08:25:36] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:26:02] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 57161ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 57189ms
[2024-05-21 08:26:33] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:26:33] [INFO ] Invariant cache hit.
[2024-05-21 08:26:33] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 08:26:33] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:26:33] [INFO ] Invariant cache hit.
[2024-05-21 08:26:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:26:34] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-21 08:26:34] [INFO ] Redundant transitions in 127 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:26:34] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:26:34] [INFO ] Invariant cache hit.
[2024-05-21 08:26:34] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:26:59] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 77026ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 77054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/136 places, 2297/2298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135129 ms. Remains : 135/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-05
Product exploration explored 100000 steps with 3438 reset in 2779 ms.
Product exploration explored 100000 steps with 3395 reset in 2534 ms.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 20 factoid took 701 ms. Reduced automaton from 2 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
RANDOM walk for 40000 steps (92 resets) in 1425 ms. (28 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40001 steps (36 resets) in 1498 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (38 resets) in 1029 ms. (38 steps per ms) remains 2/2 properties
[2024-05-21 08:27:58] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:27:58] [INFO ] Invariant cache hit.
[2024-05-21 08:27:58] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 133/423 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 363ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (G (AND (OR (NOT p0) p1 (NOT p3)) (OR (NOT p0) (NOT p3) p2))), (G (OR (NOT p0) (NOT p1) (NOT p3) p2))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR p0 p1 (NOT p3)) (OR p0 (NOT p3) p2)))), (F p0), (F (NOT (AND (OR (NOT p0) p1 p3) (OR (NOT p0) p3 p2)))), (F (NOT (OR p0 (NOT p1) (NOT p3) p2))), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (F p3), (F p1), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) p3 p2))))]
Knowledge based reduction with 22 factoid took 1051 ms. Reduced automaton from 2 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (AND p0 p1 p3 (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1 p3 (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 103 ms :[(OR (AND p0 p1 p3 (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1 p3 (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
[2024-05-21 08:28:00] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:28:00] [INFO ] Invariant cache hit.
[2024-05-21 08:28:03] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-21 08:28:03] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-21 08:28:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:28:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:28:06] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-05-21 08:28:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:28:06] [INFO ] [Nat]Added 41 Read/Feed constraints in 328 ms returned sat
[2024-05-21 08:28:07] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 1 ms to minimize.
[2024-05-21 08:28:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 468 ms
[2024-05-21 08:28:07] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 181 ms.
[2024-05-21 08:28:08] [INFO ] Added : 24 causal constraints over 7 iterations in 983 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2) (NOT p3))
[2024-05-21 08:28:08] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:28:08] [INFO ] Invariant cache hit.
[2024-05-21 08:28:10] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:28:10] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-05-21 08:28:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:28:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 08:28:12] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-21 08:28:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:28:12] [INFO ] [Nat]Added 41 Read/Feed constraints in 91 ms returned sat
[2024-05-21 08:28:12] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 55 ms.
[2024-05-21 08:28:13] [INFO ] Added : 18 causal constraints over 5 iterations in 255 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 128 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2297/2297 transitions.
Applied a total of 0 rules in 256 ms. Remains 135 /135 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:28:13] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:28:13] [INFO ] Invariant cache hit.
[2024-05-21 08:28:13] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:28:38] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 57144ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 57167ms
[2024-05-21 08:29:10] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:29:10] [INFO ] Invariant cache hit.
[2024-05-21 08:29:10] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 08:29:10] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:29:10] [INFO ] Invariant cache hit.
[2024-05-21 08:29:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:29:10] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-21 08:29:11] [INFO ] Redundant transitions in 131 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:29:11] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:29:11] [INFO ] Invariant cache hit.
[2024-05-21 08:29:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:29:36] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 76647ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 76675ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 134630 ms. Remains : 135/135 places, 2297/2297 transitions.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3)))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3))))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 18 factoid took 651 ms. Reduced automaton from 2 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND p0 p1 (NOT p2) p3) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1 (NOT p2) p3) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
RANDOM walk for 40000 steps (92 resets) in 779 ms. (51 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40002 steps (36 resets) in 662 ms. (60 steps per ms) remains 1/1 properties
[2024-05-21 08:30:28] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:30:28] [INFO ] Invariant cache hit.
[2024-05-21 08:30:28] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 133/423 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3)))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3))))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (G (OR (NOT p0) (NOT p1) p2 (NOT p3)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) p2 p3)))), (F (NOT (AND (OR p0 p2 (NOT p3)) (OR p1 (NOT p3))))), (F (NOT (AND (OR (NOT p0) p1 p3) (OR (NOT p0) p2 p3)))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3)))), (F p3), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND p0 p1 (NOT p2) p3)))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F p0), (F p1)]
Knowledge based reduction with 19 factoid took 820 ms. Reduced automaton from 2 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 70 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
[2024-05-21 08:30:30] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:30:30] [INFO ] Invariant cache hit.
[2024-05-21 08:30:33] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-21 08:30:33] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-05-21 08:30:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:30:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:30:35] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-05-21 08:30:36] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:30:36] [INFO ] [Nat]Added 41 Read/Feed constraints in 331 ms returned sat
[2024-05-21 08:30:36] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 1 ms to minimize.
[2024-05-21 08:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2024-05-21 08:30:36] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 75 ms.
[2024-05-21 08:30:37] [INFO ] Added : 24 causal constraints over 7 iterations in 852 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2) (NOT p3))
[2024-05-21 08:30:37] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:30:37] [INFO ] Invariant cache hit.
[2024-05-21 08:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-21 08:30:40] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-05-21 08:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 08:30:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 08:30:42] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-21 08:30:42] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:30:42] [INFO ] [Nat]Added 41 Read/Feed constraints in 86 ms returned sat
[2024-05-21 08:30:42] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 53 ms.
[2024-05-21 08:30:42] [INFO ] Added : 18 causal constraints over 5 iterations in 195 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 3539 reset in 2623 ms.
Product exploration explored 100000 steps with 3681 reset in 2886 ms.
Support contains 128 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2297/2297 transitions.
Applied a total of 0 rules in 244 ms. Remains 135 /135 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:30:48] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:30:48] [INFO ] Invariant cache hit.
[2024-05-21 08:30:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:31:13] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56548ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56570ms
[2024-05-21 08:31:45] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:31:45] [INFO ] Invariant cache hit.
[2024-05-21 08:31:45] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 08:31:45] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:31:45] [INFO ] Invariant cache hit.
[2024-05-21 08:31:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:31:45] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-21 08:31:45] [INFO ] Redundant transitions in 87 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 08:31:45] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 08:31:45] [INFO ] Invariant cache hit.
[2024-05-21 08:31:45] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 08:32:10] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 50.0)
(s1 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 76905ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 76936ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 134168 ms. Remains : 135/135 places, 2297/2297 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-05 finished in 446635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U !p2)))'
Support contains 56 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:33:02] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-05-21 08:33:02] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 08:33:02] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:33:25] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 55602ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 55641ms
[2024-05-21 08:33:58] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:33:58] [INFO ] Invariant cache hit.
[2024-05-21 08:33:58] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-21 08:33:58] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:33:58] [INFO ] Invariant cache hit.
[2024-05-21 08:33:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 08:33:59] [INFO ] Implicit Places using invariants and state equation in 635 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 893 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56565 ms. Remains : 134/136 places, 2298/2298 transitions.
Stuttering acceptance computed with spot in 80 ms :[p2, p2, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 683 ms.
Product exploration explored 100000 steps with 50000 reset in 699 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/134 stabilizing places and 204/2298 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-06 finished in 58100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(!p0)))))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 11 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 08:34:00] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 08:34:00] [INFO ] Invariant cache hit.
[2024-05-21 08:34:01] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 08:34:26] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V50P50N20

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 15
TRANSITIONS: 11
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 4
COLOR VARS: 4
ARCS: 56
LOADING TIME: 0.148

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 138
TRANSITIONS: 2348
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 18090
UNFOLDING TIME: 3.604

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.101
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 4.006
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1997
MODEL NAME: /home/mcc/execution/model
138 places, 2348 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-02 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-08 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-09 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716282206901

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="BridgeAndVehicles-COL-V50P50N20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BridgeAndVehicles-COL-V50P50N20, 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 r047-tajo-171620397500100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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