About the Execution of LTSMin+red for ShieldPPPt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1037.779 | 128908.00 | 204002.00 | 123.80 | FFFTFFFFTTFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717300651.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300651
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 569K 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 ShieldPPPt-PT-030B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-030B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679466747840
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:32:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:32:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:32:31] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-22 06:32:31] [INFO ] Transformed 2343 places.
[2023-03-22 06:32:31] [INFO ] Transformed 2133 transitions.
[2023-03-22 06:32:31] [INFO ] Found NUPN structural information;
[2023-03-22 06:32:32] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 323 places :
Symmetric choice reduction at 0 with 323 rule applications. Total rules 323 place count 2020 transition count 1810
Iterating global reduction 0 with 323 rules applied. Total rules applied 646 place count 2020 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 2019 transition count 1809
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 2019 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 649 place count 2018 transition count 1808
Iterating global reduction 0 with 1 rules applied. Total rules applied 650 place count 2018 transition count 1808
Applied a total of 650 rules in 949 ms. Remains 2018 /2343 variables (removed 325) and now considering 1808/2133 (removed 325) transitions.
// Phase 1: matrix 1808 rows 2018 cols
[2023-03-22 06:32:33] [INFO ] Computed 331 place invariants in 46 ms
[2023-03-22 06:32:35] [INFO ] Implicit Places using invariants in 2404 ms returned []
[2023-03-22 06:32:35] [INFO ] Invariant cache hit.
[2023-03-22 06:32:39] [INFO ] Implicit Places using invariants and state equation in 3630 ms returned []
Implicit Place search using SMT with State Equation took 6135 ms to find 0 implicit places.
[2023-03-22 06:32:39] [INFO ] Invariant cache hit.
[2023-03-22 06:32:41] [INFO ] Dead Transitions using invariants and state equation in 1956 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2018/2343 places, 1808/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9043 ms. Remains : 2018/2343 places, 1808/2133 transitions.
Support contains 23 out of 2018 places after structural reductions.
[2023-03-22 06:32:42] [INFO ] Flatten gal took : 257 ms
[2023-03-22 06:32:42] [INFO ] Flatten gal took : 91 ms
[2023-03-22 06:32:42] [INFO ] Input system was already deterministic with 1808 transitions.
Support contains 22 out of 2018 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 06:32:43] [INFO ] Invariant cache hit.
[2023-03-22 06:32:44] [INFO ] [Real]Absence check using 331 positive place invariants in 269 ms returned sat
[2023-03-22 06:32:44] [INFO ] After 1142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 06:32:45] [INFO ] [Nat]Absence check using 331 positive place invariants in 239 ms returned sat
[2023-03-22 06:32:47] [INFO ] After 2019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 06:32:49] [INFO ] Deduced a trap composed of 22 places in 949 ms of which 6 ms to minimize.
[2023-03-22 06:32:50] [INFO ] Deduced a trap composed of 18 places in 1735 ms of which 8 ms to minimize.
[2023-03-22 06:32:51] [INFO ] Deduced a trap composed of 23 places in 670 ms of which 16 ms to minimize.
[2023-03-22 06:32:52] [INFO ] Deduced a trap composed of 17 places in 512 ms of which 1 ms to minimize.
[2023-03-22 06:32:53] [INFO ] Deduced a trap composed of 21 places in 750 ms of which 2 ms to minimize.
[2023-03-22 06:32:53] [INFO ] Deduced a trap composed of 16 places in 795 ms of which 2 ms to minimize.
[2023-03-22 06:32:54] [INFO ] Deduced a trap composed of 18 places in 544 ms of which 14 ms to minimize.
[2023-03-22 06:32:55] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 1 ms to minimize.
[2023-03-22 06:32:55] [INFO ] Deduced a trap composed of 26 places in 495 ms of which 6 ms to minimize.
[2023-03-22 06:32:56] [INFO ] Deduced a trap composed of 27 places in 711 ms of which 2 ms to minimize.
[2023-03-22 06:32:57] [INFO ] Deduced a trap composed of 20 places in 536 ms of which 1 ms to minimize.
[2023-03-22 06:32:57] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 1 ms to minimize.
[2023-03-22 06:32:57] [INFO ] Deduced a trap composed of 29 places in 409 ms of which 1 ms to minimize.
[2023-03-22 06:32:58] [INFO ] Deduced a trap composed of 26 places in 415 ms of which 2 ms to minimize.
[2023-03-22 06:32:59] [INFO ] Deduced a trap composed of 34 places in 875 ms of which 4 ms to minimize.
[2023-03-22 06:33:00] [INFO ] Deduced a trap composed of 35 places in 496 ms of which 1 ms to minimize.
[2023-03-22 06:33:00] [INFO ] Deduced a trap composed of 32 places in 396 ms of which 1 ms to minimize.
[2023-03-22 06:33:00] [INFO ] Deduced a trap composed of 32 places in 349 ms of which 1 ms to minimize.
[2023-03-22 06:33:01] [INFO ] Deduced a trap composed of 36 places in 389 ms of which 1 ms to minimize.
[2023-03-22 06:33:01] [INFO ] Deduced a trap composed of 31 places in 466 ms of which 1 ms to minimize.
[2023-03-22 06:33:02] [INFO ] Deduced a trap composed of 32 places in 479 ms of which 1 ms to minimize.
[2023-03-22 06:33:03] [INFO ] Deduced a trap composed of 36 places in 488 ms of which 32 ms to minimize.
[2023-03-22 06:33:03] [INFO ] Deduced a trap composed of 25 places in 578 ms of which 1 ms to minimize.
[2023-03-22 06:33:04] [INFO ] Deduced a trap composed of 27 places in 637 ms of which 1 ms to minimize.
[2023-03-22 06:33:09] [INFO ] Deduced a trap composed of 29 places in 5073 ms of which 2 ms to minimize.
[2023-03-22 06:33:10] [INFO ] Deduced a trap composed of 22 places in 846 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 06:33:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 06:33:10] [INFO ] After 25835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 618 ms.
Support contains 11 out of 2018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 2018 transition count 1392
Reduce places removed 416 places and 0 transitions.
Iterating post reduction 1 with 416 rules applied. Total rules applied 832 place count 1602 transition count 1392
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 832 place count 1602 transition count 1155
Deduced a syphon composed of 237 places in 2 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1306 place count 1365 transition count 1155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1308 place count 1363 transition count 1153
Iterating global reduction 2 with 2 rules applied. Total rules applied 1310 place count 1363 transition count 1153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1310 place count 1363 transition count 1152
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1312 place count 1362 transition count 1152
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 2 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 2 with 1010 rules applied. Total rules applied 2322 place count 857 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2323 place count 857 transition count 646
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2325 place count 856 transition count 645
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2503 place count 767 transition count 645
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2504 place count 767 transition count 644
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2505 place count 766 transition count 644
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2593 place count 766 transition count 644
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2594 place count 765 transition count 643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2595 place count 764 transition count 643
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2595 place count 764 transition count 641
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2599 place count 762 transition count 641
Applied a total of 2599 rules in 718 ms. Remains 762 /2018 variables (removed 1256) and now considering 641/1808 (removed 1167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 762/2018 places, 641/1808 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 641 rows 762 cols
[2023-03-22 06:33:12] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:33:12] [INFO ] [Real]Absence check using 330 positive place invariants in 80 ms returned sat
[2023-03-22 06:33:13] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 06:33:13] [INFO ] [Nat]Absence check using 330 positive place invariants in 78 ms returned sat
[2023-03-22 06:33:14] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 06:33:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 06:33:14] [INFO ] After 266ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 06:33:15] [INFO ] After 797ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-22 06:33:15] [INFO ] After 2195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 130 ms.
Support contains 9 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 641/641 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 760 transition count 639
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 759 transition count 638
Applied a total of 5 rules in 100 ms. Remains 759 /762 variables (removed 3) and now considering 638/641 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 759/762 places, 638/641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 89423 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{0=1}
Probabilistic random walk after 89423 steps, saw 75204 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 638 rows 759 cols
[2023-03-22 06:33:19] [INFO ] Computed 330 place invariants in 4 ms
[2023-03-22 06:33:19] [INFO ] [Real]Absence check using 330 positive place invariants in 61 ms returned sat
[2023-03-22 06:33:19] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 06:33:19] [INFO ] [Nat]Absence check using 330 positive place invariants in 88 ms returned sat
[2023-03-22 06:33:20] [INFO ] After 716ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 06:33:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-22 06:33:20] [INFO ] After 329ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 06:33:21] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-22 06:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-22 06:33:21] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 0 ms to minimize.
[2023-03-22 06:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-22 06:33:21] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2023-03-22 06:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-22 06:33:21] [INFO ] After 1290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-03-22 06:33:22] [INFO ] After 2796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 7 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 638/638 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 757 transition count 636
Applied a total of 4 rules in 61 ms. Remains 757 /759 variables (removed 2) and now considering 636/638 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 757/759 places, 636/638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 99957 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99957 steps, saw 84031 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 636 rows 757 cols
[2023-03-22 06:33:25] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:33:26] [INFO ] [Real]Absence check using 330 positive place invariants in 53 ms returned sat
[2023-03-22 06:33:26] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 06:33:26] [INFO ] [Nat]Absence check using 330 positive place invariants in 77 ms returned sat
[2023-03-22 06:33:27] [INFO ] After 831ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 06:33:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-22 06:33:27] [INFO ] After 249ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 06:33:27] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2023-03-22 06:33:28] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-22 06:33:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2023-03-22 06:33:28] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 19 ms to minimize.
[2023-03-22 06:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-22 06:33:28] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 1 ms to minimize.
[2023-03-22 06:33:29] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 0 ms to minimize.
[2023-03-22 06:33:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 576 ms
[2023-03-22 06:33:29] [INFO ] After 1883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-22 06:33:29] [INFO ] After 3416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 7 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 636/636 transitions.
Applied a total of 0 rules in 16 ms. Remains 757 /757 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 757/757 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 636/636 transitions.
Applied a total of 0 rules in 17 ms. Remains 757 /757 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-03-22 06:33:29] [INFO ] Invariant cache hit.
[2023-03-22 06:33:30] [INFO ] Implicit Places using invariants in 921 ms returned [740, 744]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 923 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 755/757 places, 636/636 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 753 transition count 634
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 753 transition count 634
Applied a total of 4 rules in 41 ms. Remains 753 /755 variables (removed 2) and now considering 634/636 (removed 2) transitions.
// Phase 1: matrix 634 rows 753 cols
[2023-03-22 06:33:30] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-22 06:33:31] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-03-22 06:33:31] [INFO ] Invariant cache hit.
[2023-03-22 06:33:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 06:33:34] [INFO ] Implicit Places using invariants and state equation in 2891 ms returned []
Implicit Place search using SMT with State Equation took 3574 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 753/757 places, 634/636 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4555 ms. Remains : 753/757 places, 634/636 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 89985 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89985 steps, saw 74380 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 06:33:37] [INFO ] Invariant cache hit.
[2023-03-22 06:33:38] [INFO ] [Real]Absence check using 328 positive place invariants in 52 ms returned sat
[2023-03-22 06:33:38] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 06:33:38] [INFO ] [Nat]Absence check using 328 positive place invariants in 119 ms returned sat
[2023-03-22 06:33:39] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 06:33:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 06:33:39] [INFO ] After 242ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 06:33:40] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 1 ms to minimize.
[2023-03-22 06:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2023-03-22 06:33:40] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2023-03-22 06:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-22 06:33:40] [INFO ] After 1044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-22 06:33:40] [INFO ] After 2548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 7 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 634/634 transitions.
Applied a total of 0 rules in 14 ms. Remains 753 /753 variables (removed 0) and now considering 634/634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 753/753 places, 634/634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 634/634 transitions.
Applied a total of 0 rules in 24 ms. Remains 753 /753 variables (removed 0) and now considering 634/634 (removed 0) transitions.
[2023-03-22 06:33:40] [INFO ] Invariant cache hit.
[2023-03-22 06:33:41] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-22 06:33:41] [INFO ] Invariant cache hit.
[2023-03-22 06:33:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 06:33:42] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
[2023-03-22 06:33:42] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-22 06:33:42] [INFO ] Invariant cache hit.
[2023-03-22 06:33:43] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2734 ms. Remains : 753/753 places, 634/634 transitions.
Partial Free-agglomeration rule applied 178 times.
Drop transitions removed 178 transitions
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 753 transition count 634
Applied a total of 178 rules in 51 ms. Remains 753 /753 variables (removed 0) and now considering 634/634 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 634 rows 753 cols
[2023-03-22 06:33:43] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 06:33:43] [INFO ] [Real]Absence check using 328 positive place invariants in 46 ms returned sat
[2023-03-22 06:33:43] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 06:33:44] [INFO ] [Nat]Absence check using 328 positive place invariants in 63 ms returned sat
[2023-03-22 06:33:45] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 06:33:45] [INFO ] State equation strengthened by 173 read => feed constraints.
[2023-03-22 06:33:45] [INFO ] After 330ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 06:33:45] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2023-03-22 06:33:46] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 0 ms to minimize.
[2023-03-22 06:33:46] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 1 ms to minimize.
[2023-03-22 06:33:46] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 0 ms to minimize.
[2023-03-22 06:33:46] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2023-03-22 06:33:47] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 0 ms to minimize.
[2023-03-22 06:33:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1709 ms
[2023-03-22 06:33:47] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-22 06:33:48] [INFO ] Deduced a trap composed of 5 places in 513 ms of which 1 ms to minimize.
[2023-03-22 06:33:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 942 ms
[2023-03-22 06:33:48] [INFO ] After 3340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-22 06:33:48] [INFO ] After 4728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 478 stabilizing places and 478 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(G(p1)&&X(p0))))'
Support contains 3 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2012 transition count 1802
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2012 transition count 1802
Applied a total of 12 rules in 278 ms. Remains 2012 /2018 variables (removed 6) and now considering 1802/1808 (removed 6) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-22 06:33:49] [INFO ] Computed 331 place invariants in 14 ms
[2023-03-22 06:33:50] [INFO ] Implicit Places using invariants in 1414 ms returned []
[2023-03-22 06:33:50] [INFO ] Invariant cache hit.
[2023-03-22 06:33:53] [INFO ] Implicit Places using invariants and state equation in 2638 ms returned []
Implicit Place search using SMT with State Equation took 4081 ms to find 0 implicit places.
[2023-03-22 06:33:53] [INFO ] Invariant cache hit.
[2023-03-22 06:33:55] [INFO ] Dead Transitions using invariants and state equation in 1659 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2018 places, 1802/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6035 ms. Remains : 2012/2018 places, 1802/1808 transitions.
Stuttering acceptance computed with spot in 620 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}]], initial=1, aps=[p1:(EQ s1532 1), p0:(AND (EQ s1829 0) (EQ s1007 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-01 finished in 6780 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(G(p0)))'
Support contains 2 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2011 transition count 1801
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2011 transition count 1801
Applied a total of 14 rules in 295 ms. Remains 2011 /2018 variables (removed 7) and now considering 1801/1808 (removed 7) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2023-03-22 06:33:56] [INFO ] Computed 331 place invariants in 8 ms
[2023-03-22 06:33:57] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2023-03-22 06:33:57] [INFO ] Invariant cache hit.
[2023-03-22 06:34:00] [INFO ] Implicit Places using invariants and state equation in 3165 ms returned []
Implicit Place search using SMT with State Equation took 4247 ms to find 0 implicit places.
[2023-03-22 06:34:00] [INFO ] Invariant cache hit.
[2023-03-22 06:34:02] [INFO ] Dead Transitions using invariants and state equation in 2069 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2018 places, 1801/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6625 ms. Remains : 2011/2018 places, 1801/1808 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1828 0) (EQ s1306 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 789 steps with 0 reset in 11 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-04 finished in 6792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G((F(p1)&&(!p2 U (p3||G(!p2)))))))))'
Support contains 5 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2012 transition count 1802
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2012 transition count 1802
Applied a total of 12 rules in 203 ms. Remains 2012 /2018 variables (removed 6) and now considering 1802/1808 (removed 6) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-22 06:34:02] [INFO ] Computed 331 place invariants in 14 ms
[2023-03-22 06:34:04] [INFO ] Implicit Places using invariants in 2225 ms returned []
[2023-03-22 06:34:04] [INFO ] Invariant cache hit.
[2023-03-22 06:34:08] [INFO ] Implicit Places using invariants and state equation in 3803 ms returned []
Implicit Place search using SMT with State Equation took 6069 ms to find 0 implicit places.
[2023-03-22 06:34:08] [INFO ] Invariant cache hit.
[2023-03-22 06:34:10] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2018 places, 1802/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7878 ms. Remains : 2012/2018 places, 1802/1808 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), (NOT p0), (OR (NOT p1) (AND p2 (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3))), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s718 1)), p3:(AND (NEQ s803 1) (NOT (OR (EQ s735 0) (EQ s1230 1)))), p2:(OR (EQ s735 0) (EQ s1230 1)), p1:(AND (EQ s1230 0) (EQ s735 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-07 finished in 8304 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((G((p1 U p2))||p0))))'
Support contains 5 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2014 transition count 1804
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2014 transition count 1804
Applied a total of 8 rules in 274 ms. Remains 2014 /2018 variables (removed 4) and now considering 1804/1808 (removed 4) transitions.
// Phase 1: matrix 1804 rows 2014 cols
[2023-03-22 06:34:11] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-22 06:34:12] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2023-03-22 06:34:12] [INFO ] Invariant cache hit.
[2023-03-22 06:34:14] [INFO ] Implicit Places using invariants and state equation in 2388 ms returned []
Implicit Place search using SMT with State Equation took 3470 ms to find 0 implicit places.
[2023-03-22 06:34:14] [INFO ] Invariant cache hit.
[2023-03-22 06:34:16] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2014/2018 places, 1804/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5270 ms. Remains : 2014/2018 places, 1804/1808 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s1990 0) (EQ s1520 1)), p2:(OR (EQ s809 0) (EQ s168 1)), p1:(EQ s1970 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1194 ms.
Product exploration explored 100000 steps with 50000 reset in 994 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 (NOT p1))
Knowledge based reduction with 7 factoid took 375 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-08 finished in 8133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 2 out of 2018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2017 transition count 1387
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1597 transition count 1387
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 840 place count 1597 transition count 1150
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1314 place count 1360 transition count 1150
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1318 place count 1356 transition count 1146
Iterating global reduction 2 with 4 rules applied. Total rules applied 1322 place count 1356 transition count 1146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1322 place count 1356 transition count 1143
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 1328 place count 1353 transition count 1143
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2344 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2345 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2347 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2525 place count 755 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2527 place count 753 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2528 place count 752 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2528 place count 752 transition count 629
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2532 place count 750 transition count 629
Applied a total of 2532 rules in 401 ms. Remains 750 /2018 variables (removed 1268) and now considering 629/1808 (removed 1179) transitions.
// Phase 1: matrix 629 rows 750 cols
[2023-03-22 06:34:19] [INFO ] Computed 330 place invariants in 19 ms
[2023-03-22 06:34:20] [INFO ] Implicit Places using invariants in 654 ms returned [733, 737]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 669 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 748/2018 places, 629/1808 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 746 transition count 627
Applied a total of 4 rules in 50 ms. Remains 746 /748 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 746 cols
[2023-03-22 06:34:20] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:34:21] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2023-03-22 06:34:21] [INFO ] Invariant cache hit.
[2023-03-22 06:34:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:34:22] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/2018 places, 627/1808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3636 ms. Remains : 746/2018 places, 627/1808 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s433 0) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 632 ms.
Stack based approach found an accepted trace after 9430 steps with 0 reset with depth 9431 and stack size 8945 in 86 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-13 finished in 4484 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))))'
Support contains 2 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2011 transition count 1801
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2011 transition count 1801
Applied a total of 14 rules in 249 ms. Remains 2011 /2018 variables (removed 7) and now considering 1801/1808 (removed 7) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2023-03-22 06:34:23] [INFO ] Computed 331 place invariants in 6 ms
[2023-03-22 06:34:24] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2023-03-22 06:34:24] [INFO ] Invariant cache hit.
[2023-03-22 06:34:28] [INFO ] Implicit Places using invariants and state equation in 4048 ms returned []
Implicit Place search using SMT with State Equation took 5128 ms to find 0 implicit places.
[2023-03-22 06:34:28] [INFO ] Invariant cache hit.
[2023-03-22 06:34:30] [INFO ] Dead Transitions using invariants and state equation in 1570 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2018 places, 1801/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6961 ms. Remains : 2011/2018 places, 1801/1808 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s412 0) (EQ s1459 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 656 ms.
Product exploration explored 100000 steps with 33333 reset in 669 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/2011 stabilizing places and 478/1801 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-14 finished in 8576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p1) U (G(p1)&&F(G(p2))))&&p0)))'
Support contains 4 out of 2018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2017 transition count 1390
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1600 transition count 1390
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 834 place count 1600 transition count 1153
Deduced a syphon composed of 237 places in 2 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1308 place count 1363 transition count 1153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1311 place count 1360 transition count 1150
Iterating global reduction 2 with 3 rules applied. Total rules applied 1314 place count 1360 transition count 1150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1314 place count 1360 transition count 1148
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1318 place count 1358 transition count 1148
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 1 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2338 place count 848 transition count 638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2339 place count 848 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2341 place count 847 transition count 636
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2519 place count 758 transition count 636
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2520 place count 758 transition count 636
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2522 place count 756 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2523 place count 755 transition count 634
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2523 place count 755 transition count 632
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2527 place count 753 transition count 632
Applied a total of 2527 rules in 363 ms. Remains 753 /2018 variables (removed 1265) and now considering 632/1808 (removed 1176) transitions.
// Phase 1: matrix 632 rows 753 cols
[2023-03-22 06:34:32] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-22 06:34:33] [INFO ] Implicit Places using invariants in 712 ms returned [736, 740]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 716 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/2018 places, 632/1808 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 749 transition count 630
Applied a total of 4 rules in 23 ms. Remains 749 /751 variables (removed 2) and now considering 630/632 (removed 2) transitions.
// Phase 1: matrix 630 rows 749 cols
[2023-03-22 06:34:33] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-22 06:34:34] [INFO ] Implicit Places using invariants in 910 ms returned []
[2023-03-22 06:34:34] [INFO ] Invariant cache hit.
[2023-03-22 06:34:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 06:34:35] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2568 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 749/2018 places, 630/1808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3670 ms. Remains : 749/2018 places, 630/1808 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s424 0) (EQ s725 1)), p1:(OR (EQ s210 0) (EQ s655 1)), p2:(OR (EQ s725 0) (EQ s424 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 559 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-15 finished in 4460 ms.
All properties solved by simple procedures.
Total runtime 125029 ms.
ITS solved all properties within timeout
BK_STOP 1679466876748
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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="ShieldPPPt-PT-030B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-030B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717300651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;