Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 50K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 257K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 71K Feb 26 00:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 285K Feb 26 00:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 25 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 578K Feb 25 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678901773949

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J80
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 17:36:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 17:36:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 17:36:15] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-15 17:36:15] [INFO ] Transformed 1189 places.
[2023-03-15 17:36:15] [INFO ] Transformed 2350 transitions.
[2023-03-15 17:36:15] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
[2023-03-15 17:36:15] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 17:36:15] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 359 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Applied a total of 0 rules in 93 ms. Remains 1189 /1189 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2023-03-15 17:36:16] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-15 17:36:16] [INFO ] Computed 182 place invariants in 119 ms
[2023-03-15 17:36:20] [INFO ] Dead Transitions using invariants and state equation in 4163 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-15 17:36:20] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
// Phase 1: matrix 1596 rows 1189 cols
[2023-03-15 17:36:20] [INFO ] Computed 182 place invariants in 96 ms
[2023-03-15 17:36:22] [INFO ] Implicit Places using invariants in 2404 ms returned []
[2023-03-15 17:36:22] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
[2023-03-15 17:36:22] [INFO ] Invariant cache hit.
[2023-03-15 17:36:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:36:53] [INFO ] Performed 943/1189 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:36:59] [INFO ] Implicit Places using invariants and state equation in 37023 ms returned []
Implicit Place search using SMT with State Equation took 39430 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1189/1189 places, 1600/1695 transitions.
Applied a total of 0 rules in 46 ms. Remains 1189 /1189 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43940 ms. Remains : 1189/1189 places, 1600/1695 transitions.
Support contains 359 out of 1189 places after structural reductions.
[2023-03-15 17:37:00] [INFO ] Flatten gal took : 215 ms
[2023-03-15 17:37:00] [INFO ] Flatten gal took : 123 ms
[2023-03-15 17:37:00] [INFO ] Input system was already deterministic with 1600 transitions.
Incomplete random walk after 10000 steps, including 665 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 17:37:01] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
[2023-03-15 17:37:01] [INFO ] Invariant cache hit.
[2023-03-15 17:37:01] [INFO ] [Real]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-15 17:37:01] [INFO ] [Real]Absence check using 156 positive and 26 generalized place invariants in 53 ms returned sat
[2023-03-15 17:37:01] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 17:37:01] [INFO ] [Nat]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-15 17:37:01] [INFO ] [Nat]Absence check using 156 positive and 26 generalized place invariants in 49 ms returned sat
[2023-03-15 17:37:06] [INFO ] After 5144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 17:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:37:08] [INFO ] After 1664ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 17:37:09] [INFO ] Deduced a trap composed of 508 places in 448 ms of which 4 ms to minimize.
[2023-03-15 17:37:10] [INFO ] Deduced a trap composed of 505 places in 440 ms of which 2 ms to minimize.
[2023-03-15 17:37:10] [INFO ] Deduced a trap composed of 487 places in 445 ms of which 1 ms to minimize.
[2023-03-15 17:37:11] [INFO ] Deduced a trap composed of 505 places in 421 ms of which 2 ms to minimize.
[2023-03-15 17:37:12] [INFO ] Deduced a trap composed of 505 places in 436 ms of which 1 ms to minimize.
[2023-03-15 17:37:12] [INFO ] Deduced a trap composed of 493 places in 441 ms of which 1 ms to minimize.
[2023-03-15 17:37:13] [INFO ] Deduced a trap composed of 493 places in 418 ms of which 1 ms to minimize.
[2023-03-15 17:37:13] [INFO ] Deduced a trap composed of 493 places in 427 ms of which 2 ms to minimize.
[2023-03-15 17:37:14] [INFO ] Deduced a trap composed of 502 places in 421 ms of which 1 ms to minimize.
[2023-03-15 17:37:14] [INFO ] Deduced a trap composed of 484 places in 432 ms of which 1 ms to minimize.
[2023-03-15 17:37:15] [INFO ] Deduced a trap composed of 508 places in 421 ms of which 0 ms to minimize.
[2023-03-15 17:37:15] [INFO ] Deduced a trap composed of 505 places in 418 ms of which 1 ms to minimize.
[2023-03-15 17:37:16] [INFO ] Deduced a trap composed of 505 places in 423 ms of which 1 ms to minimize.
[2023-03-15 17:37:16] [INFO ] Deduced a trap composed of 496 places in 428 ms of which 1 ms to minimize.
[2023-03-15 17:37:17] [INFO ] Deduced a trap composed of 484 places in 428 ms of which 1 ms to minimize.
[2023-03-15 17:37:18] [INFO ] Deduced a trap composed of 487 places in 418 ms of which 1 ms to minimize.
[2023-03-15 17:37:18] [INFO ] Deduced a trap composed of 481 places in 419 ms of which 1 ms to minimize.
[2023-03-15 17:37:18] [INFO ] Deduced a trap composed of 493 places in 429 ms of which 1 ms to minimize.
[2023-03-15 17:37:19] [INFO ] Deduced a trap composed of 505 places in 411 ms of which 1 ms to minimize.
[2023-03-15 17:37:19] [INFO ] Deduced a trap composed of 505 places in 432 ms of which 1 ms to minimize.
[2023-03-15 17:37:20] [INFO ] Deduced a trap composed of 496 places in 419 ms of which 1 ms to minimize.
[2023-03-15 17:37:21] [INFO ] Deduced a trap composed of 493 places in 417 ms of which 1 ms to minimize.
[2023-03-15 17:37:21] [INFO ] Deduced a trap composed of 487 places in 430 ms of which 1 ms to minimize.
[2023-03-15 17:37:22] [INFO ] Deduced a trap composed of 484 places in 414 ms of which 1 ms to minimize.
[2023-03-15 17:37:22] [INFO ] Deduced a trap composed of 481 places in 406 ms of which 1 ms to minimize.
[2023-03-15 17:37:23] [INFO ] Deduced a trap composed of 490 places in 408 ms of which 2 ms to minimize.
[2023-03-15 17:37:23] [INFO ] Deduced a trap composed of 490 places in 410 ms of which 3 ms to minimize.
[2023-03-15 17:37:24] [INFO ] Deduced a trap composed of 496 places in 405 ms of which 1 ms to minimize.
[2023-03-15 17:37:24] [INFO ] Deduced a trap composed of 487 places in 428 ms of which 1 ms to minimize.
[2023-03-15 17:37:25] [INFO ] Deduced a trap composed of 526 places in 413 ms of which 1 ms to minimize.
[2023-03-15 17:37:25] [INFO ] Deduced a trap composed of 481 places in 407 ms of which 1 ms to minimize.
[2023-03-15 17:37:26] [INFO ] Deduced a trap composed of 517 places in 411 ms of which 1 ms to minimize.
[2023-03-15 17:37:26] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 16976 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 17:37:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 17:37:26] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 82 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1184 transition count 1595
Reduce places removed 5 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 1 with 86 rules applied. Total rules applied 96 place count 1179 transition count 1514
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 177 place count 1098 transition count 1514
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 177 place count 1098 transition count 1510
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 185 place count 1094 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 1093 transition count 1509
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 1093 transition count 1509
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 191 place count 1091 transition count 1507
Applied a total of 191 rules in 442 ms. Remains 1091 /1189 variables (removed 98) and now considering 1507/1600 (removed 93) transitions.
[2023-03-15 17:37:26] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
// Phase 1: matrix 1503 rows 1091 cols
[2023-03-15 17:37:26] [INFO ] Computed 177 place invariants in 46 ms
[2023-03-15 17:37:29] [INFO ] Dead Transitions using invariants and state equation in 2287 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2731 ms. Remains : 1091/1189 places, 1507/1600 transitions.
Incomplete random walk after 10000 steps, including 492 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 96538 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96538 steps, saw 28851 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 17:37:32] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-15 17:37:32] [INFO ] Invariant cache hit.
[2023-03-15 17:37:32] [INFO ] [Real]Absence check using 156 positive place invariants in 29 ms returned sat
[2023-03-15 17:37:32] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 52 ms returned sat
[2023-03-15 17:37:32] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 17:37:33] [INFO ] [Nat]Absence check using 156 positive place invariants in 30 ms returned sat
[2023-03-15 17:37:33] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 52 ms returned sat
[2023-03-15 17:37:43] [INFO ] After 10489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:37:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:37:45] [INFO ] After 1588ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:37:45] [INFO ] Deduced a trap composed of 390 places in 409 ms of which 1 ms to minimize.
[2023-03-15 17:37:46] [INFO ] Deduced a trap composed of 395 places in 412 ms of which 1 ms to minimize.
[2023-03-15 17:37:46] [INFO ] Deduced a trap composed of 392 places in 381 ms of which 1 ms to minimize.
[2023-03-15 17:37:47] [INFO ] Deduced a trap composed of 402 places in 374 ms of which 1 ms to minimize.
[2023-03-15 17:37:47] [INFO ] Deduced a trap composed of 426 places in 380 ms of which 1 ms to minimize.
[2023-03-15 17:37:48] [INFO ] Deduced a trap composed of 399 places in 379 ms of which 1 ms to minimize.
[2023-03-15 17:37:48] [INFO ] Deduced a trap composed of 374 places in 380 ms of which 1 ms to minimize.
[2023-03-15 17:37:48] [INFO ] Deduced a trap composed of 389 places in 382 ms of which 2 ms to minimize.
[2023-03-15 17:37:49] [INFO ] Deduced a trap composed of 422 places in 369 ms of which 1 ms to minimize.
[2023-03-15 17:37:49] [INFO ] Deduced a trap composed of 389 places in 371 ms of which 0 ms to minimize.
[2023-03-15 17:37:50] [INFO ] Deduced a trap composed of 381 places in 382 ms of which 1 ms to minimize.
[2023-03-15 17:37:50] [INFO ] Deduced a trap composed of 398 places in 376 ms of which 1 ms to minimize.
[2023-03-15 17:37:51] [INFO ] Deduced a trap composed of 404 places in 371 ms of which 1 ms to minimize.
[2023-03-15 17:37:51] [INFO ] Deduced a trap composed of 407 places in 381 ms of which 1 ms to minimize.
[2023-03-15 17:37:52] [INFO ] Deduced a trap composed of 405 places in 377 ms of which 1 ms to minimize.
[2023-03-15 17:37:52] [INFO ] Deduced a trap composed of 398 places in 367 ms of which 2 ms to minimize.
[2023-03-15 17:37:53] [INFO ] Deduced a trap composed of 393 places in 374 ms of which 1 ms to minimize.
[2023-03-15 17:37:53] [INFO ] Deduced a trap composed of 405 places in 375 ms of which 1 ms to minimize.
[2023-03-15 17:37:54] [INFO ] Deduced a trap composed of 408 places in 367 ms of which 1 ms to minimize.
[2023-03-15 17:37:55] [INFO ] Deduced a trap composed of 393 places in 375 ms of which 0 ms to minimize.
[2023-03-15 17:37:55] [INFO ] Deduced a trap composed of 392 places in 370 ms of which 1 ms to minimize.
[2023-03-15 17:37:56] [INFO ] Deduced a trap composed of 405 places in 376 ms of which 0 ms to minimize.
[2023-03-15 17:37:57] [INFO ] Deduced a trap composed of 410 places in 379 ms of which 1 ms to minimize.
[2023-03-15 17:37:57] [INFO ] Deduced a trap composed of 395 places in 382 ms of which 0 ms to minimize.
[2023-03-15 17:37:58] [INFO ] Deduced a trap composed of 396 places in 366 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 17:37:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 17:37:58] [INFO ] After 25376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 1 ms.
Support contains 82 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 54 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1091/1091 places, 1507/1507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 56 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
[2023-03-15 17:37:58] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-15 17:37:58] [INFO ] Invariant cache hit.
[2023-03-15 17:38:00] [INFO ] Implicit Places using invariants in 2431 ms returned []
[2023-03-15 17:38:00] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-15 17:38:00] [INFO ] Invariant cache hit.
[2023-03-15 17:38:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:38:29] [INFO ] Implicit Places using invariants and state equation in 28709 ms returned []
Implicit Place search using SMT with State Equation took 31143 ms to find 0 implicit places.
[2023-03-15 17:38:29] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-15 17:38:29] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-15 17:38:29] [INFO ] Invariant cache hit.
[2023-03-15 17:38:31] [INFO ] Dead Transitions using invariants and state equation in 2262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33564 ms. Remains : 1091/1091 places, 1507/1507 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1091 transition count 1503
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1091 transition count 1502
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1090 transition count 1502
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1090 transition count 1501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1089 transition count 1501
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1089 transition count 1496
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1084 transition count 1496
Applied a total of 18 rules in 168 ms. Remains 1084 /1091 variables (removed 7) and now considering 1496/1507 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1496 rows 1084 cols
[2023-03-15 17:38:32] [INFO ] Computed 177 place invariants in 51 ms
[2023-03-15 17:38:32] [INFO ] [Real]Absence check using 156 positive place invariants in 28 ms returned sat
[2023-03-15 17:38:32] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 46 ms returned sat
[2023-03-15 17:38:32] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 17:38:32] [INFO ] [Nat]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-15 17:38:32] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 44 ms returned sat
[2023-03-15 17:40:46] [INFO ] After 133994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!p1||X(p1)) U p2)||p0))))'
Support contains 82 out of 1189 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1183 transition count 1599
Applied a total of 7 rules in 57 ms. Remains 1183 /1189 variables (removed 6) and now considering 1599/1600 (removed 1) transitions.
[2023-03-15 17:40:46] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-15 17:40:46] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-15 17:40:50] [INFO ] Dead Transitions using invariants and state equation in 3607 ms found 0 transitions.
[2023-03-15 17:40:50] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:40:50] [INFO ] Invariant cache hit.
[2023-03-15 17:40:52] [INFO ] Implicit Places using invariants in 2600 ms returned []
[2023-03-15 17:40:52] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:40:52] [INFO ] Invariant cache hit.
[2023-03-15 17:40:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:41:23] [INFO ] Performed 525/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:41:52] [INFO ] Implicit Places using invariants and state equation in 59694 ms returned []
Implicit Place search using SMT with State Equation took 62297 ms to find 0 implicit places.
[2023-03-15 17:41:52] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:41:52] [INFO ] Invariant cache hit.
[2023-03-15 17:41:55] [INFO ] Dead Transitions using invariants and state equation in 3394 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69361 ms. Remains : 1183/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s773 1) (GEQ s1 1) (GEQ s834 1) (GEQ s381 1) (GEQ s1171 1) (GEQ s895 1) (GEQ s571 1) (GEQ s75 1) (GEQ s1112 1) (GEQ s515 1) (GEQ s208 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 6 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-01 finished in 69601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1184 transition count 1516
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1100 transition count 1516
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 168 place count 1100 transition count 1432
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 336 place count 1016 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1015 transition count 1431
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1015 transition count 1431
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 1014 transition count 1430
Applied a total of 340 rules in 162 ms. Remains 1014 /1189 variables (removed 175) and now considering 1430/1600 (removed 170) transitions.
[2023-03-15 17:41:56] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2023-03-15 17:41:56] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 17:41:58] [INFO ] Dead Transitions using invariants and state equation in 1891 ms found 0 transitions.
[2023-03-15 17:41:58] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:41:58] [INFO ] Invariant cache hit.
[2023-03-15 17:42:00] [INFO ] Implicit Places using invariants in 2282 ms returned []
[2023-03-15 17:42:00] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:42:00] [INFO ] Invariant cache hit.
[2023-03-15 17:42:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:42:31] [INFO ] Performed 705/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:42:40] [INFO ] Implicit Places using invariants and state equation in 39858 ms returned []
Implicit Place search using SMT with State Equation took 42142 ms to find 0 implicit places.
[2023-03-15 17:42:40] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-15 17:42:40] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:42:40] [INFO ] Invariant cache hit.
[2023-03-15 17:42:42] [INFO ] Dead Transitions using invariants and state equation in 1961 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1014/1189 places, 1430/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46242 ms. Remains : 1014/1189 places, 1430/1600 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s739 1) (OR (LT s485 9) (LT s806 1) (LT s898 1)) (OR (LT s485 9) (LT s547 1) (LT s898 1)) (OR (LT s485 9) (LT s898 1) (LT s936 1)) (OR (LT s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5512 reset in 813 ms.
Product exploration explored 100000 steps with 5530 reset in 810 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-15 17:42:44] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:42:44] [INFO ] Invariant cache hit.
[2023-03-15 17:42:45] [INFO ] [Real]Absence check using 156 positive place invariants in 112 ms returned sat
[2023-03-15 17:42:45] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 88 ms returned sat
[2023-03-15 17:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:42:50] [INFO ] [Real]Absence check using state equation in 4768 ms returned sat
[2023-03-15 17:42:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 17:42:51] [INFO ] [Nat]Absence check using 156 positive place invariants in 168 ms returned sat
[2023-03-15 17:42:51] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 192 ms returned sat
[2023-03-15 17:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 17:42:57] [INFO ] [Nat]Absence check using state equation in 5782 ms returned sat
[2023-03-15 17:42:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:42:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 91 ms returned sat
[2023-03-15 17:42:57] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 117 ms.
[2023-03-15 17:42:58] [INFO ] Added : 18 causal constraints over 4 iterations in 803 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 52 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 17:42:58] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:42:58] [INFO ] Invariant cache hit.
[2023-03-15 17:43:00] [INFO ] Dead Transitions using invariants and state equation in 1851 ms found 0 transitions.
[2023-03-15 17:43:00] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:43:00] [INFO ] Invariant cache hit.
[2023-03-15 17:43:02] [INFO ] Implicit Places using invariants in 2349 ms returned []
[2023-03-15 17:43:02] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:43:02] [INFO ] Invariant cache hit.
[2023-03-15 17:43:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:43:33] [INFO ] Performed 761/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:43:43] [INFO ] Implicit Places using invariants and state equation in 40264 ms returned []
Implicit Place search using SMT with State Equation took 42614 ms to find 0 implicit places.
[2023-03-15 17:43:43] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-15 17:43:43] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:43:43] [INFO ] Invariant cache hit.
[2023-03-15 17:43:45] [INFO ] Dead Transitions using invariants and state equation in 1945 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46496 ms. Remains : 1014/1014 places, 1430/1430 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-15 17:43:45] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:43:45] [INFO ] Invariant cache hit.
[2023-03-15 17:43:46] [INFO ] [Real]Absence check using 156 positive place invariants in 105 ms returned sat
[2023-03-15 17:43:46] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 84 ms returned sat
[2023-03-15 17:43:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:43:51] [INFO ] [Real]Absence check using state equation in 4749 ms returned sat
[2023-03-15 17:43:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 17:43:52] [INFO ] [Nat]Absence check using 156 positive place invariants in 168 ms returned sat
[2023-03-15 17:43:52] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 198 ms returned sat
[2023-03-15 17:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 17:43:58] [INFO ] [Nat]Absence check using state equation in 5844 ms returned sat
[2023-03-15 17:43:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:43:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 88 ms returned sat
[2023-03-15 17:43:58] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 77 ms.
[2023-03-15 17:43:59] [INFO ] Added : 18 causal constraints over 4 iterations in 746 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5520 reset in 732 ms.
Product exploration explored 100000 steps with 5525 reset in 780 ms.
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 43 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 17:44:01] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:44:01] [INFO ] Invariant cache hit.
[2023-03-15 17:44:03] [INFO ] Dead Transitions using invariants and state equation in 1961 ms found 0 transitions.
[2023-03-15 17:44:03] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:44:03] [INFO ] Invariant cache hit.
[2023-03-15 17:44:05] [INFO ] Implicit Places using invariants in 2377 ms returned []
[2023-03-15 17:44:05] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:44:05] [INFO ] Invariant cache hit.
[2023-03-15 17:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:44:36] [INFO ] Performed 838/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:44:42] [INFO ] Implicit Places using invariants and state equation in 36769 ms returned []
Implicit Place search using SMT with State Equation took 39148 ms to find 0 implicit places.
[2023-03-15 17:44:42] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-15 17:44:42] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:44:42] [INFO ] Invariant cache hit.
[2023-03-15 17:44:44] [INFO ] Dead Transitions using invariants and state equation in 1930 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43129 ms. Remains : 1014/1014 places, 1430/1430 transitions.
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-03 finished in 168229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(G(p1))&&F(p2)))))))'
Support contains 96 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1188 transition count 1599
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1188 transition count 1599
Applied a total of 2 rules in 54 ms. Remains 1188 /1189 variables (removed 1) and now considering 1599/1600 (removed 1) transitions.
[2023-03-15 17:44:44] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-15 17:44:44] [INFO ] Computed 182 place invariants in 34 ms
[2023-03-15 17:44:48] [INFO ] Dead Transitions using invariants and state equation in 3588 ms found 0 transitions.
[2023-03-15 17:44:48] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:44:48] [INFO ] Invariant cache hit.
[2023-03-15 17:44:50] [INFO ] Implicit Places using invariants in 2560 ms returned []
[2023-03-15 17:44:50] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:44:50] [INFO ] Invariant cache hit.
[2023-03-15 17:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:45:21] [INFO ] Performed 713/1188 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:45:36] [INFO ] Implicit Places using invariants and state equation in 46237 ms returned []
Implicit Place search using SMT with State Equation took 48799 ms to find 0 implicit places.
[2023-03-15 17:45:36] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:45:36] [INFO ] Invariant cache hit.
[2023-03-15 17:45:40] [INFO ] Dead Transitions using invariants and state equation in 3542 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1188/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55985 ms. Remains : 1188/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s406 1), p1:(AND (OR (LT s370 1) (LT s579 1) (LT s842 1) (LT s1072 1)) (OR (LT s579 1) (LT s675 1) (LT s842 1) (LT s1038 1)) (OR (LT s522 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10328 reset in 768 ms.
Product exploration explored 100000 steps with 10305 reset in 762 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 312 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 271 steps, including 16 resets, run visited all 4 properties in 6 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 329 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-15 17:45:43] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:45:43] [INFO ] Invariant cache hit.
[2023-03-15 17:45:44] [INFO ] [Real]Absence check using 155 positive place invariants in 112 ms returned sat
[2023-03-15 17:45:45] [INFO ] [Real]Absence check using 155 positive and 27 generalized place invariants in 169 ms returned sat
[2023-03-15 17:45:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:45:52] [INFO ] [Real]Absence check using state equation in 7959 ms returned sat
[2023-03-15 17:45:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 17:45:54] [INFO ] [Nat]Absence check using 155 positive place invariants in 151 ms returned sat
[2023-03-15 17:45:54] [INFO ] [Nat]Absence check using 155 positive and 27 generalized place invariants in 248 ms returned sat
[2023-03-15 17:45:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 17:46:02] [INFO ] [Nat]Absence check using state equation in 7441 ms returned sat
[2023-03-15 17:46:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:46:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2587 ms returned sat
[2023-03-15 17:46:05] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 78 ms.
[2023-03-15 17:46:05] [INFO ] Added : 40 causal constraints over 8 iterations in 950 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 27 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-15 17:46:05] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:46:05] [INFO ] Invariant cache hit.
[2023-03-15 17:46:09] [INFO ] Dead Transitions using invariants and state equation in 3399 ms found 0 transitions.
[2023-03-15 17:46:09] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:46:09] [INFO ] Invariant cache hit.
[2023-03-15 17:46:11] [INFO ] Implicit Places using invariants in 2559 ms returned []
[2023-03-15 17:46:11] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:46:11] [INFO ] Invariant cache hit.
[2023-03-15 17:46:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:46:42] [INFO ] Performed 685/1188 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:47:06] [INFO ] Implicit Places using invariants and state equation in 54160 ms returned []
Implicit Place search using SMT with State Equation took 56724 ms to find 0 implicit places.
[2023-03-15 17:47:06] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:47:06] [INFO ] Invariant cache hit.
[2023-03-15 17:47:09] [INFO ] Dead Transitions using invariants and state equation in 3515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63674 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 287 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 2196 steps, including 151 resets, run visited all 4 properties in 21 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 394 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-15 17:47:10] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:47:10] [INFO ] Invariant cache hit.
[2023-03-15 17:47:12] [INFO ] [Real]Absence check using 155 positive place invariants in 113 ms returned sat
[2023-03-15 17:47:12] [INFO ] [Real]Absence check using 155 positive and 27 generalized place invariants in 165 ms returned sat
[2023-03-15 17:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:47:20] [INFO ] [Real]Absence check using state equation in 8137 ms returned sat
[2023-03-15 17:47:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 17:47:22] [INFO ] [Nat]Absence check using 155 positive place invariants in 150 ms returned sat
[2023-03-15 17:47:22] [INFO ] [Nat]Absence check using 155 positive and 27 generalized place invariants in 251 ms returned sat
[2023-03-15 17:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 17:47:30] [INFO ] [Nat]Absence check using state equation in 7561 ms returned sat
[2023-03-15 17:47:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:47:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 2643 ms returned sat
[2023-03-15 17:47:32] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 77 ms.
[2023-03-15 17:47:33] [INFO ] Added : 40 causal constraints over 8 iterations in 937 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10319 reset in 736 ms.
Product exploration explored 100000 steps with 10325 reset in 766 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1188 transition count 1599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 82 place count 1188 transition count 1600
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 1188 transition count 1600
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 169 place count 1188 transition count 1600
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 252 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 1 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 335 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 335 rules in 253 ms. Remains 1105 /1188 variables (removed 83) and now considering 1517/1599 (removed 82) transitions.
[2023-03-15 17:47:35] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
// Phase 1: matrix 1513 rows 1105 cols
[2023-03-15 17:47:35] [INFO ] Computed 182 place invariants in 35 ms
[2023-03-15 17:47:37] [INFO ] Dead Transitions using invariants and state equation in 1931 ms found 0 transitions.
[2023-03-15 17:47:37] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-15 17:47:37] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
[2023-03-15 17:47:37] [INFO ] Invariant cache hit.
[2023-03-15 17:47:39] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1105/1188 places, 1517/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4122 ms. Remains : 1105/1188 places, 1517/1599 transitions.
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 27 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-15 17:47:39] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-15 17:47:39] [INFO ] Computed 182 place invariants in 31 ms
[2023-03-15 17:47:43] [INFO ] Dead Transitions using invariants and state equation in 3491 ms found 0 transitions.
[2023-03-15 17:47:43] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:47:43] [INFO ] Invariant cache hit.
[2023-03-15 17:47:45] [INFO ] Implicit Places using invariants in 2499 ms returned []
[2023-03-15 17:47:45] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:47:45] [INFO ] Invariant cache hit.
[2023-03-15 17:47:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:48:16] [INFO ] Performed 718/1188 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:48:33] [INFO ] Implicit Places using invariants and state equation in 47670 ms returned []
Implicit Place search using SMT with State Equation took 50171 ms to find 0 implicit places.
[2023-03-15 17:48:33] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:48:33] [INFO ] Invariant cache hit.
[2023-03-15 17:48:37] [INFO ] Dead Transitions using invariants and state equation in 3544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57235 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-04 finished in 232678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1184 transition count 1515
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1099 transition count 1515
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1099 transition count 1430
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 340 place count 1014 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 341 place count 1013 transition count 1429
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 1013 transition count 1429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 344 place count 1012 transition count 1428
Applied a total of 344 rules in 138 ms. Remains 1012 /1189 variables (removed 177) and now considering 1428/1600 (removed 172) transitions.
[2023-03-15 17:48:37] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2023-03-15 17:48:37] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-15 17:48:39] [INFO ] Dead Transitions using invariants and state equation in 1904 ms found 0 transitions.
[2023-03-15 17:48:39] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-15 17:48:39] [INFO ] Invariant cache hit.
[2023-03-15 17:48:41] [INFO ] Implicit Places using invariants in 2320 ms returned []
[2023-03-15 17:48:41] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-15 17:48:41] [INFO ] Invariant cache hit.
[2023-03-15 17:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:49:11] [INFO ] Implicit Places using invariants and state equation in 30102 ms returned []
Implicit Place search using SMT with State Equation took 32423 ms to find 0 implicit places.
[2023-03-15 17:49:11] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-15 17:49:11] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-15 17:49:11] [INFO ] Invariant cache hit.
[2023-03-15 17:49:13] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1012/1189 places, 1428/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36435 ms. Remains : 1012/1189 places, 1428/1600 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s738 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-05 finished in 36492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(F(p1)&&G(F(p2)))))'
Support contains 171 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1184 transition count 1596
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1180 transition count 1596
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 1180 transition count 1593
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 1177 transition count 1593
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 1176 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 1176 transition count 1592
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 1174 transition count 1590
Applied a total of 20 rules in 118 ms. Remains 1174 /1189 variables (removed 15) and now considering 1590/1600 (removed 10) transitions.
[2023-03-15 17:49:13] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
// Phase 1: matrix 1586 rows 1174 cols
[2023-03-15 17:49:13] [INFO ] Computed 177 place invariants in 36 ms
[2023-03-15 17:49:16] [INFO ] Dead Transitions using invariants and state equation in 2879 ms found 0 transitions.
[2023-03-15 17:49:16] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-15 17:49:16] [INFO ] Invariant cache hit.
[2023-03-15 17:49:19] [INFO ] Implicit Places using invariants in 2458 ms returned []
[2023-03-15 17:49:19] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-15 17:49:19] [INFO ] Invariant cache hit.
[2023-03-15 17:49:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:49:38] [INFO ] Implicit Places using invariants and state equation in 19217 ms returned []
Implicit Place search using SMT with State Equation took 21676 ms to find 0 implicit places.
[2023-03-15 17:49:38] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-15 17:49:38] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-15 17:49:38] [INFO ] Invariant cache hit.
[2023-03-15 17:49:41] [INFO ] Dead Transitions using invariants and state equation in 2778 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1174/1189 places, 1590/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27499 ms. Remains : 1174/1189 places, 1590/1600 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s569 9) (LT s931 1) (LT s1041 1)) (OR (LT s569 9) (LT s640 1) (LT s1041 1)) (OR (LT s569 9) (LT s1041 1) (LT s1087 1)) (OR (LT s569 9) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-07 finished in 27702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1 U p2))))'
Support contains 6 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1183 transition count 1599
Applied a total of 7 rules in 64 ms. Remains 1183 /1189 variables (removed 6) and now considering 1599/1600 (removed 1) transitions.
[2023-03-15 17:49:41] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-15 17:49:41] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 17:49:45] [INFO ] Dead Transitions using invariants and state equation in 3640 ms found 0 transitions.
[2023-03-15 17:49:45] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:49:45] [INFO ] Invariant cache hit.
[2023-03-15 17:49:47] [INFO ] Implicit Places using invariants in 2672 ms returned []
[2023-03-15 17:49:47] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:49:47] [INFO ] Invariant cache hit.
[2023-03-15 17:49:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:50:18] [INFO ] Performed 537/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:50:48] [INFO ] Performed 1050/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-15 17:50:53] [INFO ] Implicit Places using invariants and state equation in 65964 ms returned []
Implicit Place search using SMT with State Equation took 68636 ms to find 0 implicit places.
[2023-03-15 17:50:53] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:50:53] [INFO ] Invariant cache hit.
[2023-03-15 17:50:57] [INFO ] Dead Transitions using invariants and state equation in 3484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75826 ms. Remains : 1183/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s636 1) (GEQ s885 1)), p1:(AND (GEQ s121 1) (GEQ s671 1) (GEQ s1095 1)), p0:(AND (GEQ s427 1) (GEQ s636 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-08 finished in 76013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U (p2||G(p1)))))'
Support contains 4 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1184 transition count 1518
Reduce places removed 82 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 85 rules applied. Total rules applied 167 place count 1102 transition count 1515
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 170 place count 1099 transition count 1515
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 170 place count 1099 transition count 1432
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 336 place count 1016 transition count 1432
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 340 place count 1014 transition count 1430
Applied a total of 340 rules in 114 ms. Remains 1014 /1189 variables (removed 175) and now considering 1430/1600 (removed 170) transitions.
[2023-03-15 17:50:57] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2023-03-15 17:50:57] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-15 17:50:59] [INFO ] Dead Transitions using invariants and state equation in 1815 ms found 0 transitions.
[2023-03-15 17:50:59] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:50:59] [INFO ] Invariant cache hit.
[2023-03-15 17:51:01] [INFO ] Implicit Places using invariants in 2364 ms returned []
[2023-03-15 17:51:01] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:51:01] [INFO ] Invariant cache hit.
[2023-03-15 17:51:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:51:32] [INFO ] Performed 685/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:51:43] [INFO ] Implicit Places using invariants and state equation in 41850 ms returned []
Implicit Place search using SMT with State Equation took 44216 ms to find 0 implicit places.
[2023-03-15 17:51:43] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 17:51:43] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:51:43] [INFO ] Invariant cache hit.
[2023-03-15 17:51:45] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1014/1189 places, 1430/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48081 ms. Remains : 1014/1189 places, 1430/1600 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) (NOT p1)), true, (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (LT s385 1) (LT s986 1)), p1:(LT s986 1), p0:(AND (GEQ s494 1) (GEQ s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-11 finished in 48238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1183 transition count 1599
Applied a total of 7 rules in 60 ms. Remains 1183 /1189 variables (removed 6) and now considering 1599/1600 (removed 1) transitions.
[2023-03-15 17:51:45] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-15 17:51:45] [INFO ] Computed 177 place invariants in 36 ms
[2023-03-15 17:51:49] [INFO ] Dead Transitions using invariants and state equation in 3564 ms found 0 transitions.
[2023-03-15 17:51:49] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:51:49] [INFO ] Invariant cache hit.
[2023-03-15 17:51:51] [INFO ] Implicit Places using invariants in 2562 ms returned []
[2023-03-15 17:51:51] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:51:51] [INFO ] Invariant cache hit.
[2023-03-15 17:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:52:22] [INFO ] Performed 700/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:52:43] [INFO ] Implicit Places using invariants and state equation in 51757 ms returned []
Implicit Place search using SMT with State Equation took 54320 ms to find 0 implicit places.
[2023-03-15 17:52:43] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:52:43] [INFO ] Invariant cache hit.
[2023-03-15 17:52:46] [INFO ] Dead Transitions using invariants and state equation in 3440 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61386 ms. Remains : 1183/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s62 1) (GEQ s671 1) (GEQ s1095 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-13 finished in 61470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 1184 transition count 1514
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 172 place count 1098 transition count 1429
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 342 place count 1013 transition count 1429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 346 place count 1011 transition count 1427
Applied a total of 346 rules in 99 ms. Remains 1011 /1189 variables (removed 178) and now considering 1427/1600 (removed 173) transitions.
[2023-03-15 17:52:47] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-15 17:52:47] [INFO ] Computed 177 place invariants in 47 ms
[2023-03-15 17:52:49] [INFO ] Dead Transitions using invariants and state equation in 1984 ms found 0 transitions.
[2023-03-15 17:52:49] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-15 17:52:49] [INFO ] Invariant cache hit.
[2023-03-15 17:52:51] [INFO ] Implicit Places using invariants in 2475 ms returned []
[2023-03-15 17:52:51] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-15 17:52:51] [INFO ] Invariant cache hit.
[2023-03-15 17:52:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:53:22] [INFO ] Performed 615/1011 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:53:37] [INFO ] Implicit Places using invariants and state equation in 45927 ms returned []
Implicit Place search using SMT with State Equation took 48403 ms to find 0 implicit places.
[2023-03-15 17:53:37] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-15 17:53:37] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-15 17:53:37] [INFO ] Invariant cache hit.
[2023-03-15 17:53:39] [INFO ] Dead Transitions using invariants and state equation in 1858 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1011/1189 places, 1427/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52383 ms. Remains : 1011/1189 places, 1427/1600 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-14 finished in 52462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1183 transition count 1599
Applied a total of 7 rules in 62 ms. Remains 1183 /1189 variables (removed 6) and now considering 1599/1600 (removed 1) transitions.
[2023-03-15 17:53:39] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-15 17:53:39] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-15 17:53:43] [INFO ] Dead Transitions using invariants and state equation in 3616 ms found 0 transitions.
[2023-03-15 17:53:43] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:53:43] [INFO ] Invariant cache hit.
[2023-03-15 17:53:45] [INFO ] Implicit Places using invariants in 2709 ms returned []
[2023-03-15 17:53:45] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:53:45] [INFO ] Invariant cache hit.
[2023-03-15 17:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:54:16] [INFO ] Performed 525/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:54:46] [INFO ] Performed 1091/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-15 17:54:53] [INFO ] Implicit Places using invariants and state equation in 68029 ms returned []
Implicit Place search using SMT with State Equation took 70740 ms to find 0 implicit places.
[2023-03-15 17:54:53] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 17:54:53] [INFO ] Invariant cache hit.
[2023-03-15 17:54:57] [INFO ] Dead Transitions using invariants and state equation in 3412 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77833 ms. Remains : 1183/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s368 1), p1:(GEQ s967 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-15 finished in 77983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(G(p1))&&F(p2)))))))'
Found a Shortening insensitive property : PolyORBNT-PT-S05J80-LTLFireability-04
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1189 transition count 1517
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 1106 transition count 1517
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 166 place count 1106 transition count 1432
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 336 place count 1021 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1020 transition count 1431
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1020 transition count 1431
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 1019 transition count 1430
Applied a total of 340 rules in 113 ms. Remains 1019 /1189 variables (removed 170) and now considering 1430/1600 (removed 170) transitions.
[2023-03-15 17:54:57] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1019 cols
[2023-03-15 17:54:57] [INFO ] Computed 182 place invariants in 34 ms
[2023-03-15 17:54:59] [INFO ] Dead Transitions using invariants and state equation in 2014 ms found 0 transitions.
[2023-03-15 17:54:59] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:54:59] [INFO ] Invariant cache hit.
[2023-03-15 17:55:02] [INFO ] Implicit Places using invariants in 2345 ms returned []
[2023-03-15 17:55:02] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:55:02] [INFO ] Invariant cache hit.
[2023-03-15 17:55:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:55:32] [INFO ] Performed 946/1019 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:55:33] [INFO ] Implicit Places using invariants and state equation in 31588 ms returned []
Implicit Place search using SMT with State Equation took 33933 ms to find 0 implicit places.
[2023-03-15 17:55:33] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:55:33] [INFO ] Invariant cache hit.
[2023-03-15 17:55:35] [INFO ] Dead Transitions using invariants and state equation in 1945 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1019/1189 places, 1430/1600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38007 ms. Remains : 1019/1189 places, 1430/1600 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s345 1), p1:(AND (OR (LT s313 1) (LT s491 1) (LT s721 1) (LT s916 1)) (OR (LT s491 1) (LT s573 1) (LT s721 1) (LT s889 1)) (OR (LT s442 1) (LT s49...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14820 reset in 818 ms.
Product exploration explored 100000 steps with 14794 reset in 859 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 173 steps, including 10 resets, run visited all 4 properties in 7 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 347 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-15 17:55:38] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:55:38] [INFO ] Invariant cache hit.
[2023-03-15 17:55:39] [INFO ] [Real]Absence check using 156 positive place invariants in 104 ms returned sat
[2023-03-15 17:55:39] [INFO ] [Real]Absence check using 156 positive and 26 generalized place invariants in 158 ms returned sat
[2023-03-15 17:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:55:42] [INFO ] [Real]Absence check using state equation in 2652 ms returned sat
[2023-03-15 17:55:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 17:55:43] [INFO ] [Nat]Absence check using 156 positive place invariants in 135 ms returned sat
[2023-03-15 17:55:44] [INFO ] [Nat]Absence check using 156 positive and 26 generalized place invariants in 306 ms returned sat
[2023-03-15 17:55:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 17:55:56] [INFO ] [Nat]Absence check using state equation in 11916 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 15 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 17:55:56] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:55:56] [INFO ] Invariant cache hit.
[2023-03-15 17:55:58] [INFO ] Dead Transitions using invariants and state equation in 1948 ms found 0 transitions.
[2023-03-15 17:55:58] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:55:58] [INFO ] Invariant cache hit.
[2023-03-15 17:56:00] [INFO ] Implicit Places using invariants in 2363 ms returned []
[2023-03-15 17:56:00] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:56:00] [INFO ] Invariant cache hit.
[2023-03-15 17:56:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:56:31] [INFO ] Performed 947/1019 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 17:56:33] [INFO ] Implicit Places using invariants and state equation in 33025 ms returned []
Implicit Place search using SMT with State Equation took 35390 ms to find 0 implicit places.
[2023-03-15 17:56:33] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:56:33] [INFO ] Invariant cache hit.
[2023-03-15 17:56:35] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39208 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 271 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 69 steps, including 4 resets, run visited all 4 properties in 4 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 372 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-15 17:56:36] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:56:36] [INFO ] Invariant cache hit.
[2023-03-15 17:56:37] [INFO ] [Real]Absence check using 156 positive place invariants in 102 ms returned sat
[2023-03-15 17:56:37] [INFO ] [Real]Absence check using 156 positive and 26 generalized place invariants in 158 ms returned sat
[2023-03-15 17:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:56:40] [INFO ] [Real]Absence check using state equation in 2619 ms returned sat
[2023-03-15 17:56:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 17:56:41] [INFO ] [Nat]Absence check using 156 positive place invariants in 129 ms returned sat
[2023-03-15 17:56:42] [INFO ] [Nat]Absence check using 156 positive and 26 generalized place invariants in 303 ms returned sat
[2023-03-15 17:56:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 17:56:53] [INFO ] [Nat]Absence check using state equation in 11851 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14849 reset in 815 ms.
Product exploration explored 100000 steps with 14778 reset in 857 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 48 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 17:56:55] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:56:55] [INFO ] Invariant cache hit.
[2023-03-15 17:56:57] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
[2023-03-15 17:56:57] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 17:56:57] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:56:57] [INFO ] Invariant cache hit.
[2023-03-15 17:56:59] [INFO ] Dead Transitions using invariants and state equation in 1920 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3922 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 16 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 17:56:59] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:56:59] [INFO ] Invariant cache hit.
[2023-03-15 17:57:01] [INFO ] Dead Transitions using invariants and state equation in 1924 ms found 0 transitions.
[2023-03-15 17:57:01] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:57:01] [INFO ] Invariant cache hit.
[2023-03-15 17:57:04] [INFO ] Implicit Places using invariants in 2288 ms returned []
[2023-03-15 17:57:04] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:57:04] [INFO ] Invariant cache hit.
[2023-03-15 17:57:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:57:30] [INFO ] Implicit Places using invariants and state equation in 26576 ms returned []
Implicit Place search using SMT with State Equation took 28866 ms to find 0 implicit places.
[2023-03-15 17:57:30] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 17:57:30] [INFO ] Invariant cache hit.
[2023-03-15 17:57:32] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32656 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-04 finished in 155019 ms.
[2023-03-15 17:57:32] [INFO ] Flatten gal took : 81 ms
[2023-03-15 17:57:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-15 17:57:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1189 places, 1600 transitions and 7964 arcs took 9 ms.
Total runtime 1277353 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-PT-S05J80
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA PolyORBNT-PT-S05J80-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678903136611

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 PolyORBNT-PT-S05J80-LTLFireability-04
lola: time limit : 1798 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for PolyORBNT-PT-S05J80-LTLFireability-04
lola: result : true
lola: markings : 450
lola: fired transitions : 2384
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBNT-PT-S05J80-LTLFireability-03
lola: time limit : 3597 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3597 3/32 PolyORBNT-PT-S05J80-LTLFireability-03 199003 m, 39800 m/sec, 489821 t fired, .

Time elapsed: 8 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3597 5/32 PolyORBNT-PT-S05J80-LTLFireability-03 410526 m, 42304 m/sec, 999810 t fired, .

Time elapsed: 13 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3597 8/32 PolyORBNT-PT-S05J80-LTLFireability-03 618695 m, 41633 m/sec, 1505432 t fired, .

Time elapsed: 18 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3597 10/32 PolyORBNT-PT-S05J80-LTLFireability-03 826303 m, 41521 m/sec, 2014093 t fired, .

Time elapsed: 23 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3597 12/32 PolyORBNT-PT-S05J80-LTLFireability-03 1008394 m, 36418 m/sec, 2414461 t fired, .

Time elapsed: 28 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3597 14/32 PolyORBNT-PT-S05J80-LTLFireability-03 1183210 m, 34963 m/sec, 2792446 t fired, .

Time elapsed: 33 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3597 16/32 PolyORBNT-PT-S05J80-LTLFireability-03 1357048 m, 34767 m/sec, 3157259 t fired, .

Time elapsed: 38 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3597 18/32 PolyORBNT-PT-S05J80-LTLFireability-03 1531690 m, 34928 m/sec, 3523831 t fired, .

Time elapsed: 43 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3597 20/32 PolyORBNT-PT-S05J80-LTLFireability-03 1701974 m, 34056 m/sec, 3882034 t fired, .

Time elapsed: 48 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3597 22/32 PolyORBNT-PT-S05J80-LTLFireability-03 1873335 m, 34272 m/sec, 4242089 t fired, .

Time elapsed: 53 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3597 24/32 PolyORBNT-PT-S05J80-LTLFireability-03 2041993 m, 33731 m/sec, 4595423 t fired, .

Time elapsed: 58 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3597 25/32 PolyORBNT-PT-S05J80-LTLFireability-03 2211726 m, 33946 m/sec, 4957215 t fired, .

Time elapsed: 63 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3597 27/32 PolyORBNT-PT-S05J80-LTLFireability-03 2380736 m, 33802 m/sec, 5315192 t fired, .

Time elapsed: 68 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3597 29/32 PolyORBNT-PT-S05J80-LTLFireability-03 2547346 m, 33322 m/sec, 5671771 t fired, .

Time elapsed: 73 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3597 31/32 PolyORBNT-PT-S05J80-LTLFireability-03 2717266 m, 33984 m/sec, 6032494 t fired, .

Time elapsed: 78 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for PolyORBNT-PT-S05J80-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J80-LTLFireability-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 83 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J80-LTLFireability-03: LTL unknown AGGR
PolyORBNT-PT-S05J80-LTLFireability-04: LTL true LTL model checker


Time elapsed: 83 secs. Pages in use: 32

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="PolyORBNT-PT-S05J80"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PolyORBNT-PT-S05J80, 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 r295-tall-167873948300748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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