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.r389-oct2-167903713800652.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 itstools
Input is ShieldPPPt-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800652
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679218737099

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 09:38:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 09:38:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:39:00] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-19 09:39:00] [INFO ] Transformed 2343 places.
[2023-03-19 09:39:00] [INFO ] Transformed 2133 transitions.
[2023-03-19 09:39:00] [INFO ] Found NUPN structural information;
[2023-03-19 09:39:00] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPt-PT-030B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 2022 transition count 1812
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 2022 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 2021 transition count 1811
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 2021 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 645 place count 2020 transition count 1810
Iterating global reduction 0 with 1 rules applied. Total rules applied 646 place count 2020 transition count 1810
Applied a total of 646 rules in 939 ms. Remains 2020 /2343 variables (removed 323) and now considering 1810/2133 (removed 323) transitions.
// Phase 1: matrix 1810 rows 2020 cols
[2023-03-19 09:39:01] [INFO ] Computed 331 place invariants in 28 ms
[2023-03-19 09:39:02] [INFO ] Implicit Places using invariants in 1369 ms returned []
[2023-03-19 09:39:02] [INFO ] Invariant cache hit.
[2023-03-19 09:39:04] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 3195 ms to find 0 implicit places.
[2023-03-19 09:39:04] [INFO ] Invariant cache hit.
[2023-03-19 09:39:06] [INFO ] Dead Transitions using invariants and state equation in 1616 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2020/2343 places, 1810/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5752 ms. Remains : 2020/2343 places, 1810/2133 transitions.
Support contains 29 out of 2020 places after structural reductions.
[2023-03-19 09:39:06] [INFO ] Flatten gal took : 145 ms
[2023-03-19 09:39:06] [INFO ] Flatten gal took : 70 ms
[2023-03-19 09:39:06] [INFO ] Input system was already deterministic with 1810 transitions.
Support contains 28 out of 2020 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 21) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-19 09:39:07] [INFO ] Invariant cache hit.
[2023-03-19 09:39:09] [INFO ] [Real]Absence check using 331 positive place invariants in 490 ms returned sat
[2023-03-19 09:39:09] [INFO ] After 1531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 09:39:10] [INFO ] [Nat]Absence check using 331 positive place invariants in 140 ms returned sat
[2023-03-19 09:39:13] [INFO ] After 2536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-19 09:39:14] [INFO ] Deduced a trap composed of 19 places in 509 ms of which 5 ms to minimize.
[2023-03-19 09:39:14] [INFO ] Deduced a trap composed of 18 places in 528 ms of which 5 ms to minimize.
[2023-03-19 09:39:15] [INFO ] Deduced a trap composed of 32 places in 392 ms of which 1 ms to minimize.
[2023-03-19 09:39:16] [INFO ] Deduced a trap composed of 18 places in 637 ms of which 15 ms to minimize.
[2023-03-19 09:39:17] [INFO ] Deduced a trap composed of 20 places in 938 ms of which 4 ms to minimize.
[2023-03-19 09:39:17] [INFO ] Deduced a trap composed of 17 places in 626 ms of which 1 ms to minimize.
[2023-03-19 09:39:18] [INFO ] Deduced a trap composed of 22 places in 491 ms of which 1 ms to minimize.
[2023-03-19 09:39:19] [INFO ] Deduced a trap composed of 20 places in 526 ms of which 1 ms to minimize.
[2023-03-19 09:39:19] [INFO ] Deduced a trap composed of 16 places in 590 ms of which 3 ms to minimize.
[2023-03-19 09:39:20] [INFO ] Deduced a trap composed of 16 places in 390 ms of which 1 ms to minimize.
[2023-03-19 09:39:20] [INFO ] Deduced a trap composed of 30 places in 348 ms of which 1 ms to minimize.
[2023-03-19 09:39:21] [INFO ] Deduced a trap composed of 25 places in 539 ms of which 1 ms to minimize.
[2023-03-19 09:39:21] [INFO ] Deduced a trap composed of 20 places in 365 ms of which 1 ms to minimize.
[2023-03-19 09:39:22] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 2 ms to minimize.
[2023-03-19 09:39:22] [INFO ] Deduced a trap composed of 29 places in 386 ms of which 1 ms to minimize.
[2023-03-19 09:39:22] [INFO ] Deduced a trap composed of 25 places in 320 ms of which 3 ms to minimize.
[2023-03-19 09:39:23] [INFO ] Deduced a trap composed of 26 places in 485 ms of which 0 ms to minimize.
[2023-03-19 09:39:23] [INFO ] Deduced a trap composed of 24 places in 376 ms of which 1 ms to minimize.
[2023-03-19 09:39:24] [INFO ] Deduced a trap composed of 32 places in 607 ms of which 1 ms to minimize.
[2023-03-19 09:39:25] [INFO ] Deduced a trap composed of 27 places in 317 ms of which 1 ms to minimize.
[2023-03-19 09:39:25] [INFO ] Deduced a trap composed of 36 places in 434 ms of which 1 ms to minimize.
[2023-03-19 09:39:25] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 1 ms to minimize.
[2023-03-19 09:39:26] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 0 ms to minimize.
[2023-03-19 09:39:26] [INFO ] Deduced a trap composed of 30 places in 294 ms of which 1 ms to minimize.
[2023-03-19 09:39:27] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 1 ms to minimize.
[2023-03-19 09:39:27] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 1 ms to minimize.
[2023-03-19 09:39:27] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 0 ms to minimize.
[2023-03-19 09:39:28] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 1 ms to minimize.
[2023-03-19 09:39:28] [INFO ] Deduced a trap composed of 29 places in 388 ms of which 1 ms to minimize.
[2023-03-19 09:39:29] [INFO ] Deduced a trap composed of 34 places in 315 ms of which 1 ms to minimize.
[2023-03-19 09:39:29] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 1 ms to minimize.
[2023-03-19 09:39:29] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 0 ms to minimize.
[2023-03-19 09:39:30] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 1 ms to minimize.
[2023-03-19 09:39:30] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 6 ms to minimize.
[2023-03-19 09:39:30] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 0 ms to minimize.
[2023-03-19 09:39:31] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 1 ms to minimize.
[2023-03-19 09:39:31] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 14 ms to minimize.
[2023-03-19 09:39:31] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 1 ms to minimize.
[2023-03-19 09:39:32] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 0 ms to minimize.
[2023-03-19 09:39:32] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 1 ms to minimize.
[2023-03-19 09:39:33] [INFO ] Deduced a trap composed of 45 places in 370 ms of which 1 ms to minimize.
[2023-03-19 09:39:33] [INFO ] Deduced a trap composed of 42 places in 354 ms of which 26 ms to minimize.
[2023-03-19 09:39:33] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 8 ms to minimize.
[2023-03-19 09:39:34] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 1 ms to minimize.
[2023-03-19 09:39:34] [INFO ] Deduced a trap composed of 35 places in 436 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 09:39:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:39:34] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1130 ms.
Support contains 22 out of 2020 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Drop transitions removed 411 transitions
Trivial Post-agglo rules discarded 411 transitions
Performed 411 trivial Post agglomeration. Transition count delta: 411
Iterating post reduction 0 with 411 rules applied. Total rules applied 411 place count 2020 transition count 1399
Reduce places removed 411 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 412 rules applied. Total rules applied 823 place count 1609 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 824 place count 1608 transition count 1398
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 231 Pre rules applied. Total rules applied 824 place count 1608 transition count 1167
Deduced a syphon composed of 231 places in 3 ms
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 3 with 462 rules applied. Total rules applied 1286 place count 1377 transition count 1167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1288 place count 1375 transition count 1165
Iterating global reduction 3 with 2 rules applied. Total rules applied 1290 place count 1375 transition count 1165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1290 place count 1375 transition count 1164
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1292 place count 1374 transition count 1164
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 2 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 3 with 1020 rules applied. Total rules applied 2312 place count 864 transition count 654
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2313 place count 864 transition count 653
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 4 with 2 rules applied. Total rules applied 2315 place count 863 transition count 652
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 2487 place count 777 transition count 652
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2489 place count 777 transition count 650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2491 place count 775 transition count 650
Partial Free-agglomeration rule applied 84 times.
Drop transitions removed 84 transitions
Iterating global reduction 5 with 84 rules applied. Total rules applied 2575 place count 775 transition count 650
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2576 place count 774 transition count 649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2577 place count 773 transition count 649
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2577 place count 773 transition count 647
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2581 place count 771 transition count 647
Applied a total of 2581 rules in 573 ms. Remains 771 /2020 variables (removed 1249) and now considering 647/1810 (removed 1163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 573 ms. Remains : 771/2020 places, 647/1810 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 647 rows 771 cols
[2023-03-19 09:39:37] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:39:37] [INFO ] [Real]Absence check using 330 positive place invariants in 44 ms returned sat
[2023-03-19 09:39:38] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 09:39:38] [INFO ] [Nat]Absence check using 330 positive place invariants in 125 ms returned sat
[2023-03-19 09:39:39] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 09:39:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 09:39:39] [INFO ] After 504ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 09:39:40] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2023-03-19 09:39:40] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 1 ms to minimize.
[2023-03-19 09:39:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 735 ms
[2023-03-19 09:39:41] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 1 ms to minimize.
[2023-03-19 09:39:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-19 09:39:41] [INFO ] After 2113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 336 ms.
[2023-03-19 09:39:41] [INFO ] After 3684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 137 ms.
Support contains 17 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 647/647 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 771 transition count 644
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 768 transition count 644
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 768 transition count 643
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 767 transition count 643
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 766 transition count 642
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 766 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 765 transition count 641
Applied a total of 12 rules in 62 ms. Remains 765 /771 variables (removed 6) and now considering 641/647 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 765/771 places, 641/647 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) 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 10) 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 10) seen :0
Interrupted probabilistic random walk after 81155 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81155 steps, saw 66650 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 641 rows 765 cols
[2023-03-19 09:39:45] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-19 09:39:46] [INFO ] [Real]Absence check using 330 positive place invariants in 140 ms returned sat
[2023-03-19 09:39:46] [INFO ] After 755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 09:39:47] [INFO ] [Nat]Absence check using 330 positive place invariants in 128 ms returned sat
[2023-03-19 09:39:48] [INFO ] After 923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 09:39:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 09:39:48] [INFO ] After 467ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 09:39:49] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-03-19 09:39:49] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2023-03-19 09:39:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2023-03-19 09:39:49] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2023-03-19 09:39:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-19 09:39:49] [INFO ] After 1483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-19 09:39:50] [INFO ] After 3349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 17 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 641/641 transitions.
Applied a total of 0 rules in 43 ms. Remains 765 /765 variables (removed 0) and now considering 641/641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 765/765 places, 641/641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 641/641 transitions.
Applied a total of 0 rules in 18 ms. Remains 765 /765 variables (removed 0) and now considering 641/641 (removed 0) transitions.
[2023-03-19 09:39:50] [INFO ] Invariant cache hit.
[2023-03-19 09:39:50] [INFO ] Implicit Places using invariants in 468 ms returned [748, 752]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 484 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 763/765 places, 641/641 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 761 transition count 639
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 639
Applied a total of 4 rules in 41 ms. Remains 761 /763 variables (removed 2) and now considering 639/641 (removed 2) transitions.
// Phase 1: matrix 639 rows 761 cols
[2023-03-19 09:39:50] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-19 09:39:51] [INFO ] Implicit Places using invariants in 1205 ms returned []
[2023-03-19 09:39:51] [INFO ] Invariant cache hit.
[2023-03-19 09:39:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 09:39:53] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 2627 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 761/765 places, 639/641 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3193 ms. Remains : 761/765 places, 639/641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 87145 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87145 steps, saw 70817 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-19 09:39:57] [INFO ] Invariant cache hit.
[2023-03-19 09:39:58] [INFO ] [Real]Absence check using 328 positive place invariants in 614 ms returned sat
[2023-03-19 09:39:58] [INFO ] After 1420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 09:39:59] [INFO ] [Nat]Absence check using 328 positive place invariants in 50 ms returned sat
[2023-03-19 09:40:00] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 09:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 09:40:00] [INFO ] After 454ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 09:40:01] [INFO ] After 1156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 350 ms.
[2023-03-19 09:40:01] [INFO ] After 2892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 17 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 639/639 transitions.
Applied a total of 0 rules in 19 ms. Remains 761 /761 variables (removed 0) and now considering 639/639 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 761/761 places, 639/639 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 639/639 transitions.
Applied a total of 0 rules in 19 ms. Remains 761 /761 variables (removed 0) and now considering 639/639 (removed 0) transitions.
[2023-03-19 09:40:01] [INFO ] Invariant cache hit.
[2023-03-19 09:40:02] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-19 09:40:02] [INFO ] Invariant cache hit.
[2023-03-19 09:40:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 09:40:03] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2023-03-19 09:40:03] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 09:40:03] [INFO ] Invariant cache hit.
[2023-03-19 09:40:04] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2349 ms. Remains : 761/761 places, 639/639 transitions.
Partial Free-agglomeration rule applied 167 times.
Drop transitions removed 167 transitions
Iterating global reduction 0 with 167 rules applied. Total rules applied 167 place count 761 transition count 639
Applied a total of 167 rules in 44 ms. Remains 761 /761 variables (removed 0) and now considering 639/639 (removed 0) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 639 rows 761 cols
[2023-03-19 09:40:04] [INFO ] Computed 328 place invariants in 7 ms
[2023-03-19 09:40:04] [INFO ] [Real]Absence check using 328 positive place invariants in 56 ms returned sat
[2023-03-19 09:40:04] [INFO ] After 558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 09:40:05] [INFO ] [Nat]Absence check using 328 positive place invariants in 98 ms returned sat
[2023-03-19 09:40:06] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 09:40:06] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-19 09:40:06] [INFO ] After 427ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 09:40:06] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
[2023-03-19 09:40:07] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 23 ms to minimize.
[2023-03-19 09:40:07] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-19 09:40:07] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2023-03-19 09:40:07] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2023-03-19 09:40:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1240 ms
[2023-03-19 09:40:08] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-19 09:40:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-19 09:40:08] [INFO ] After 2618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 492 ms.
[2023-03-19 09:40:09] [INFO ] After 4304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Computed a total of 479 stabilizing places and 479 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(X(X(X(X(G(p0)))))))'
Support contains 2 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2011 transition count 1801
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2011 transition count 1801
Applied a total of 18 rules in 255 ms. Remains 2011 /2020 variables (removed 9) and now considering 1801/1810 (removed 9) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2023-03-19 09:40:09] [INFO ] Computed 331 place invariants in 22 ms
[2023-03-19 09:40:10] [INFO ] Implicit Places using invariants in 845 ms returned []
[2023-03-19 09:40:10] [INFO ] Invariant cache hit.
[2023-03-19 09:40:12] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned []
Implicit Place search using SMT with State Equation took 3129 ms to find 0 implicit places.
[2023-03-19 09:40:12] [INFO ] Invariant cache hit.
[2023-03-19 09:40:14] [INFO ] Dead Transitions using invariants and state equation in 1971 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2020 places, 1801/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5357 ms. Remains : 2011/2020 places, 1801/1810 transitions.
Stuttering acceptance computed with spot in 693 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (EQ s1235 1) (EQ s1260 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 4 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-00 finished in 6176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (G(p0)||X(F(p1))))))'
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2019 transition count 1387
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1597 transition count 1387
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 844 place count 1597 transition count 1154
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1315 place count 1359 transition count 1149
Iterating global reduction 2 with 5 rules applied. Total rules applied 1320 place count 1359 transition count 1149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1320 place count 1359 transition count 1145
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1328 place count 1355 transition count 1145
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 2348 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 2349 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 2351 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2527 place count 756 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 754 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 753 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 2530 place count 753 transition count 629
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 2534 place count 751 transition count 629
Applied a total of 2534 rules in 526 ms. Remains 751 /2020 variables (removed 1269) and now considering 629/1810 (removed 1181) transitions.
// Phase 1: matrix 629 rows 751 cols
[2023-03-19 09:40:16] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-19 09:40:16] [INFO ] Implicit Places using invariants in 482 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 493 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2020 places, 629/1810 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 747 transition count 627
Applied a total of 4 rules in 49 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2023-03-19 09:40:16] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-19 09:40:17] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-19 09:40:17] [INFO ] Invariant cache hit.
[2023-03-19 09:40:18] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2020 places, 627/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2534 ms. Remains : 747/2020 places, 627/1810 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s68 1) (EQ s76 1)), p1:(EQ s697 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 411 reset in 736 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-01 finished in 3463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 306 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-19 09:40:19] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-19 09:40:20] [INFO ] Implicit Places using invariants in 964 ms returned []
[2023-03-19 09:40:20] [INFO ] Invariant cache hit.
[2023-03-19 09:40:22] [INFO ] Implicit Places using invariants and state equation in 2384 ms returned []
Implicit Place search using SMT with State Equation took 3381 ms to find 0 implicit places.
[2023-03-19 09:40:22] [INFO ] Invariant cache hit.
[2023-03-19 09:40:23] [INFO ] Dead Transitions using invariants and state equation in 1225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2020 places, 1802/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4930 ms. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s573 1) (EQ s1625 1)) (AND (EQ s1102 1) (EQ s941 1))), p1:(EQ s1625 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 568 reset in 360 ms.
Product exploration explored 100000 steps with 570 reset in 409 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/2012 stabilizing places and 478/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 332 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 182 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 341 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-19 09:40:25] [INFO ] Invariant cache hit.
[2023-03-19 09:40:27] [INFO ] [Real]Absence check using 331 positive place invariants in 596 ms returned sat
[2023-03-19 09:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:40:38] [INFO ] [Real]Absence check using state equation in 11040 ms returned sat
[2023-03-19 09:40:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:40:40] [INFO ] [Nat]Absence check using 331 positive place invariants in 443 ms returned sat
[2023-03-19 09:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:40:50] [INFO ] [Nat]Absence check using state equation in 9893 ms returned sat
[2023-03-19 09:40:50] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2023-03-19 09:40:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-19 09:40:50] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 110 ms.
[2023-03-19 09:40:55] [INFO ] Deduced a trap composed of 22 places in 1065 ms of which 2 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-19 09:40:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 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 2011 transition count 1384
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1594 transition count 1384
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 240 Pre rules applied. Total rules applied 834 place count 1594 transition count 1144
Deduced a syphon composed of 240 places in 2 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 1314 place count 1354 transition count 1144
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2328 place count 847 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2329 place count 847 transition count 636
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 2331 place count 846 transition count 635
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 2509 place count 757 transition count 635
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2511 place count 755 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2512 place count 754 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2512 place count 754 transition count 631
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 2516 place count 752 transition count 631
Applied a total of 2516 rules in 285 ms. Remains 752 /2012 variables (removed 1260) and now considering 631/1802 (removed 1171) transitions.
// Phase 1: matrix 631 rows 752 cols
[2023-03-19 09:40:55] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-19 09:40:55] [INFO ] Implicit Places using invariants in 505 ms returned [735, 739]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 520 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/2012 places, 631/1802 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 748 transition count 629
Applied a total of 4 rules in 62 ms. Remains 748 /750 variables (removed 2) and now considering 629/631 (removed 2) transitions.
// Phase 1: matrix 629 rows 748 cols
[2023-03-19 09:40:55] [INFO ] Computed 328 place invariants in 16 ms
[2023-03-19 09:40:56] [INFO ] Implicit Places using invariants in 566 ms returned []
[2023-03-19 09:40:56] [INFO ] Invariant cache hit.
[2023-03-19 09:40:57] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/2012 places, 629/1802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2257 ms. Remains : 748/2012 places, 629/1802 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/748 stabilizing places and 2/629 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 251 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 311 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-19 09:40:58] [INFO ] Invariant cache hit.
[2023-03-19 09:40:59] [INFO ] [Real]Absence check using 328 positive place invariants in 294 ms returned sat
[2023-03-19 09:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:40:59] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2023-03-19 09:40:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:41:00] [INFO ] [Nat]Absence check using 328 positive place invariants in 160 ms returned sat
[2023-03-19 09:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:41:01] [INFO ] [Nat]Absence check using state equation in 986 ms returned sat
[2023-03-19 09:41:01] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-19 09:41:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-19 09:41:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-03-19 09:41:01] [INFO ] Computed and/alt/rep : 624/983/624 causal constraints (skipped 0 transitions) in 71 ms.
[2023-03-19 09:41:10] [INFO ] Added : 527 causal constraints over 106 iterations in 8738 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19424 reset in 796 ms.
Stack based approach found an accepted trace after 28 steps with 2 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-02 finished in 52427 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))'
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2019 transition count 1387
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1597 transition count 1387
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 844 place count 1597 transition count 1153
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1312 place count 1363 transition count 1153
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1317 place count 1358 transition count 1148
Iterating global reduction 2 with 5 rules applied. Total rules applied 1322 place count 1358 transition count 1148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1322 place count 1358 transition count 1144
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1330 place count 1354 transition count 1144
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2352 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2353 place count 843 transition count 632
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 2355 place count 842 transition count 631
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 2533 place count 753 transition count 631
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2535 place count 751 transition count 629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2536 place count 750 transition count 629
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2536 place count 750 transition count 627
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 2540 place count 748 transition count 627
Applied a total of 2540 rules in 311 ms. Remains 748 /2020 variables (removed 1272) and now considering 627/1810 (removed 1183) transitions.
// Phase 1: matrix 627 rows 748 cols
[2023-03-19 09:41:11] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:41:12] [INFO ] Implicit Places using invariants in 836 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 858 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 746/2020 places, 627/1810 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 744 transition count 625
Applied a total of 4 rules in 23 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2023-03-19 09:41:12] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-19 09:41:13] [INFO ] Implicit Places using invariants in 921 ms returned []
[2023-03-19 09:41:13] [INFO ] Invariant cache hit.
[2023-03-19 09:41:14] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 744/2020 places, 625/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3481 ms. Remains : 744/2020 places, 625/1810 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s480 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8 reset in 633 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-03 finished in 4202 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&&X((!p0 U (p1||G(!p0))))) U (!p1||F(p2))))))'
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 229 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-19 09:41:15] [INFO ] Computed 331 place invariants in 19 ms
[2023-03-19 09:41:16] [INFO ] Implicit Places using invariants in 836 ms returned []
[2023-03-19 09:41:16] [INFO ] Invariant cache hit.
[2023-03-19 09:41:19] [INFO ] Implicit Places using invariants and state equation in 2415 ms returned []
Implicit Place search using SMT with State Equation took 3254 ms to find 0 implicit places.
[2023-03-19 09:41:19] [INFO ] Invariant cache hit.
[2023-03-19 09:41:20] [INFO ] Dead Transitions using invariants and state equation in 1339 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2020 places, 1802/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4836 ms. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s1148 1), p2:(EQ s609 1), p0:(AND (EQ s775 1) (EQ s777 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22150 reset in 636 ms.
Product exploration explored 100000 steps with 22302 reset in 586 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2012 stabilizing places and 479/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 696 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 09:41:23] [INFO ] Invariant cache hit.
[2023-03-19 09:41:23] [INFO ] [Real]Absence check using 331 positive place invariants in 121 ms returned sat
[2023-03-19 09:41:25] [INFO ] After 1232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-19 09:41:25] [INFO ] Deduced a trap composed of 21 places in 851 ms of which 2 ms to minimize.
[2023-03-19 09:41:26] [INFO ] Deduced a trap composed of 19 places in 651 ms of which 2 ms to minimize.
[2023-03-19 09:41:27] [INFO ] Deduced a trap composed of 23 places in 507 ms of which 6 ms to minimize.
[2023-03-19 09:41:27] [INFO ] Deduced a trap composed of 25 places in 485 ms of which 31 ms to minimize.
[2023-03-19 09:41:28] [INFO ] Deduced a trap composed of 23 places in 792 ms of which 15 ms to minimize.
[2023-03-19 09:41:29] [INFO ] Deduced a trap composed of 25 places in 545 ms of which 1 ms to minimize.
[2023-03-19 09:41:29] [INFO ] Deduced a trap composed of 26 places in 468 ms of which 1 ms to minimize.
[2023-03-19 09:41:30] [INFO ] Deduced a trap composed of 24 places in 606 ms of which 1 ms to minimize.
[2023-03-19 09:41:31] [INFO ] Deduced a trap composed of 25 places in 759 ms of which 1 ms to minimize.
[2023-03-19 09:41:32] [INFO ] Deduced a trap composed of 17 places in 665 ms of which 1 ms to minimize.
[2023-03-19 09:41:32] [INFO ] Deduced a trap composed of 23 places in 592 ms of which 1 ms to minimize.
[2023-03-19 09:41:33] [INFO ] Deduced a trap composed of 17 places in 454 ms of which 1 ms to minimize.
[2023-03-19 09:41:34] [INFO ] Deduced a trap composed of 25 places in 542 ms of which 1 ms to minimize.
[2023-03-19 09:41:34] [INFO ] Deduced a trap composed of 26 places in 612 ms of which 1 ms to minimize.
[2023-03-19 09:41:35] [INFO ] Deduced a trap composed of 17 places in 581 ms of which 10 ms to minimize.
[2023-03-19 09:41:35] [INFO ] Deduced a trap composed of 45 places in 418 ms of which 1 ms to minimize.
[2023-03-19 09:41:36] [INFO ] Deduced a trap composed of 37 places in 532 ms of which 1 ms to minimize.
[2023-03-19 09:41:37] [INFO ] Deduced a trap composed of 44 places in 411 ms of which 1 ms to minimize.
[2023-03-19 09:41:37] [INFO ] Deduced a trap composed of 29 places in 396 ms of which 1 ms to minimize.
[2023-03-19 09:41:38] [INFO ] Deduced a trap composed of 34 places in 563 ms of which 1 ms to minimize.
[2023-03-19 09:41:38] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 1 ms to minimize.
[2023-03-19 09:41:39] [INFO ] Deduced a trap composed of 20 places in 390 ms of which 0 ms to minimize.
[2023-03-19 09:41:39] [INFO ] Deduced a trap composed of 29 places in 411 ms of which 1 ms to minimize.
[2023-03-19 09:41:39] [INFO ] Deduced a trap composed of 34 places in 333 ms of which 1 ms to minimize.
[2023-03-19 09:41:40] [INFO ] Deduced a trap composed of 27 places in 362 ms of which 1 ms to minimize.
[2023-03-19 09:41:40] [INFO ] Deduced a trap composed of 39 places in 396 ms of which 1 ms to minimize.
[2023-03-19 09:41:41] [INFO ] Deduced a trap composed of 40 places in 433 ms of which 1 ms to minimize.
[2023-03-19 09:41:41] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 1 ms to minimize.
[2023-03-19 09:41:42] [INFO ] Deduced a trap composed of 46 places in 479 ms of which 1 ms to minimize.
[2023-03-19 09:41:42] [INFO ] Deduced a trap composed of 35 places in 336 ms of which 1 ms to minimize.
[2023-03-19 09:41:43] [INFO ] Deduced a trap composed of 23 places in 370 ms of which 0 ms to minimize.
[2023-03-19 09:41:43] [INFO ] Deduced a trap composed of 29 places in 347 ms of which 1 ms to minimize.
[2023-03-19 09:41:44] [INFO ] Deduced a trap composed of 33 places in 477 ms of which 1 ms to minimize.
[2023-03-19 09:41:44] [INFO ] Deduced a trap composed of 33 places in 337 ms of which 12 ms to minimize.
[2023-03-19 09:41:45] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 1 ms to minimize.
[2023-03-19 09:41:45] [INFO ] Deduced a trap composed of 43 places in 479 ms of which 0 ms to minimize.
[2023-03-19 09:41:46] [INFO ] Deduced a trap composed of 33 places in 363 ms of which 1 ms to minimize.
[2023-03-19 09:41:46] [INFO ] Deduced a trap composed of 41 places in 312 ms of which 1 ms to minimize.
[2023-03-19 09:41:46] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 1 ms to minimize.
[2023-03-19 09:41:47] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 1 ms to minimize.
[2023-03-19 09:41:47] [INFO ] Deduced a trap composed of 44 places in 419 ms of which 1 ms to minimize.
[2023-03-19 09:41:48] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 2 ms to minimize.
[2023-03-19 09:41:48] [INFO ] Deduced a trap composed of 41 places in 311 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:339)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-19 09:41:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:41:48] [INFO ] After 25363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2012/2012 places, 1802/1802 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 2012 transition count 1385
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 1595 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 1594 transition count 1384
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 836 place count 1594 transition count 1143
Deduced a syphon composed of 241 places in 1 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 3 with 482 rules applied. Total rules applied 1318 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 0 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2334 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2335 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 4 with 2 rules applied. Total rules applied 2337 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 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2515 place count 755 transition count 633
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2603 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2604 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2605 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2605 place count 753 transition count 630
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2609 place count 751 transition count 630
Applied a total of 2609 rules in 259 ms. Remains 751 /2012 variables (removed 1261) and now considering 630/1802 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 751/2012 places, 630/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 630 rows 751 cols
[2023-03-19 09:41:49] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-19 09:41:49] [INFO ] [Real]Absence check using 330 positive place invariants in 75 ms returned sat
[2023-03-19 09:41:49] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:41:49] [INFO ] [Nat]Absence check using 330 positive place invariants in 55 ms returned sat
[2023-03-19 09:41:50] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:41:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 09:41:50] [INFO ] After 56ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:41:50] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-19 09:41:50] [INFO ] After 747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 32 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 751/751 places, 630/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 287025 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 287025 steps, saw 238132 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:41:53] [INFO ] Invariant cache hit.
[2023-03-19 09:41:53] [INFO ] [Real]Absence check using 330 positive place invariants in 65 ms returned sat
[2023-03-19 09:41:54] [INFO ] After 1175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:41:54] [INFO ] [Nat]Absence check using 330 positive place invariants in 58 ms returned sat
[2023-03-19 09:41:55] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:41:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 09:41:55] [INFO ] After 29ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:41:55] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 0 ms to minimize.
[2023-03-19 09:41:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-19 09:41:55] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-19 09:41:55] [INFO ] After 966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 14 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2023-03-19 09:41:55] [INFO ] Invariant cache hit.
[2023-03-19 09:41:56] [INFO ] Implicit Places using invariants in 514 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 516 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 26 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-19 09:41:56] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-19 09:41:56] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-19 09:41:56] [INFO ] Invariant cache hit.
[2023-03-19 09:41:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 09:41:57] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2124 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289637 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289637 steps, saw 241576 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:42:00] [INFO ] Invariant cache hit.
[2023-03-19 09:42:01] [INFO ] [Real]Absence check using 328 positive place invariants in 63 ms returned sat
[2023-03-19 09:42:01] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:42:01] [INFO ] [Nat]Absence check using 328 positive place invariants in 157 ms returned sat
[2023-03-19 09:42:01] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:42:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 09:42:01] [INFO ] After 37ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:42:02] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-19 09:42:02] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2023-03-19 09:42:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2023-03-19 09:42:02] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-19 09:42:02] [INFO ] After 1281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 26 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 19 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2023-03-19 09:42:02] [INFO ] Invariant cache hit.
[2023-03-19 09:42:02] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-19 09:42:02] [INFO ] Invariant cache hit.
[2023-03-19 09:42:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 09:42:04] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
[2023-03-19 09:42:04] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-19 09:42:04] [INFO ] Invariant cache hit.
[2023-03-19 09:42:04] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2522 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 0 with 175 rules applied. Total rules applied 175 place count 747 transition count 628
Applied a total of 175 rules in 36 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 628 rows 747 cols
[2023-03-19 09:42:05] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-19 09:42:05] [INFO ] [Real]Absence check using 328 positive place invariants in 57 ms returned sat
[2023-03-19 09:42:05] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:42:05] [INFO ] [Nat]Absence check using 328 positive place invariants in 72 ms returned sat
[2023-03-19 09:42:05] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:42:05] [INFO ] State equation strengthened by 173 read => feed constraints.
[2023-03-19 09:42:05] [INFO ] After 102ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:42:06] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2023-03-19 09:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-19 09:42:06] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-19 09:42:06] [INFO ] After 1101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 1169 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 338 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-19 09:42:08] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-19 09:42:09] [INFO ] [Real]Absence check using 331 positive place invariants in 381 ms returned sat
[2023-03-19 09:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:42:21] [INFO ] [Real]Absence check using state equation in 11802 ms returned sat
[2023-03-19 09:42:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:42:23] [INFO ] [Nat]Absence check using 331 positive place invariants in 406 ms returned sat
[2023-03-19 09:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:42:33] [INFO ] [Nat]Absence check using state equation in 10610 ms returned sat
[2023-03-19 09:42:34] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2023-03-19 09:42:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-19 09:42:34] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 156 ms.
[2023-03-19 09:42:37] [INFO ] Deduced a trap composed of 14 places in 1044 ms of which 2 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-19 09:42:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p1 (NOT p2))
Could not prove EG (AND p1 (NOT p2))
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Applied a total of 0 rules in 147 ms. Remains 2012 /2012 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-19 09:42:38] [INFO ] Invariant cache hit.
[2023-03-19 09:42:38] [INFO ] Implicit Places using invariants in 924 ms returned []
[2023-03-19 09:42:39] [INFO ] Invariant cache hit.
[2023-03-19 09:42:41] [INFO ] Implicit Places using invariants and state equation in 2247 ms returned []
Implicit Place search using SMT with State Equation took 3196 ms to find 0 implicit places.
[2023-03-19 09:42:41] [INFO ] Invariant cache hit.
[2023-03-19 09:42:42] [INFO ] Dead Transitions using invariants and state equation in 1232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4581 ms. Remains : 2012/2012 places, 1802/1802 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2012 stabilizing places and 479/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 857 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 09:42:44] [INFO ] Invariant cache hit.
[2023-03-19 09:42:44] [INFO ] [Real]Absence check using 331 positive place invariants in 138 ms returned sat
[2023-03-19 09:42:45] [INFO ] After 1255ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-19 09:42:46] [INFO ] Deduced a trap composed of 21 places in 1007 ms of which 2 ms to minimize.
[2023-03-19 09:42:47] [INFO ] Deduced a trap composed of 19 places in 522 ms of which 2 ms to minimize.
[2023-03-19 09:42:48] [INFO ] Deduced a trap composed of 23 places in 582 ms of which 1 ms to minimize.
[2023-03-19 09:42:48] [INFO ] Deduced a trap composed of 25 places in 612 ms of which 3 ms to minimize.
[2023-03-19 09:42:49] [INFO ] Deduced a trap composed of 23 places in 880 ms of which 15 ms to minimize.
[2023-03-19 09:42:50] [INFO ] Deduced a trap composed of 25 places in 543 ms of which 1 ms to minimize.
[2023-03-19 09:42:51] [INFO ] Deduced a trap composed of 26 places in 556 ms of which 1 ms to minimize.
[2023-03-19 09:42:51] [INFO ] Deduced a trap composed of 24 places in 659 ms of which 1 ms to minimize.
[2023-03-19 09:42:52] [INFO ] Deduced a trap composed of 25 places in 756 ms of which 2 ms to minimize.
[2023-03-19 09:42:53] [INFO ] Deduced a trap composed of 17 places in 594 ms of which 2 ms to minimize.
[2023-03-19 09:42:53] [INFO ] Deduced a trap composed of 23 places in 457 ms of which 1 ms to minimize.
[2023-03-19 09:42:54] [INFO ] Deduced a trap composed of 17 places in 596 ms of which 3 ms to minimize.
[2023-03-19 09:42:55] [INFO ] Deduced a trap composed of 25 places in 481 ms of which 2 ms to minimize.
[2023-03-19 09:42:55] [INFO ] Deduced a trap composed of 26 places in 647 ms of which 2 ms to minimize.
[2023-03-19 09:42:56] [INFO ] Deduced a trap composed of 17 places in 493 ms of which 1 ms to minimize.
[2023-03-19 09:42:57] [INFO ] Deduced a trap composed of 45 places in 481 ms of which 1 ms to minimize.
[2023-03-19 09:42:57] [INFO ] Deduced a trap composed of 37 places in 418 ms of which 1 ms to minimize.
[2023-03-19 09:42:58] [INFO ] Deduced a trap composed of 44 places in 369 ms of which 1 ms to minimize.
[2023-03-19 09:42:58] [INFO ] Deduced a trap composed of 29 places in 412 ms of which 1 ms to minimize.
[2023-03-19 09:42:59] [INFO ] Deduced a trap composed of 34 places in 363 ms of which 1 ms to minimize.
[2023-03-19 09:42:59] [INFO ] Deduced a trap composed of 30 places in 357 ms of which 1 ms to minimize.
[2023-03-19 09:42:59] [INFO ] Deduced a trap composed of 20 places in 353 ms of which 0 ms to minimize.
[2023-03-19 09:43:00] [INFO ] Deduced a trap composed of 29 places in 383 ms of which 0 ms to minimize.
[2023-03-19 09:43:00] [INFO ] Deduced a trap composed of 34 places in 411 ms of which 1 ms to minimize.
[2023-03-19 09:43:01] [INFO ] Deduced a trap composed of 27 places in 406 ms of which 1 ms to minimize.
[2023-03-19 09:43:01] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 1 ms to minimize.
[2023-03-19 09:43:02] [INFO ] Deduced a trap composed of 40 places in 325 ms of which 1 ms to minimize.
[2023-03-19 09:43:02] [INFO ] Deduced a trap composed of 36 places in 498 ms of which 0 ms to minimize.
[2023-03-19 09:43:03] [INFO ] Deduced a trap composed of 46 places in 480 ms of which 3 ms to minimize.
[2023-03-19 09:43:03] [INFO ] Deduced a trap composed of 35 places in 316 ms of which 1 ms to minimize.
[2023-03-19 09:43:04] [INFO ] Deduced a trap composed of 23 places in 436 ms of which 1 ms to minimize.
[2023-03-19 09:43:04] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 1 ms to minimize.
[2023-03-19 09:43:05] [INFO ] Deduced a trap composed of 33 places in 374 ms of which 0 ms to minimize.
[2023-03-19 09:43:05] [INFO ] Deduced a trap composed of 33 places in 499 ms of which 1 ms to minimize.
[2023-03-19 09:43:06] [INFO ] Deduced a trap composed of 29 places in 372 ms of which 1 ms to minimize.
[2023-03-19 09:43:06] [INFO ] Deduced a trap composed of 43 places in 458 ms of which 1 ms to minimize.
[2023-03-19 09:43:07] [INFO ] Deduced a trap composed of 33 places in 524 ms of which 1 ms to minimize.
[2023-03-19 09:43:07] [INFO ] Deduced a trap composed of 41 places in 366 ms of which 27 ms to minimize.
[2023-03-19 09:43:08] [INFO ] Deduced a trap composed of 32 places in 538 ms of which 1 ms to minimize.
[2023-03-19 09:43:08] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 1 ms to minimize.
[2023-03-19 09:43:09] [INFO ] Deduced a trap composed of 44 places in 401 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:339)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-19 09:43:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:43:09] [INFO ] After 25240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2012/2012 places, 1802/1802 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 2012 transition count 1385
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 1595 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 1594 transition count 1384
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 836 place count 1594 transition count 1143
Deduced a syphon composed of 241 places in 3 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 3 with 482 rules applied. Total rules applied 1318 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 3 with 1016 rules applied. Total rules applied 2334 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2335 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2337 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 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2515 place count 755 transition count 633
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2603 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2604 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2605 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2605 place count 753 transition count 630
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 2609 place count 751 transition count 630
Applied a total of 2609 rules in 324 ms. Remains 751 /2012 variables (removed 1261) and now considering 630/1802 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 751/2012 places, 630/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 229095 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229095 steps, saw 189268 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 630 rows 751 cols
[2023-03-19 09:43:12] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:43:13] [INFO ] [Real]Absence check using 330 positive place invariants in 58 ms returned sat
[2023-03-19 09:43:13] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:43:13] [INFO ] [Nat]Absence check using 330 positive place invariants in 75 ms returned sat
[2023-03-19 09:43:13] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:43:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 09:43:13] [INFO ] After 107ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:43:14] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2023-03-19 09:43:14] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2023-03-19 09:43:14] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-19 09:43:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 487 ms
[2023-03-19 09:43:14] [INFO ] After 712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-19 09:43:14] [INFO ] After 1413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 27 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 17 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2023-03-19 09:43:14] [INFO ] Invariant cache hit.
[2023-03-19 09:43:15] [INFO ] Implicit Places using invariants in 433 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 436 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 59 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-19 09:43:15] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-19 09:43:15] [INFO ] Implicit Places using invariants in 609 ms returned []
[2023-03-19 09:43:15] [INFO ] Invariant cache hit.
[2023-03-19 09:43:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 09:43:16] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2102 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 227903 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227903 steps, saw 190014 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 09:43:19] [INFO ] Invariant cache hit.
[2023-03-19 09:43:20] [INFO ] [Real]Absence check using 328 positive place invariants in 84 ms returned sat
[2023-03-19 09:43:20] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:43:20] [INFO ] [Nat]Absence check using 328 positive place invariants in 94 ms returned sat
[2023-03-19 09:43:20] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:43:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 09:43:20] [INFO ] After 101ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:43:21] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-19 09:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-19 09:43:21] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-19 09:43:21] [INFO ] After 1173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 16 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 15 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2023-03-19 09:43:21] [INFO ] Invariant cache hit.
[2023-03-19 09:43:22] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-19 09:43:22] [INFO ] Invariant cache hit.
[2023-03-19 09:43:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 09:43:23] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
[2023-03-19 09:43:23] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 09:43:23] [INFO ] Invariant cache hit.
[2023-03-19 09:43:23] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2152 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 0 with 175 rules applied. Total rules applied 175 place count 747 transition count 628
Applied a total of 175 rules in 29 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 628 rows 747 cols
[2023-03-19 09:43:23] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-19 09:43:23] [INFO ] [Real]Absence check using 328 positive place invariants in 76 ms returned sat
[2023-03-19 09:43:23] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:43:24] [INFO ] [Nat]Absence check using 328 positive place invariants in 50 ms returned sat
[2023-03-19 09:43:24] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:43:24] [INFO ] State equation strengthened by 173 read => feed constraints.
[2023-03-19 09:43:24] [INFO ] After 175ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:43:24] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
[2023-03-19 09:43:25] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2023-03-19 09:43:25] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
[2023-03-19 09:43:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 880 ms
[2023-03-19 09:43:26] [INFO ] Deduced a trap composed of 6 places in 378 ms of which 1 ms to minimize.
[2023-03-19 09:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2023-03-19 09:43:26] [INFO ] After 1663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-19 09:43:26] [INFO ] After 2303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 1684 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 502 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-19 09:43:28] [INFO ] Computed 331 place invariants in 22 ms
[2023-03-19 09:43:30] [INFO ] [Real]Absence check using 331 positive place invariants in 400 ms returned sat
[2023-03-19 09:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:43:42] [INFO ] [Real]Absence check using state equation in 11628 ms returned sat
[2023-03-19 09:43:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:43:44] [INFO ] [Nat]Absence check using 331 positive place invariants in 402 ms returned sat
[2023-03-19 09:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:43:56] [INFO ] [Nat]Absence check using state equation in 12153 ms returned sat
[2023-03-19 09:43:56] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2023-03-19 09:43:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-19 09:43:56] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 133 ms.
[2023-03-19 09:43:58] [INFO ] Deduced a trap composed of 14 places in 1248 ms of which 2 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-19 09:43:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p1 (NOT p2))
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 307 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 28526 reset in 719 ms.
Product exploration explored 100000 steps with 28597 reset in 622 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 248 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2012 transition count 1802
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 151 Pre rules applied. Total rules applied 418 place count 2012 transition count 1922
Deduced a syphon composed of 569 places in 3 ms
Iterating global reduction 1 with 151 rules applied. Total rules applied 569 place count 2012 transition count 1922
Performed 569 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1138 places in 3 ms
Iterating global reduction 1 with 569 rules applied. Total rules applied 1138 place count 2012 transition count 1923
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1139 place count 2012 transition count 1922
Renaming transitions due to excessive name length > 1024 char.
Discarding 211 places :
Symmetric choice reduction at 2 with 211 rule applications. Total rules 1350 place count 1801 transition count 1710
Deduced a syphon composed of 927 places in 2 ms
Iterating global reduction 2 with 211 rules applied. Total rules applied 1561 place count 1801 transition count 1710
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 928 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1562 place count 1801 transition count 1710
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1564 place count 1799 transition count 1708
Deduced a syphon composed of 926 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1566 place count 1799 transition count 1708
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1027 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1667 place count 1799 transition count 2138
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1768 place count 1698 transition count 1936
Deduced a syphon composed of 926 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1869 place count 1698 transition count 1936
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 943 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1886 place count 1698 transition count 2009
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1903 place count 1681 transition count 1975
Deduced a syphon composed of 926 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1920 place count 1681 transition count 1975
Deduced a syphon composed of 926 places in 1 ms
Applied a total of 1920 rules in 1342 ms. Remains 1681 /2012 variables (removed 331) and now considering 1975/1802 (removed -173) transitions.
[2023-03-19 09:44:02] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 1975 rows 1681 cols
[2023-03-19 09:44:02] [INFO ] Computed 331 place invariants in 16 ms
[2023-03-19 09:44:03] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1681/2012 places, 1975/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2519 ms. Remains : 1681/2012 places, 1975/1802 transitions.
Built C files in :
/tmp/ltsmin4352287348870899940
[2023-03-19 09:44:03] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4352287348870899940
Running compilation step : cd /tmp/ltsmin4352287348870899940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4352287348870899940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4352287348870899940;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Applied a total of 0 rules in 165 ms. Remains 2012 /2012 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-19 09:44:06] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-19 09:44:07] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-19 09:44:07] [INFO ] Invariant cache hit.
[2023-03-19 09:44:09] [INFO ] Implicit Places using invariants and state equation in 2156 ms returned []
Implicit Place search using SMT with State Equation took 2966 ms to find 0 implicit places.
[2023-03-19 09:44:09] [INFO ] Invariant cache hit.
[2023-03-19 09:44:10] [INFO ] Dead Transitions using invariants and state equation in 1218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4364 ms. Remains : 2012/2012 places, 1802/1802 transitions.
Built C files in :
/tmp/ltsmin11626187164239763993
[2023-03-19 09:44:10] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11626187164239763993
Running compilation step : cd /tmp/ltsmin11626187164239763993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11626187164239763993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11626187164239763993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 09:44:14] [INFO ] Flatten gal took : 53 ms
[2023-03-19 09:44:14] [INFO ] Flatten gal took : 75 ms
[2023-03-19 09:44:14] [INFO ] Time to serialize gal into /tmp/LTL16918241368166488612.gal : 13 ms
[2023-03-19 09:44:14] [INFO ] Time to serialize properties into /tmp/LTL6499924672228698875.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16918241368166488612.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6097816059094602933.hoa' '-atoms' '/tmp/LTL6499924672228698875.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6499924672228698875.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6097816059094602933.hoa
Detected timeout of ITS tools.
[2023-03-19 09:44:29] [INFO ] Flatten gal took : 89 ms
[2023-03-19 09:44:29] [INFO ] Flatten gal took : 79 ms
[2023-03-19 09:44:29] [INFO ] Time to serialize gal into /tmp/LTL7924649533364560916.gal : 8 ms
[2023-03-19 09:44:29] [INFO ] Time to serialize properties into /tmp/LTL393491039152355801.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7924649533364560916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL393491039152355801.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G(((!("((p895==1)&&(p897==1))"))&&(X((!("((p895==1)&&(p897==1))"))U(("(p1331!=1)")||(G(!("((p895==1)&&(p897==1))")))))))U(("(p133...185
Formula 0 simplified : XF(("((p895==1)&&(p897==1))" | X("((p895==1)&&(p897==1))" M !"(p1331!=1)")) R (!"(p1331==1)" & G!"(p701==1)"))
Detected timeout of ITS tools.
[2023-03-19 09:44:44] [INFO ] Flatten gal took : 70 ms
[2023-03-19 09:44:44] [INFO ] Applying decomposition
[2023-03-19 09:44:44] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3550871731716934596.txt' '-o' '/tmp/graph3550871731716934596.bin' '-w' '/tmp/graph3550871731716934596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3550871731716934596.bin' '-l' '-1' '-v' '-w' '/tmp/graph3550871731716934596.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:44:45] [INFO ] Decomposing Gal with order
[2023-03-19 09:44:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:44:45] [INFO ] Removed a total of 303 redundant transitions.
[2023-03-19 09:44:46] [INFO ] Flatten gal took : 128 ms
[2023-03-19 09:44:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-19 09:44:46] [INFO ] Time to serialize gal into /tmp/LTL2116044752653194178.gal : 19 ms
[2023-03-19 09:44:46] [INFO ] Time to serialize properties into /tmp/LTL6044076970874417394.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2116044752653194178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6044076970874417394.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(((!("((i14.u278.p895==1)&&(i14.u278.p897==1))"))&&(X((!("((i14.u278.p895==1)&&(i14.u278.p897==1))"))U(("(i19.i0.i3.u413.p1331!=...278
Formula 0 simplified : XF(("((i14.u278.p895==1)&&(i14.u278.p897==1))" | X("((i14.u278.p895==1)&&(i14.u278.p897==1))" M !"(i19.i0.i3.u413.p1331!=1)")) R (!"...208
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13490384140019829438
[2023-03-19 09:45:01] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13490384140019829438
Running compilation step : cd /tmp/ltsmin13490384140019829438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13490384140019829438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13490384140019829438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-030B-LTLFireability-04 finished in 228547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 423 rules applied. Total rules applied 423 place count 2019 transition count 1386
Reduce places removed 423 places and 0 transitions.
Iterating post reduction 1 with 423 rules applied. Total rules applied 846 place count 1596 transition count 1386
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 846 place count 1596 transition count 1152
Deduced a syphon composed of 234 places in 2 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1314 place count 1362 transition count 1152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1319 place count 1357 transition count 1147
Iterating global reduction 2 with 5 rules applied. Total rules applied 1324 place count 1357 transition count 1147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1324 place count 1357 transition count 1143
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1332 place count 1353 transition count 1143
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2350 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2351 place count 844 transition count 633
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 2353 place count 843 transition count 632
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 2531 place count 754 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2533 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2534 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2534 place count 751 transition count 628
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 2538 place count 749 transition count 628
Applied a total of 2538 rules in 373 ms. Remains 749 /2020 variables (removed 1271) and now considering 628/1810 (removed 1182) transitions.
// Phase 1: matrix 628 rows 749 cols
[2023-03-19 09:45:04] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:45:05] [INFO ] Implicit Places using invariants in 604 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 605 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 747/2020 places, 628/1810 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 745 transition count 626
Applied a total of 4 rules in 23 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2023-03-19 09:45:05] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-19 09:45:05] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-19 09:45:05] [INFO ] Invariant cache hit.
[2023-03-19 09:45:06] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 745/2020 places, 626/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2731 ms. Remains : 745/2020 places, 626/1810 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s703 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 567 ms.
Stack based approach found an accepted trace after 78 steps with 0 reset with depth 79 and stack size 79 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-05 finished in 3382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 423 rules applied. Total rules applied 423 place count 2019 transition count 1386
Reduce places removed 423 places and 0 transitions.
Iterating post reduction 1 with 423 rules applied. Total rules applied 846 place count 1596 transition count 1386
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 846 place count 1596 transition count 1152
Deduced a syphon composed of 234 places in 2 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1314 place count 1362 transition count 1152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1319 place count 1357 transition count 1147
Iterating global reduction 2 with 5 rules applied. Total rules applied 1324 place count 1357 transition count 1147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1324 place count 1357 transition count 1143
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1332 place count 1353 transition count 1143
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2350 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2351 place count 844 transition count 633
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 2353 place count 843 transition count 632
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 2531 place count 754 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2533 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2534 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2534 place count 751 transition count 628
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 2538 place count 749 transition count 628
Applied a total of 2538 rules in 355 ms. Remains 749 /2020 variables (removed 1271) and now considering 628/1810 (removed 1182) transitions.
// Phase 1: matrix 628 rows 749 cols
[2023-03-19 09:45:07] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-19 09:45:08] [INFO ] Implicit Places using invariants in 454 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 455 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 747/2020 places, 628/1810 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 745 transition count 626
Applied a total of 4 rules in 25 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2023-03-19 09:45:08] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-19 09:45:08] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-19 09:45:08] [INFO ] Invariant cache hit.
[2023-03-19 09:45:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:45:09] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 745/2020 places, 626/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2250 ms. Remains : 745/2020 places, 626/1810 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s528 0)], 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 582 ms.
Product exploration explored 100000 steps with 0 reset in 652 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/745 stabilizing places and 2/626 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 316 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 295 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 34 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2023-03-19 09:45:12] [INFO ] Invariant cache hit.
[2023-03-19 09:45:12] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-19 09:45:12] [INFO ] Invariant cache hit.
[2023-03-19 09:45:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:45:13] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2023-03-19 09:45:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 09:45:13] [INFO ] Invariant cache hit.
[2023-03-19 09:45:14] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2227 ms. Remains : 745/745 places, 626/626 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/745 stabilizing places and 2/626 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 536 ms.
Product exploration explored 100000 steps with 0 reset in 655 ms.
Built C files in :
/tmp/ltsmin8998081192371997127
[2023-03-19 09:45:16] [INFO ] Computing symmetric may disable matrix : 626 transitions.
[2023-03-19 09:45:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:45:16] [INFO ] Computing symmetric may enable matrix : 626 transitions.
[2023-03-19 09:45:16] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:45:16] [INFO ] Computing Do-Not-Accords matrix : 626 transitions.
[2023-03-19 09:45:16] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:45:16] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8998081192371997127
Running compilation step : cd /tmp/ltsmin8998081192371997127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1634 ms.
Running link step : cd /tmp/ltsmin8998081192371997127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin8998081192371997127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9385901053035201241.hoa' '--buchi-type=spotba'
LTSmin run took 7652 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-030B-LTLFireability-09 finished in 18060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2019 transition count 1388
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1598 transition count 1388
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 842 place count 1598 transition count 1155
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1308 place count 1365 transition count 1155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1312 place count 1361 transition count 1151
Iterating global reduction 2 with 4 rules applied. Total rules applied 1316 place count 1361 transition count 1151
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1316 place count 1361 transition count 1148
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1322 place count 1358 transition count 1148
Performed 513 Post agglomeration using F-continuation condition.Transition count delta: 513
Deduced a syphon composed of 513 places in 1 ms
Reduce places removed 513 places and 0 transitions.
Iterating global reduction 2 with 1026 rules applied. Total rules applied 2348 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 2349 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2351 place count 844 transition count 633
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 2525 place count 757 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 755 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 754 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 754 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 752 transition count 629
Applied a total of 2532 rules in 380 ms. Remains 752 /2020 variables (removed 1268) and now considering 629/1810 (removed 1181) transitions.
// Phase 1: matrix 629 rows 752 cols
[2023-03-19 09:45:26] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:45:26] [INFO ] Implicit Places using invariants in 525 ms returned [735, 739]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 528 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/2020 places, 629/1810 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 748 transition count 627
Applied a total of 4 rules in 24 ms. Remains 748 /750 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 748 cols
[2023-03-19 09:45:26] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-19 09:45:27] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-19 09:45:27] [INFO ] Invariant cache hit.
[2023-03-19 09:45:27] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/2020 places, 627/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2330 ms. Remains : 748/2020 places, 627/1810 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s198 0), p1:(EQ s150 1), p2:(EQ s573 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 536 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-10 finished in 3151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 2 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 232 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-19 09:45:29] [INFO ] Computed 331 place invariants in 10 ms
[2023-03-19 09:45:30] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2023-03-19 09:45:30] [INFO ] Invariant cache hit.
[2023-03-19 09:45:32] [INFO ] Implicit Places using invariants and state equation in 2564 ms returned []
Implicit Place search using SMT with State Equation took 3716 ms to find 0 implicit places.
[2023-03-19 09:45:32] [INFO ] Invariant cache hit.
[2023-03-19 09:45:34] [INFO ] Dead Transitions using invariants and state equation in 1380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2020 places, 1802/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5342 ms. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s867 1), p1:(NEQ s1464 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 8467 steps with 0 reset in 58 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-12 finished in 5532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U p2)))'
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2019 transition count 1387
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1597 transition count 1387
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 844 place count 1597 transition count 1154
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1313 place count 1361 transition count 1151
Iterating global reduction 2 with 3 rules applied. Total rules applied 1316 place count 1361 transition count 1151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1316 place count 1361 transition count 1149
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1320 place count 1359 transition count 1149
Performed 514 Post agglomeration using F-continuation condition.Transition count delta: 514
Deduced a syphon composed of 514 places in 1 ms
Reduce places removed 514 places and 0 transitions.
Iterating global reduction 2 with 1028 rules applied. Total rules applied 2348 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 2349 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2351 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2527 place count 756 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 754 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 753 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 2530 place count 753 transition count 629
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 2534 place count 751 transition count 629
Applied a total of 2534 rules in 286 ms. Remains 751 /2020 variables (removed 1269) and now considering 629/1810 (removed 1181) transitions.
// Phase 1: matrix 629 rows 751 cols
[2023-03-19 09:45:34] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:45:35] [INFO ] Implicit Places using invariants in 499 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 500 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2020 places, 629/1810 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 747 transition count 627
Applied a total of 4 rules in 24 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2023-03-19 09:45:35] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-19 09:45:35] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-19 09:45:35] [INFO ] Invariant cache hit.
[2023-03-19 09:45:36] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2020 places, 627/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2094 ms. Remains : 747/2020 places, 627/1810 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s373 1), p1:(EQ s402 1), p0:(EQ s705 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-14 finished in 2345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 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 2019 transition count 1389
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1599 transition count 1389
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 840 place count 1599 transition count 1154
Deduced a syphon composed of 235 places in 2 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1315 place count 1359 transition count 1149
Iterating global reduction 2 with 5 rules applied. Total rules applied 1320 place count 1359 transition count 1149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1320 place count 1359 transition count 1145
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1328 place count 1355 transition count 1145
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2346 place count 846 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2347 place count 846 transition count 635
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 2349 place count 845 transition count 634
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 2527 place count 756 transition count 634
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 630
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 2534 place count 751 transition count 630
Applied a total of 2534 rules in 309 ms. Remains 751 /2020 variables (removed 1269) and now considering 630/1810 (removed 1180) transitions.
// Phase 1: matrix 630 rows 751 cols
[2023-03-19 09:45:37] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:45:37] [INFO ] Implicit Places using invariants in 455 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 457 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2020 places, 630/1810 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 747 transition count 628
Applied a total of 4 rules in 25 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-19 09:45:37] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-19 09:45:38] [INFO ] Implicit Places using invariants in 714 ms returned []
[2023-03-19 09:45:38] [INFO ] Invariant cache hit.
[2023-03-19 09:45:39] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2020 places, 628/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2472 ms. Remains : 747/2020 places, 628/1810 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s508 1) (EQ s207 1)), p1:(AND (EQ s105 1) (EQ s123 1))], nbAcceptance=2, 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 528 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-15 finished in 3068 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&&X((!p0 U (p1||G(!p0))))) U (!p1||F(p2))))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-030B-LTLFireability-04
Stuttering acceptance computed with spot in 393 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p1 (NOT p2))]
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2019 transition count 1390
Reduce places removed 419 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 420 rules applied. Total rules applied 839 place count 1600 transition count 1389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 840 place count 1599 transition count 1389
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 840 place count 1599 transition count 1154
Deduced a syphon composed of 235 places in 2 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1314 place count 1360 transition count 1150
Iterating global reduction 3 with 4 rules applied. Total rules applied 1318 place count 1360 transition count 1150
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1318 place count 1360 transition count 1146
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1326 place count 1356 transition count 1146
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 0 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 3 with 1020 rules applied. Total rules applied 2346 place count 846 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2347 place count 846 transition count 635
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 4 with 2 rules applied. Total rules applied 2349 place count 845 transition count 634
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 4 with 178 rules applied. Total rules applied 2527 place count 756 transition count 634
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2529 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2530 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 630
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 2534 place count 751 transition count 630
Applied a total of 2534 rules in 435 ms. Remains 751 /2020 variables (removed 1269) and now considering 630/1810 (removed 1180) transitions.
// Phase 1: matrix 630 rows 751 cols
[2023-03-19 09:45:40] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:45:41] [INFO ] Implicit Places using invariants in 529 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 531 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 749/2020 places, 630/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 25 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-19 09:45:41] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-19 09:45:41] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-19 09:45:41] [INFO ] Invariant cache hit.
[2023-03-19 09:45:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 09:45:42] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 747/2020 places, 628/1810 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2580 ms. Remains : 747/2020 places, 628/1810 transitions.
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s428 1), p2:(EQ s224 1), p0:(AND (EQ s283 1) (EQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13962 reset in 560 ms.
Stack based approach found an accepted trace after 8954 steps with 1270 reset with depth 13 and stack size 13 in 63 ms.
Treatment of property ShieldPPPt-PT-030B-LTLFireability-04 finished in 3743 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 09:45:43] [INFO ] Flatten gal took : 44 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 403785 ms.

BK_STOP 1679219143828

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713800652"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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