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.r293-tall-167873945900788.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 itstools
Input is PolyORBNT-PT-S10J80, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945900788
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 30K Feb 26 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 786K Feb 26 01:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 26 01:03 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 34K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 181K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 26 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 26 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 02:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Feb 26 02:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.0K 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 14M 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-S10J80-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J80-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678974869689

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J80
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 13:54:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 13:54:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 13:54:32] [INFO ] Load time of PNML (sax parser for PT used): 603 ms
[2023-03-16 13:54:32] [INFO ] Transformed 1614 places.
[2023-03-16 13:54:32] [INFO ] Transformed 13500 transitions.
[2023-03-16 13:54:32] [INFO ] Parsed PT model containing 1614 places and 13500 transitions and 119759 arcs in 795 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2023-03-16 13:54:32] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1095 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 3390
Applied a total of 10 rules in 127 ms. Remains 1604 /1614 variables (removed 10) and now considering 3390/3390 (removed 0) transitions.
[2023-03-16 13:54:33] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1604 cols
[2023-03-16 13:54:33] [INFO ] Computed 182 place invariants in 269 ms
[2023-03-16 13:54:39] [INFO ] Dead Transitions using invariants and state equation in 6314 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-16 13:54:39] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2023-03-16 13:54:40] [INFO ] Computed 182 place invariants in 145 ms
[2023-03-16 13:54:40] [INFO ] Implicit Places using invariants in 747 ms returned []
[2023-03-16 13:54:40] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-16 13:54:40] [INFO ] Invariant cache hit.
[2023-03-16 13:54:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 13:54:55] [INFO ] Implicit Places using invariants and state equation in 14650 ms returned []
Implicit Place search using SMT with State Equation took 15400 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1614 places, 2775/3390 transitions.
Applied a total of 0 rules in 36 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21920 ms. Remains : 1604/1614 places, 2775/3390 transitions.
Support contains 1095 out of 1604 places after structural reductions.
[2023-03-16 13:54:55] [INFO ] Flatten gal took : 333 ms
[2023-03-16 13:54:56] [INFO ] Flatten gal took : 181 ms
[2023-03-16 13:54:56] [INFO ] Input system was already deterministic with 2775 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 2774 ms. (steps per millisecond=3 ) properties (out of 26) seen :5
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 269 ms. (steps per millisecond=3 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 113 ms. (steps per millisecond=8 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-16 13:55:00] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-16 13:55:00] [INFO ] Invariant cache hit.
[2023-03-16 13:55:02] [INFO ] [Real]Absence check using 159 positive place invariants in 38 ms returned sat
[2023-03-16 13:55:02] [INFO ] [Real]Absence check using 159 positive and 23 generalized place invariants in 59 ms returned sat
[2023-03-16 13:55:23] [INFO ] After 20476ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:16
[2023-03-16 13:55:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 13:55:23] [INFO ] After 101ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-16 13:55:23] [INFO ] After 21640ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-16 13:55:24] [INFO ] [Nat]Absence check using 159 positive place invariants in 39 ms returned sat
[2023-03-16 13:55:24] [INFO ] [Nat]Absence check using 159 positive and 23 generalized place invariants in 68 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-16 13:55:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 13:55:48] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:17
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 991 out of 1604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 83 Pre rules applied. Total rules applied 0 place count 1604 transition count 2692
Deduced a syphon composed of 83 places in 2 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 0 with 166 rules applied. Total rules applied 166 place count 1521 transition count 2692
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 170 place count 1519 transition count 2690
Applied a total of 170 rules in 384 ms. Remains 1519 /1604 variables (removed 85) and now considering 2690/2775 (removed 85) transitions.
[2023-03-16 13:55:48] [INFO ] Flow matrix only has 2681 transitions (discarded 9 similar events)
// Phase 1: matrix 2681 rows 1519 cols
[2023-03-16 13:55:48] [INFO ] Computed 182 place invariants in 70 ms
[2023-03-16 13:55:51] [INFO ] Dead Transitions using invariants and state equation in 3079 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3466 ms. Remains : 1519/1604 places, 2690/2775 transitions.
Incomplete random walk after 10000 steps, including 687 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 17) seen :6
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-16 13:55:52] [INFO ] Flow matrix only has 2681 transitions (discarded 9 similar events)
[2023-03-16 13:55:52] [INFO ] Invariant cache hit.
[2023-03-16 13:55:53] [INFO ] [Real]Absence check using 160 positive place invariants in 37 ms returned sat
[2023-03-16 13:55:53] [INFO ] [Real]Absence check using 160 positive and 22 generalized place invariants in 60 ms returned sat
[2023-03-16 13:55:55] [INFO ] After 2869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-16 13:55:56] [INFO ] [Nat]Absence check using 160 positive place invariants in 38 ms returned sat
[2023-03-16 13:55:56] [INFO ] [Nat]Absence check using 160 positive and 22 generalized place invariants in 58 ms returned sat
[2023-03-16 13:56:20] [INFO ] After 24365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 13:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-16 13:56:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 13:56:20] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 1519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1519/1519 places, 2690/2690 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1519 transition count 2688
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 1517 transition count 2687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1516 transition count 2687
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 6 place count 1516 transition count 2607
Deduced a syphon composed of 80 places in 5 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 166 place count 1436 transition count 2607
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 1435 transition count 2606
Applied a total of 168 rules in 271 ms. Remains 1435 /1519 variables (removed 84) and now considering 2606/2690 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 1435/1519 places, 2606/2690 transitions.
Incomplete random walk after 10000 steps, including 702 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 13:56:21] [INFO ] Flow matrix only has 2597 transitions (discarded 9 similar events)
// Phase 1: matrix 2597 rows 1435 cols
[2023-03-16 13:56:21] [INFO ] Computed 182 place invariants in 87 ms
[2023-03-16 13:56:21] [INFO ] [Real]Absence check using 159 positive place invariants in 38 ms returned sat
[2023-03-16 13:56:21] [INFO ] [Real]Absence check using 159 positive and 23 generalized place invariants in 58 ms returned sat
[2023-03-16 13:56:23] [INFO ] After 2515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 13:56:24] [INFO ] [Nat]Absence check using 159 positive place invariants in 37 ms returned sat
[2023-03-16 13:56:24] [INFO ] [Nat]Absence check using 159 positive and 23 generalized place invariants in 45 ms returned sat
[2023-03-16 13:56:34] [INFO ] After 10788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 13:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 13:56:40] [INFO ] After 5563ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 13:56:40] [INFO ] After 5737ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 402 ms.
[2023-03-16 13:56:41] [INFO ] After 17209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 1435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1435/1435 places, 2606/2606 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1435 transition count 2604
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1433 transition count 2604
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 1433 transition count 2601
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 10 place count 1430 transition count 2601
Applied a total of 10 rules in 134 ms. Remains 1430 /1435 variables (removed 5) and now considering 2601/2606 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 1430/1435 places, 2601/2606 transitions.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
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' '!((F(X(X(!p0))) U X(p1)))'
Support contains 982 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 56 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 13:56:41] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-16 13:56:41] [INFO ] Computed 182 place invariants in 63 ms
[2023-03-16 13:56:46] [INFO ] Dead Transitions using invariants and state equation in 4873 ms found 0 transitions.
[2023-03-16 13:56:46] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:56:46] [INFO ] Invariant cache hit.
[2023-03-16 13:56:47] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-16 13:56:47] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:56:47] [INFO ] Invariant cache hit.
[2023-03-16 13:56:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 13:57:19] [INFO ] Performed 1224/1603 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 13:57:23] [INFO ] Implicit Places using invariants and state equation in 35566 ms returned []
Implicit Place search using SMT with State Equation took 36450 ms to find 0 implicit places.
[2023-03-16 13:57:23] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:57:23] [INFO ] Invariant cache hit.
[2023-03-16 13:57:27] [INFO ] Dead Transitions using invariants and state equation in 4839 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46224 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s595 1) (GEQ s1385 1)) (AND (GEQ s171 1) (GEQ s1092 1)) (AND (GEQ s230 1) (GEQ s394 1)) (AND (GEQ s230 1) (GEQ s1558 1)) (AND (GEQ s156 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 19 ms.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-02 finished in 46644 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 1 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 163 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 13:57:28] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:57:28] [INFO ] Invariant cache hit.
[2023-03-16 13:57:33] [INFO ] Dead Transitions using invariants and state equation in 5196 ms found 0 transitions.
[2023-03-16 13:57:33] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:57:33] [INFO ] Invariant cache hit.
[2023-03-16 13:57:37] [INFO ] Implicit Places using invariants in 3615 ms returned []
[2023-03-16 13:57:37] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:57:37] [INFO ] Invariant cache hit.
[2023-03-16 13:57:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 13:58:08] [INFO ] Performed 193/1603 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 13:58:39] [INFO ] Performed 406/1603 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 13:59:09] [INFO ] Performed 662/1603 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-16 13:59:39] [INFO ] Performed 942/1603 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2023-03-16 13:59:39] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2023-03-16 13:59:39] [INFO ] Implicit Places using invariants and state equation in 121881 ms returned []
Implicit Place search using SMT with State Equation took 125500 ms to find 0 implicit places.
[2023-03-16 13:59:39] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:59:39] [INFO ] Invariant cache hit.
[2023-03-16 13:59:44] [INFO ] Dead Transitions using invariants and state equation in 5125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135988 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s479 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1579 ms.
Product exploration explored 100000 steps with 50000 reset in 1507 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J80-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-03 finished in 139321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(G(p1))))))'
Support contains 4 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 142 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 13:59:47] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:59:47] [INFO ] Invariant cache hit.
[2023-03-16 13:59:52] [INFO ] Dead Transitions using invariants and state equation in 4915 ms found 0 transitions.
[2023-03-16 13:59:52] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:59:52] [INFO ] Invariant cache hit.
[2023-03-16 13:59:56] [INFO ] Implicit Places using invariants in 3393 ms returned []
[2023-03-16 13:59:56] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 13:59:56] [INFO ] Invariant cache hit.
[2023-03-16 13:59:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 14:00:27] [INFO ] Performed 172/1603 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 14:00:57] [INFO ] Performed 470/1603 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 14:01:28] [INFO ] Performed 713/1603 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-16 14:01:58] [INFO ] Performed 970/1603 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2023-03-16 14:01:58] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2023-03-16 14:01:58] [INFO ] Implicit Places using invariants and state equation in 122349 ms returned []
Implicit Place search using SMT with State Equation took 125744 ms to find 0 implicit places.
[2023-03-16 14:01:58] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:01:58] [INFO ] Invariant cache hit.
[2023-03-16 14:02:03] [INFO ] Dead Transitions using invariants and state equation in 4892 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135718 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s844 1) (GEQ s1110 1)), p1:(AND (GEQ s55 1) (GEQ s1122 10))], 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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-04 finished in 135989 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&&(G(p2)||p1)))))'
Support contains 84 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
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 1604 transition count 2691
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 169 place count 1520 transition count 2690
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 1519 transition count 2690
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 170 place count 1519 transition count 2606
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 338 place count 1435 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 339 place count 1434 transition count 2605
Iterating global reduction 3 with 1 rules applied. Total rules applied 340 place count 1434 transition count 2605
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 3 with 4 rules applied. Total rules applied 344 place count 1432 transition count 2603
Applied a total of 344 rules in 651 ms. Remains 1432 /1604 variables (removed 172) and now considering 2603/2775 (removed 172) transitions.
[2023-03-16 14:02:04] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2023-03-16 14:02:04] [INFO ] Computed 182 place invariants in 100 ms
[2023-03-16 14:02:06] [INFO ] Dead Transitions using invariants and state equation in 2705 ms found 0 transitions.
[2023-03-16 14:02:06] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-16 14:02:06] [INFO ] Invariant cache hit.
[2023-03-16 14:02:09] [INFO ] Implicit Places using invariants in 2706 ms returned []
[2023-03-16 14:02:09] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-16 14:02:09] [INFO ] Invariant cache hit.
[2023-03-16 14:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 14:02:40] [INFO ] Performed 372/1432 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 14:03:10] [INFO ] Performed 848/1432 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 14:03:41] [INFO ] Performed 1212/1432 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-16 14:03:55] [INFO ] Implicit Places using invariants and state equation in 105809 ms returned []
Implicit Place search using SMT with State Equation took 108529 ms to find 0 implicit places.
[2023-03-16 14:03:55] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-16 14:03:55] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-16 14:03:55] [INFO ] Invariant cache hit.
[2023-03-16 14:03:58] [INFO ] Dead Transitions using invariants and state equation in 2552 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1432/1604 places, 2603/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114643 ms. Remains : 1432/1604 places, 2603/2775 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s412 1) (GEQ s802 1) (GEQ s1327 1)) (AND (GEQ s458 1) (GEQ s802 1) (GEQ s1327 1)) (AND (GEQ s485 1) (GEQ s802 1) (GEQ s1327 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-06 finished in 114756 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||(p1 U (p2||G(p1)))))))'
Support contains 85 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Applied a total of 0 rules in 83 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
[2023-03-16 14:03:58] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2023-03-16 14:03:58] [INFO ] Computed 182 place invariants in 53 ms
[2023-03-16 14:04:03] [INFO ] Dead Transitions using invariants and state equation in 5020 ms found 0 transitions.
[2023-03-16 14:04:03] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-16 14:04:03] [INFO ] Invariant cache hit.
[2023-03-16 14:04:06] [INFO ] Implicit Places using invariants in 3123 ms returned []
[2023-03-16 14:04:06] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-16 14:04:06] [INFO ] Invariant cache hit.
[2023-03-16 14:04:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 14:04:37] [INFO ] Performed 297/1604 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 14:05:07] [INFO ] Performed 598/1604 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 14:05:38] [INFO ] Performed 1004/1604 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-16 14:06:08] [INFO ] Performed 1398/1604 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2023-03-16 14:06:08] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2023-03-16 14:06:08] [INFO ] Implicit Places using invariants and state equation in 122339 ms returned []
Implicit Place search using SMT with State Equation took 125476 ms to find 0 implicit places.
[2023-03-16 14:06:08] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-16 14:06:08] [INFO ] Invariant cache hit.
[2023-03-16 14:06:13] [INFO ] Dead Transitions using invariants and state equation in 4861 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135470 ms. Remains : 1604/1604 places, 2775/2775 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1154 1), p2:(AND (NOT (OR (AND (GEQ s457 1) (GEQ s891 1) (GEQ s1484 1)) (AND (GEQ s512 1) (GEQ s891 1) (GEQ s1484 1)) (AND (GEQ s542 1) (GEQ s891...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1381 ms.
Product exploration explored 100000 steps with 50000 reset in 1445 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) p2 p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 p1)
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J80-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-07 finished in 138700 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 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
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 1604 transition count 2689
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1518 transition count 2689
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 1518 transition count 2604
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 342 place count 1433 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 343 place count 1432 transition count 2603
Iterating global reduction 2 with 1 rules applied. Total rules applied 344 place count 1432 transition count 2603
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 2 with 4 rules applied. Total rules applied 348 place count 1430 transition count 2601
Applied a total of 348 rules in 336 ms. Remains 1430 /1604 variables (removed 174) and now considering 2601/2775 (removed 174) transitions.
[2023-03-16 14:06:17] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-16 14:06:17] [INFO ] Computed 182 place invariants in 51 ms
[2023-03-16 14:06:19] [INFO ] Dead Transitions using invariants and state equation in 2579 ms found 0 transitions.
[2023-03-16 14:06:19] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-16 14:06:19] [INFO ] Invariant cache hit.
[2023-03-16 14:06:22] [INFO ] Implicit Places using invariants in 2799 ms returned []
[2023-03-16 14:06:22] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-16 14:06:22] [INFO ] Invariant cache hit.
[2023-03-16 14:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 14:06:53] [INFO ] Performed 408/1430 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 14:07:23] [INFO ] Performed 824/1430 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 14:07:53] [INFO ] Performed 1202/1430 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-16 14:08:11] [INFO ] Implicit Places using invariants and state equation in 108899 ms returned []
Implicit Place search using SMT with State Equation took 111710 ms to find 0 implicit places.
[2023-03-16 14:08:11] [INFO ] Redundant transitions in 152 ms returned []
[2023-03-16 14:08:11] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-16 14:08:11] [INFO ] Invariant cache hit.
[2023-03-16 14:08:14] [INFO ] Dead Transitions using invariants and state equation in 2504 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1430/1604 places, 2601/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117317 ms. Remains : 1430/1604 places, 2601/2775 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-08 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:(AND (GEQ s224 1) (GEQ s1002 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 11 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-08 finished in 117437 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' '!((false U ((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(!p0)&&(!p0 U (p1||G(!p0))))))))'
Support contains 3 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 158 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 14:08:14] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-16 14:08:14] [INFO ] Computed 182 place invariants in 64 ms
[2023-03-16 14:08:19] [INFO ] Dead Transitions using invariants and state equation in 5055 ms found 0 transitions.
[2023-03-16 14:08:19] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:08:19] [INFO ] Invariant cache hit.
[2023-03-16 14:08:23] [INFO ] Implicit Places using invariants in 3503 ms returned []
[2023-03-16 14:08:23] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:08:23] [INFO ] Invariant cache hit.
[2023-03-16 14:08:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 14:08:55] [INFO ] Performed 209/1603 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 14:09:25] [INFO ] Performed 389/1603 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 14:09:55] [INFO ] Performed 646/1603 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-16 14:10:25] [INFO ] Performed 878/1603 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2023-03-16 14:10:25] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2023-03-16 14:10:25] [INFO ] Implicit Places using invariants and state equation in 122456 ms returned []
Implicit Place search using SMT with State Equation took 125963 ms to find 0 implicit places.
[2023-03-16 14:10:25] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:10:25] [INFO ] Invariant cache hit.
[2023-03-16 14:10:30] [INFO ] Dead Transitions using invariants and state equation in 4803 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135990 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s130 1) (GEQ s844 1)), p1:(AND (NOT (AND (GEQ s130 1) (GEQ s844 1))) (NOT (AND (GEQ s130 1) (GEQ s844 1) (GEQ s530 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1504 ms.
Product exploration explored 100000 steps with 50000 reset in 1539 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 8 factoid took 238 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J80-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-09 finished in 139458 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 U p1) U p2)&&G((p3 U p4))))))'
Support contains 7 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 163 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 14:10:34] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:10:34] [INFO ] Invariant cache hit.
[2023-03-16 14:10:39] [INFO ] Dead Transitions using invariants and state equation in 4924 ms found 0 transitions.
[2023-03-16 14:10:39] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:10:39] [INFO ] Invariant cache hit.
[2023-03-16 14:10:42] [INFO ] Implicit Places using invariants in 3729 ms returned []
[2023-03-16 14:10:42] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:10:42] [INFO ] Invariant cache hit.
[2023-03-16 14:10:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 14:11:14] [INFO ] Performed 155/1603 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 14:11:44] [INFO ] Performed 404/1603 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 14:12:14] [INFO ] Performed 666/1603 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-16 14:12:44] [INFO ] Performed 942/1603 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2023-03-16 14:12:44] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2023-03-16 14:12:44] [INFO ] Implicit Places using invariants and state equation in 122073 ms returned []
Implicit Place search using SMT with State Equation took 125818 ms to find 0 implicit places.
[2023-03-16 14:12:44] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:12:44] [INFO ] Invariant cache hit.
[2023-03-16 14:12:49] [INFO ] Dead Transitions using invariants and state equation in 4801 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135719 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 578 ms :[(OR (NOT p4) (NOT p2)), (OR (NOT p4) (NOT p2)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p4), (NOT p4), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) p0 p4) (AND (NOT p2) (NOT p1) p0 p3)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p1 p4) (AND (NOT p2) p1 p3) (AND (NOT p2) p0 p4) (AND (NOT p2) p0 p3)), acceptance={0} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p4) p3) (AND p1 (NOT p4) p3) (AND p0 (NOT p4) p3)), acceptance={0} source=1 dest: 4}, { cond=(OR (AND p2 p4) (AND p2 p3) (AND p1 p4) (AND p1 p3) (AND p0 p4) (AND p0 p3)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p1) p0 (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p4) p3), acceptance={0} source=2 dest: 4}, { cond=(OR (AND p2 (NOT p1) (NOT p0) p4) (AND p2 (NOT p1) (NOT p0) p3)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1) p0 (NOT p4) p3), acceptance={0} source=2 dest: 6}, { cond=(OR (AND p2 (NOT p1) p0 p4) (AND p2 (NOT p1) p0 p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 4}, { cond=(OR p4 p3), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={0} source=7 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={0} source=7 dest: 6}, { cond=(OR (AND (NOT p1) p0 p4) (AND (NOT p1) p0 p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s278 2), p1:(AND (GEQ s564 1) (GEQ s1061 1) (GEQ s1140 1)), p0:(AND (GEQ s423 1) (GEQ s1140 1) (GEQ s1147 1)), p4:(OR (NOT (AND (GEQ s564 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-10 finished in 136338 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((G(p0)||G(p1)||(p1&&F(!p2)))))'
Support contains 4 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
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 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 171 place count 1519 transition count 2689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 172 place count 1518 transition count 2606
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 338 place count 1435 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 339 place count 1434 transition count 2605
Iterating global reduction 3 with 1 rules applied. Total rules applied 340 place count 1434 transition count 2605
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 344 place count 1432 transition count 2603
Applied a total of 344 rules in 321 ms. Remains 1432 /1604 variables (removed 172) and now considering 2603/2775 (removed 172) transitions.
[2023-03-16 14:12:50] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2023-03-16 14:12:50] [INFO ] Computed 182 place invariants in 76 ms
[2023-03-16 14:12:53] [INFO ] Dead Transitions using invariants and state equation in 2954 ms found 0 transitions.
[2023-03-16 14:12:53] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-16 14:12:53] [INFO ] Invariant cache hit.
[2023-03-16 14:12:56] [INFO ] Implicit Places using invariants in 2921 ms returned []
[2023-03-16 14:12:56] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-16 14:12:56] [INFO ] Invariant cache hit.
[2023-03-16 14:12:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 14:13:27] [INFO ] Performed 314/1432 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 14:13:57] [INFO ] Performed 785/1432 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 14:14:28] [INFO ] Performed 1211/1432 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-16 14:14:42] [INFO ] Implicit Places using invariants and state equation in 106502 ms returned []
Implicit Place search using SMT with State Equation took 109433 ms to find 0 implicit places.
[2023-03-16 14:14:43] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-16 14:14:43] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-16 14:14:43] [INFO ] Invariant cache hit.
[2023-03-16 14:14:46] [INFO ] Dead Transitions using invariants and state equation in 2984 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1432/1604 places, 2603/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115819 ms. Remains : 1432/1604 places, 2603/2775 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p0) p2), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p1) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s557 1) (GEQ s760 1)), p2:(GEQ s245 2), p1:(LT s1242 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-13 finished in 116026 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)||G(p1))))'
Support contains 3 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 160 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 14:14:46] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-16 14:14:46] [INFO ] Computed 182 place invariants in 61 ms
[2023-03-16 14:14:51] [INFO ] Dead Transitions using invariants and state equation in 4818 ms found 0 transitions.
[2023-03-16 14:14:51] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:14:51] [INFO ] Invariant cache hit.
[2023-03-16 14:14:54] [INFO ] Implicit Places using invariants in 3452 ms returned []
[2023-03-16 14:14:54] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:14:54] [INFO ] Invariant cache hit.
[2023-03-16 14:14:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 14:15:26] [INFO ] Performed 187/1603 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 14:15:56] [INFO ] Performed 424/1603 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 14:16:26] [INFO ] Performed 708/1603 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-16 14:16:56] [INFO ] Performed 985/1603 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2023-03-16 14:16:56] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2023-03-16 14:16:56] [INFO ] Implicit Places using invariants and state equation in 122154 ms returned []
Implicit Place search using SMT with State Equation took 125618 ms to find 0 implicit places.
[2023-03-16 14:16:56] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 14:16:56] [INFO ] Invariant cache hit.
[2023-03-16 14:17:01] [INFO ] Dead Transitions using invariants and state equation in 4958 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135583 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J80-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s654 1), p0:(AND (LT s911 1) (LT s536 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J80-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J80-LTLFireability-15 finished in 135785 ms.
All properties solved by simple procedures.
Total runtime 1350374 ms.

BK_STOP 1678976223866

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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