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.r391-oct2-167903715400523.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 lolaxred
Input is ShieldPPPs-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 1.8M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679277714828

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:01:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 02:01:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:01:57] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2023-03-20 02:01:58] [INFO ] Transformed 6803 places.
[2023-03-20 02:01:58] [INFO ] Transformed 6303 transitions.
[2023-03-20 02:01:58] [INFO ] Found NUPN structural information;
[2023-03-20 02:01:58] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 774 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 695 places :
Symmetric choice reduction at 0 with 695 rule applications. Total rules 695 place count 6108 transition count 5608
Iterating global reduction 0 with 695 rules applied. Total rules applied 1390 place count 6108 transition count 5608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1391 place count 6107 transition count 5607
Iterating global reduction 0 with 1 rules applied. Total rules applied 1392 place count 6107 transition count 5607
Applied a total of 1392 rules in 2940 ms. Remains 6107 /6803 variables (removed 696) and now considering 5607/6303 (removed 696) transitions.
// Phase 1: matrix 5607 rows 6107 cols
[2023-03-20 02:02:01] [INFO ] Computed 1101 place invariants in 83 ms
[2023-03-20 02:02:05] [INFO ] Implicit Places using invariants in 3677 ms returned []
[2023-03-20 02:02:05] [INFO ] Invariant cache hit.
[2023-03-20 02:02:08] [INFO ] Implicit Places using invariants and state equation in 2871 ms returned []
Implicit Place search using SMT with State Equation took 6645 ms to find 0 implicit places.
[2023-03-20 02:02:08] [INFO ] Invariant cache hit.
[2023-03-20 02:02:13] [INFO ] Dead Transitions using invariants and state equation in 4919 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6107/6803 places, 5607/6303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14510 ms. Remains : 6107/6803 places, 5607/6303 transitions.
Support contains 32 out of 6107 places after structural reductions.
[2023-03-20 02:02:13] [INFO ] Flatten gal took : 343 ms
[2023-03-20 02:02:13] [INFO ] Flatten gal took : 196 ms
[2023-03-20 02:02:14] [INFO ] Input system was already deterministic with 5607 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-20 02:02:15] [INFO ] Invariant cache hit.
[2023-03-20 02:02:16] [INFO ] After 1328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:02:18] [INFO ] [Nat]Absence check using 1101 positive place invariants in 902 ms returned sat
[2023-03-20 02:02:26] [INFO ] After 7288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:02:29] [INFO ] Deduced a trap composed of 19 places in 2739 ms of which 12 ms to minimize.
[2023-03-20 02:02:32] [INFO ] Deduced a trap composed of 30 places in 2885 ms of which 4 ms to minimize.
[2023-03-20 02:02:35] [INFO ] Deduced a trap composed of 23 places in 2711 ms of which 4 ms to minimize.
[2023-03-20 02:02:39] [INFO ] Deduced a trap composed of 21 places in 3088 ms of which 22 ms to minimize.
[2023-03-20 02:02:42] [INFO ] Deduced a trap composed of 23 places in 2735 ms of which 17 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-20 02:02:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:02:42] [INFO ] After 25435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1945 ms.
Support contains 22 out of 6107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Drop transitions removed 692 transitions
Trivial Post-agglo rules discarded 692 transitions
Performed 692 trivial Post agglomeration. Transition count delta: 692
Iterating post reduction 0 with 692 rules applied. Total rules applied 692 place count 6107 transition count 4915
Reduce places removed 692 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 695 rules applied. Total rules applied 1387 place count 5415 transition count 4912
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1390 place count 5412 transition count 4912
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 497 Pre rules applied. Total rules applied 1390 place count 5412 transition count 4415
Deduced a syphon composed of 497 places in 38 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 3 with 994 rules applied. Total rules applied 2384 place count 4915 transition count 4415
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2386 place count 4913 transition count 4413
Iterating global reduction 3 with 2 rules applied. Total rules applied 2388 place count 4913 transition count 4413
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2388 place count 4913 transition count 4412
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2390 place count 4912 transition count 4412
Performed 1789 Post agglomeration using F-continuation condition.Transition count delta: 1789
Deduced a syphon composed of 1789 places in 10 ms
Reduce places removed 1789 places and 0 transitions.
Iterating global reduction 3 with 3578 rules applied. Total rules applied 5968 place count 3123 transition count 2623
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 888 times.
Drop transitions removed 888 transitions
Iterating global reduction 3 with 888 rules applied. Total rules applied 6856 place count 3123 transition count 2623
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6857 place count 3122 transition count 2622
Applied a total of 6857 rules in 2349 ms. Remains 3122 /6107 variables (removed 2985) and now considering 2622/5607 (removed 2985) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2349 ms. Remains : 3122/6107 places, 2622/5607 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2622 rows 3122 cols
[2023-03-20 02:02:47] [INFO ] Computed 1101 place invariants in 146 ms
[2023-03-20 02:02:48] [INFO ] [Real]Absence check using 1057 positive place invariants in 339 ms returned sat
[2023-03-20 02:02:48] [INFO ] [Real]Absence check using 1057 positive and 44 generalized place invariants in 16 ms returned sat
[2023-03-20 02:02:48] [INFO ] After 977ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:02:49] [INFO ] [Nat]Absence check using 1057 positive place invariants in 582 ms returned sat
[2023-03-20 02:02:49] [INFO ] [Nat]Absence check using 1057 positive and 44 generalized place invariants in 13 ms returned sat
[2023-03-20 02:02:52] [INFO ] After 2584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:02:52] [INFO ] Deduced a trap composed of 7 places in 511 ms of which 1 ms to minimize.
[2023-03-20 02:02:53] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 2 ms to minimize.
[2023-03-20 02:02:54] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 1 ms to minimize.
[2023-03-20 02:02:54] [INFO ] Deduced a trap composed of 8 places in 523 ms of which 2 ms to minimize.
[2023-03-20 02:02:55] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2023-03-20 02:02:56] [INFO ] Deduced a trap composed of 6 places in 444 ms of which 1 ms to minimize.
[2023-03-20 02:02:56] [INFO ] Deduced a trap composed of 8 places in 370 ms of which 1 ms to minimize.
[2023-03-20 02:02:57] [INFO ] Deduced a trap composed of 5 places in 515 ms of which 2 ms to minimize.
[2023-03-20 02:02:57] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 1 ms to minimize.
[2023-03-20 02:02:58] [INFO ] Deduced a trap composed of 6 places in 405 ms of which 1 ms to minimize.
[2023-03-20 02:02:59] [INFO ] Deduced a trap composed of 6 places in 882 ms of which 1 ms to minimize.
[2023-03-20 02:02:59] [INFO ] Deduced a trap composed of 9 places in 643 ms of which 1 ms to minimize.
[2023-03-20 02:03:01] [INFO ] Deduced a trap composed of 5 places in 1236 ms of which 26 ms to minimize.
[2023-03-20 02:03:02] [INFO ] Deduced a trap composed of 6 places in 751 ms of which 1 ms to minimize.
[2023-03-20 02:03:02] [INFO ] Deduced a trap composed of 6 places in 358 ms of which 10 ms to minimize.
[2023-03-20 02:03:03] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 1 ms to minimize.
[2023-03-20 02:03:04] [INFO ] Deduced a trap composed of 4 places in 967 ms of which 1 ms to minimize.
[2023-03-20 02:03:04] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 0 ms to minimize.
[2023-03-20 02:03:05] [INFO ] Deduced a trap composed of 6 places in 409 ms of which 2 ms to minimize.
[2023-03-20 02:03:05] [INFO ] Deduced a trap composed of 6 places in 424 ms of which 0 ms to minimize.
[2023-03-20 02:03:06] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2023-03-20 02:03:06] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 16 ms to minimize.
[2023-03-20 02:03:06] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 1 ms to minimize.
[2023-03-20 02:03:07] [INFO ] Deduced a trap composed of 5 places in 486 ms of which 1 ms to minimize.
[2023-03-20 02:03:07] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 1 ms to minimize.
[2023-03-20 02:03:08] [INFO ] Deduced a trap composed of 5 places in 393 ms of which 1 ms to minimize.
[2023-03-20 02:03:08] [INFO ] Deduced a trap composed of 6 places in 360 ms of which 0 ms to minimize.
[2023-03-20 02:03:09] [INFO ] Deduced a trap composed of 9 places in 389 ms of which 1 ms to minimize.
[2023-03-20 02:03:10] [INFO ] Deduced a trap composed of 7 places in 473 ms of which 16 ms to minimize.
[2023-03-20 02:03:10] [INFO ] Deduced a trap composed of 9 places in 359 ms of which 1 ms to minimize.
[2023-03-20 02:03:11] [INFO ] Deduced a trap composed of 6 places in 385 ms of which 1 ms to minimize.
[2023-03-20 02:03:11] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-20 02:03:11] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 1 ms to minimize.
[2023-03-20 02:03:12] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 1 ms to minimize.
[2023-03-20 02:03:12] [INFO ] Deduced a trap composed of 6 places in 384 ms of which 1 ms to minimize.
[2023-03-20 02:03:13] [INFO ] Deduced a trap composed of 6 places in 513 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:03:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:03:13] [INFO ] After 25241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 457 ms.
Support contains 12 out of 3122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3122/3122 places, 2622/2622 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3122 transition count 2620
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3120 transition count 2620
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 3120 transition count 2617
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 3117 transition count 2617
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 3111 transition count 2611
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 3111 transition count 2611
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 3110 transition count 2610
Applied a total of 25 rules in 636 ms. Remains 3110 /3122 variables (removed 12) and now considering 2610/2622 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 638 ms. Remains : 3110/3122 places, 2610/2622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 57405 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57405 steps, saw 53272 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2610 rows 3110 cols
[2023-03-20 02:03:18] [INFO ] Computed 1101 place invariants in 31 ms
[2023-03-20 02:03:19] [INFO ] [Real]Absence check using 1050 positive place invariants in 287 ms returned sat
[2023-03-20 02:03:19] [INFO ] [Real]Absence check using 1050 positive and 51 generalized place invariants in 13 ms returned sat
[2023-03-20 02:03:19] [INFO ] After 874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:03:20] [INFO ] [Nat]Absence check using 1050 positive place invariants in 277 ms returned sat
[2023-03-20 02:03:20] [INFO ] [Nat]Absence check using 1050 positive and 51 generalized place invariants in 13 ms returned sat
[2023-03-20 02:03:23] [INFO ] After 2742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:03:23] [INFO ] Deduced a trap composed of 3 places in 586 ms of which 2 ms to minimize.
[2023-03-20 02:03:24] [INFO ] Deduced a trap composed of 6 places in 378 ms of which 2 ms to minimize.
[2023-03-20 02:03:25] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 1 ms to minimize.
[2023-03-20 02:03:25] [INFO ] Deduced a trap composed of 6 places in 451 ms of which 1 ms to minimize.
[2023-03-20 02:03:26] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 2 ms to minimize.
[2023-03-20 02:03:26] [INFO ] Deduced a trap composed of 6 places in 424 ms of which 1 ms to minimize.
[2023-03-20 02:03:27] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 1 ms to minimize.
[2023-03-20 02:03:27] [INFO ] Deduced a trap composed of 6 places in 447 ms of which 1 ms to minimize.
[2023-03-20 02:03:28] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 1 ms to minimize.
[2023-03-20 02:03:28] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 14 ms to minimize.
[2023-03-20 02:03:29] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 2 ms to minimize.
[2023-03-20 02:03:29] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 1 ms to minimize.
[2023-03-20 02:03:30] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 1 ms to minimize.
[2023-03-20 02:03:30] [INFO ] Deduced a trap composed of 16 places in 440 ms of which 1 ms to minimize.
[2023-03-20 02:03:31] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 13 ms to minimize.
[2023-03-20 02:03:31] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 0 ms to minimize.
[2023-03-20 02:03:32] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:03:32] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2023-03-20 02:03:32] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2023-03-20 02:03:33] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 0 ms to minimize.
[2023-03-20 02:03:33] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 0 ms to minimize.
[2023-03-20 02:03:33] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 1 ms to minimize.
[2023-03-20 02:03:34] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2023-03-20 02:03:34] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2023-03-20 02:03:35] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-20 02:03:35] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 27 ms to minimize.
[2023-03-20 02:03:35] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 13 ms to minimize.
[2023-03-20 02:03:36] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 22 ms to minimize.
[2023-03-20 02:03:36] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-20 02:03:36] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-20 02:03:36] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 0 ms to minimize.
[2023-03-20 02:03:37] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2023-03-20 02:03:37] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 0 ms to minimize.
[2023-03-20 02:03:37] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2023-03-20 02:03:38] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 2 ms to minimize.
[2023-03-20 02:03:38] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2023-03-20 02:03:38] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 1 ms to minimize.
[2023-03-20 02:03:39] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 15845 ms
[2023-03-20 02:03:39] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-20 02:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2023-03-20 02:03:40] [INFO ] After 19665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 549 ms.
[2023-03-20 02:03:40] [INFO ] After 21183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 518 ms.
Support contains 12 out of 3110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3110/3110 places, 2610/2610 transitions.
Applied a total of 0 rules in 142 ms. Remains 3110 /3110 variables (removed 0) and now considering 2610/2610 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 3110/3110 places, 2610/2610 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3110/3110 places, 2610/2610 transitions.
Applied a total of 0 rules in 144 ms. Remains 3110 /3110 variables (removed 0) and now considering 2610/2610 (removed 0) transitions.
[2023-03-20 02:03:41] [INFO ] Invariant cache hit.
[2023-03-20 02:03:44] [INFO ] Implicit Places using invariants in 2750 ms returned []
[2023-03-20 02:03:44] [INFO ] Invariant cache hit.
[2023-03-20 02:03:50] [INFO ] Implicit Places using invariants and state equation in 6311 ms returned []
Implicit Place search using SMT with State Equation took 9068 ms to find 0 implicit places.
[2023-03-20 02:03:50] [INFO ] Redundant transitions in 178 ms returned []
[2023-03-20 02:03:50] [INFO ] Invariant cache hit.
[2023-03-20 02:03:53] [INFO ] Dead Transitions using invariants and state equation in 2364 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11784 ms. Remains : 3110/3110 places, 2610/2610 transitions.
Applied a total of 0 rules in 134 ms. Remains 3110 /3110 variables (removed 0) and now considering 2610/2610 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:03:53] [INFO ] Invariant cache hit.
[2023-03-20 02:03:54] [INFO ] [Real]Absence check using 1050 positive place invariants in 266 ms returned sat
[2023-03-20 02:03:54] [INFO ] [Real]Absence check using 1050 positive and 51 generalized place invariants in 33 ms returned sat
[2023-03-20 02:03:54] [INFO ] After 874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:03:54] [INFO ] [Nat]Absence check using 1050 positive place invariants in 267 ms returned sat
[2023-03-20 02:03:54] [INFO ] [Nat]Absence check using 1050 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-20 02:03:57] [INFO ] After 2422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:03:58] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
[2023-03-20 02:03:58] [INFO ] Deduced a trap composed of 6 places in 361 ms of which 1 ms to minimize.
[2023-03-20 02:03:59] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 1 ms to minimize.
[2023-03-20 02:03:59] [INFO ] Deduced a trap composed of 6 places in 325 ms of which 1 ms to minimize.
[2023-03-20 02:04:00] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2023-03-20 02:04:00] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:04:00] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2023-03-20 02:04:01] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2023-03-20 02:04:01] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2023-03-20 02:04:02] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2023-03-20 02:04:02] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2023-03-20 02:04:02] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 0 ms to minimize.
[2023-03-20 02:04:03] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2023-03-20 02:04:03] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2023-03-20 02:04:03] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2023-03-20 02:04:04] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 0 ms to minimize.
[2023-03-20 02:04:04] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2023-03-20 02:04:05] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:04:05] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2023-03-20 02:04:05] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2023-03-20 02:04:06] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2023-03-20 02:04:06] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-20 02:04:06] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-03-20 02:04:06] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:04:07] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2023-03-20 02:04:07] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2023-03-20 02:04:07] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2023-03-20 02:04:08] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2023-03-20 02:04:08] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2023-03-20 02:04:08] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2023-03-20 02:04:09] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-20 02:04:09] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:04:09] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2023-03-20 02:04:10] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 0 ms to minimize.
[2023-03-20 02:04:10] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2023-03-20 02:04:10] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-20 02:04:11] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2023-03-20 02:04:11] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-20 02:04:11] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2023-03-20 02:04:11] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-20 02:04:12] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-20 02:04:12] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 0 ms to minimize.
[2023-03-20 02:04:13] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 14 ms to minimize.
[2023-03-20 02:04:13] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:04:14] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 0 ms to minimize.
[2023-03-20 02:04:14] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 2 ms to minimize.
[2023-03-20 02:04:14] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2023-03-20 02:04:15] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 1 ms to minimize.
[2023-03-20 02:04:15] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-20 02:04:15] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-20 02:04:16] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2023-03-20 02:04:16] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 1 ms to minimize.
[2023-03-20 02:04:16] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 18800 ms
[2023-03-20 02:04:16] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2023-03-20 02:04:17] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-20 02:04:17] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:04:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1047 ms
[2023-03-20 02:04:18] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2023-03-20 02:04:18] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 0 ms to minimize.
[2023-03-20 02:04:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 780 ms
[2023-03-20 02:04:18] [INFO ] After 23560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 479 ms.
[2023-03-20 02:04:19] [INFO ] After 25211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ShieldPPPs-PT-100B-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1204 stabilizing places and 1204 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(!(X(p0) U X(p1)))))&&X(F(X(X(p0))))))'
Support contains 4 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 6103 transition count 5603
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 6103 transition count 5603
Applied a total of 8 rules in 1223 ms. Remains 6103 /6107 variables (removed 4) and now considering 5603/5607 (removed 4) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-20 02:04:21] [INFO ] Computed 1101 place invariants in 49 ms
[2023-03-20 02:04:23] [INFO ] Implicit Places using invariants in 2732 ms returned []
[2023-03-20 02:04:23] [INFO ] Invariant cache hit.
[2023-03-20 02:04:24] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 3403 ms to find 0 implicit places.
[2023-03-20 02:04:24] [INFO ] Invariant cache hit.
[2023-03-20 02:04:29] [INFO ] Dead Transitions using invariants and state equation in 4963 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6107 places, 5603/5607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9606 ms. Remains : 6103/6107 places, 5603/5607 transitions.
Stuttering acceptance computed with spot in 725 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s4572 0) (EQ s4033 1)), p0:(OR (EQ s4805 0) (EQ s323 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 1528 ms.
Product exploration explored 100000 steps with 17 reset in 1765 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 463 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 185448 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185448 steps, saw 182598 distinct states, run finished after 3004 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 02:04:37] [INFO ] Invariant cache hit.
[2023-03-20 02:04:38] [INFO ] After 942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:04:40] [INFO ] [Nat]Absence check using 1101 positive place invariants in 775 ms returned sat
[2023-03-20 02:04:45] [INFO ] After 5058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:04:48] [INFO ] Deduced a trap composed of 54 places in 2724 ms of which 4 ms to minimize.
[2023-03-20 02:04:51] [INFO ] Deduced a trap composed of 21 places in 2679 ms of which 4 ms to minimize.
[2023-03-20 02:04:54] [INFO ] Deduced a trap composed of 23 places in 2857 ms of which 3 ms to minimize.
[2023-03-20 02:04:57] [INFO ] Deduced a trap composed of 26 places in 2625 ms of which 3 ms to minimize.
[2023-03-20 02:04:59] [INFO ] Deduced a trap composed of 37 places in 2450 ms of which 4 ms to minimize.
[2023-03-20 02:05:03] [INFO ] Deduced a trap composed of 35 places in 3117 ms of which 3 ms to minimize.
[2023-03-20 02:05:06] [INFO ] Deduced a trap composed of 21 places in 2903 ms of which 3 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.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-20 02:05:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:05:06] [INFO ] After 27900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 392 ms.
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 4902
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5402 transition count 4901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1404 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 21 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2402 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5996 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 3 with 896 rules applied. Total rules applied 6892 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6893 place count 3104 transition count 2604
Applied a total of 6893 rules in 1244 ms. Remains 3104 /6103 variables (removed 2999) and now considering 2604/5603 (removed 2999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1244 ms. Remains : 3104/6103 places, 2604/5603 transitions.
Finished random walk after 1028 steps, including 0 resets, run visited all 3 properties in 20 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-20 02:05:09] [INFO ] Invariant cache hit.
[2023-03-20 02:05:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 6499 ms returned sat
[2023-03-20 02:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:05:24] [INFO ] [Real]Absence check using state equation in 1735 ms returned unknown
Could not prove EG p1
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Applied a total of 0 rules in 639 ms. Remains 6103 /6103 variables (removed 0) and now considering 5603/5603 (removed 0) transitions.
[2023-03-20 02:05:24] [INFO ] Invariant cache hit.
[2023-03-20 02:05:29] [INFO ] Implicit Places using invariants in 4756 ms returned []
[2023-03-20 02:05:29] [INFO ] Invariant cache hit.
[2023-03-20 02:05:32] [INFO ] Implicit Places using invariants and state equation in 2859 ms returned []
Implicit Place search using SMT with State Equation took 7630 ms to find 0 implicit places.
[2023-03-20 02:05:32] [INFO ] Invariant cache hit.
[2023-03-20 02:05:37] [INFO ] Dead Transitions using invariants and state equation in 4960 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13232 ms. Remains : 6103/6103 places, 5603/5603 transitions.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 183293 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183293 steps, saw 180493 distinct states, run finished after 3003 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 02:05:41] [INFO ] Invariant cache hit.
[2023-03-20 02:05:42] [INFO ] After 977ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:05:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 704 ms returned sat
[2023-03-20 02:05:50] [INFO ] After 5827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:05:53] [INFO ] Deduced a trap composed of 54 places in 3013 ms of which 7 ms to minimize.
[2023-03-20 02:05:56] [INFO ] Deduced a trap composed of 21 places in 2613 ms of which 3 ms to minimize.
[2023-03-20 02:05:59] [INFO ] Deduced a trap composed of 23 places in 2677 ms of which 4 ms to minimize.
[2023-03-20 02:06:03] [INFO ] Deduced a trap composed of 26 places in 3260 ms of which 3 ms to minimize.
[2023-03-20 02:06:05] [INFO ] Deduced a trap composed of 37 places in 2532 ms of which 3 ms to minimize.
[2023-03-20 02:06:08] [INFO ] Deduced a trap composed of 35 places in 2792 ms of which 4 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.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-20 02:06:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:06:08] [INFO ] After 26180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 476 ms.
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 4902
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5402 transition count 4901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1404 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 21 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2402 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5996 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 3 with 896 rules applied. Total rules applied 6892 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6893 place count 3104 transition count 2604
Applied a total of 6893 rules in 1243 ms. Remains 3104 /6103 variables (removed 2999) and now considering 2604/5603 (removed 2999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1243 ms. Remains : 3104/6103 places, 2604/5603 transitions.
Finished random walk after 1139 steps, including 0 resets, run visited all 3 properties in 25 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 211 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-20 02:06:11] [INFO ] Invariant cache hit.
[2023-03-20 02:06:24] [INFO ] [Real]Absence check using 1101 positive place invariants in 6521 ms returned sat
[2023-03-20 02:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
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-20 02:06:26] [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: Broken pipe ... while checking expression EG p1
Could not prove EG p1
Stuttering acceptance computed with spot in 477 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Product exploration explored 100000 steps with 20 reset in 1264 ms.
Product exploration explored 100000 steps with 20 reset in 1578 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 5603
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 701 place count 6103 transition count 5604
Deduced a syphon composed of 901 places in 24 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 901 place count 6103 transition count 5604
Performed 2097 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2998 places in 11 ms
Iterating global reduction 1 with 2097 rules applied. Total rules applied 2998 place count 6103 transition count 5604
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 1 with 702 rule applications. Total rules 3700 place count 5401 transition count 4902
Deduced a syphon composed of 2296 places in 10 ms
Iterating global reduction 1 with 702 rules applied. Total rules applied 4402 place count 5401 transition count 4902
Deduced a syphon composed of 2296 places in 9 ms
Applied a total of 4402 rules in 4792 ms. Remains 5401 /6103 variables (removed 702) and now considering 4902/5603 (removed 701) transitions.
[2023-03-20 02:06:35] [INFO ] Redundant transitions in 394 ms returned []
// Phase 1: matrix 4902 rows 5401 cols
[2023-03-20 02:06:35] [INFO ] Computed 1101 place invariants in 188 ms
[2023-03-20 02:06:40] [INFO ] Dead Transitions using invariants and state equation in 4490 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5401/6103 places, 4902/5603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9699 ms. Remains : 5401/6103 places, 4902/5603 transitions.
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Applied a total of 0 rules in 891 ms. Remains 6103 /6103 variables (removed 0) and now considering 5603/5603 (removed 0) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-20 02:06:41] [INFO ] Computed 1101 place invariants in 52 ms
[2023-03-20 02:06:43] [INFO ] Implicit Places using invariants in 2638 ms returned []
[2023-03-20 02:06:43] [INFO ] Invariant cache hit.
[2023-03-20 02:06:46] [INFO ] Implicit Places using invariants and state equation in 2434 ms returned []
Implicit Place search using SMT with State Equation took 5098 ms to find 0 implicit places.
[2023-03-20 02:06:46] [INFO ] Invariant cache hit.
[2023-03-20 02:06:51] [INFO ] Dead Transitions using invariants and state equation in 5562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11569 ms. Remains : 6103/6103 places, 5603/5603 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-01 finished in 152622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(X((X(G(p0))||p1)) U (!p0 U p2))||p3)))'
Support contains 6 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 6104 transition count 5604
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 6104 transition count 5604
Applied a total of 6 rules in 1778 ms. Remains 6104 /6107 variables (removed 3) and now considering 5604/5607 (removed 3) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2023-03-20 02:06:54] [INFO ] Computed 1101 place invariants in 17 ms
[2023-03-20 02:06:56] [INFO ] Implicit Places using invariants in 2629 ms returned []
[2023-03-20 02:06:56] [INFO ] Invariant cache hit.
[2023-03-20 02:06:59] [INFO ] Implicit Places using invariants and state equation in 2729 ms returned []
Implicit Place search using SMT with State Equation took 5373 ms to find 0 implicit places.
[2023-03-20 02:06:59] [INFO ] Invariant cache hit.
[2023-03-20 02:07:04] [INFO ] Dead Transitions using invariants and state equation in 5125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6104/6107 places, 5604/5607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12282 ms. Remains : 6104/6107 places, 5604/5607 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), true, p2, (OR (AND p1 p2) (AND p0 p2)), p0, (AND p0 p2)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s5153 0) (EQ s3596 1)), p2:(OR (EQ s1483 0) (EQ s979 1)), p0:(EQ s1884 1), p1:(EQ s5854 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-05 finished in 12690 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 U (p1||G(!p0))))))'
Support contains 6 out of 6107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6106 transition count 4907
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 5407 transition count 4907
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 1398 place count 5407 transition count 4410
Deduced a syphon composed of 497 places in 25 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 2392 place count 4910 transition count 4410
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2397 place count 4905 transition count 4405
Iterating global reduction 2 with 5 rules applied. Total rules applied 2402 place count 4905 transition count 4405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2402 place count 4905 transition count 4402
Deduced a syphon composed of 3 places in 25 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2408 place count 4902 transition count 4402
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 7 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5992 place count 3110 transition count 2610
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5994 place count 3108 transition count 2608
Applied a total of 5994 rules in 2117 ms. Remains 3108 /6107 variables (removed 2999) and now considering 2608/5607 (removed 2999) transitions.
// Phase 1: matrix 2608 rows 3108 cols
[2023-03-20 02:07:07] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-20 02:07:09] [INFO ] Implicit Places using invariants in 2394 ms returned []
[2023-03-20 02:07:09] [INFO ] Invariant cache hit.
[2023-03-20 02:07:11] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 4021 ms to find 0 implicit places.
[2023-03-20 02:07:11] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-20 02:07:11] [INFO ] Invariant cache hit.
[2023-03-20 02:07:13] [INFO ] Dead Transitions using invariants and state equation in 1822 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3108/6107 places, 2608/5607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8046 ms. Remains : 3108/6107 places, 2608/5607 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (EQ s2180 0) (EQ s1178 1))) (NOT (OR (EQ s2703 0) (EQ s2205 1))) (OR (EQ s2047 0) (EQ s1038 1))), p0:(OR (EQ s2703 0) (EQ s2205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19164 steps with 6 reset in 335 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-08 finished in 8493 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 3 out of 6107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6106 transition count 4907
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 5407 transition count 4906
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 5406 transition count 4906
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1400 place count 5406 transition count 4405
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2402 place count 4905 transition count 4405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2406 place count 4901 transition count 4401
Iterating global reduction 3 with 4 rules applied. Total rules applied 2410 place count 4901 transition count 4401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2410 place count 4901 transition count 4399
Deduced a syphon composed of 2 places in 25 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2414 place count 4899 transition count 4399
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 8 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 3 with 3588 rules applied. Total rules applied 6002 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6004 place count 3103 transition count 2603
Applied a total of 6004 rules in 2041 ms. Remains 3103 /6107 variables (removed 3004) and now considering 2603/5607 (removed 3004) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:07:15] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-20 02:07:17] [INFO ] Implicit Places using invariants in 2224 ms returned []
[2023-03-20 02:07:17] [INFO ] Invariant cache hit.
[2023-03-20 02:07:22] [INFO ] Implicit Places using invariants and state equation in 4739 ms returned []
Implicit Place search using SMT with State Equation took 6967 ms to find 0 implicit places.
[2023-03-20 02:07:22] [INFO ] Redundant transitions in 100 ms returned []
[2023-03-20 02:07:22] [INFO ] Invariant cache hit.
[2023-03-20 02:07:24] [INFO ] Dead Transitions using invariants and state equation in 2060 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/6107 places, 2603/5607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11174 ms. Remains : 3103/6107 places, 2603/5607 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s693 1) (OR (EQ s2235 0) (EQ s2714 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6772 steps with 0 reset in 150 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-11 finished in 11379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))&&p0)))'
Support contains 8 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6102 transition count 5602
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6102 transition count 5602
Applied a total of 10 rules in 1856 ms. Remains 6102 /6107 variables (removed 5) and now considering 5602/5607 (removed 5) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:07:26] [INFO ] Computed 1101 place invariants in 24 ms
[2023-03-20 02:07:29] [INFO ] Implicit Places using invariants in 2891 ms returned []
[2023-03-20 02:07:29] [INFO ] Invariant cache hit.
[2023-03-20 02:07:32] [INFO ] Implicit Places using invariants and state equation in 2653 ms returned []
Implicit Place search using SMT with State Equation took 5564 ms to find 0 implicit places.
[2023-03-20 02:07:32] [INFO ] Invariant cache hit.
[2023-03-20 02:07:37] [INFO ] Dead Transitions using invariants and state equation in 4831 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6107 places, 5602/5607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12256 ms. Remains : 6102/6107 places, 5602/5607 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s2844 0) (EQ s2599 1) (OR (AND (EQ s3342 0) (EQ s5626 1)) (AND (EQ s2334 0) (EQ s677 1)))), p1:(AND (EQ s1752 0) (EQ s2775 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-14 finished in 12528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 3 out of 6107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6106 transition count 4905
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5405 transition count 4904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5404 transition count 4904
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1404 place count 5404 transition count 4404
Deduced a syphon composed of 500 places in 22 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2404 place count 4904 transition count 4404
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2408 place count 4900 transition count 4400
Iterating global reduction 3 with 4 rules applied. Total rules applied 2412 place count 4900 transition count 4400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2412 place count 4900 transition count 4398
Deduced a syphon composed of 2 places in 24 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2416 place count 4898 transition count 4398
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 8 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 3 with 3590 rules applied. Total rules applied 6006 place count 3103 transition count 2603
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6008 place count 3101 transition count 2601
Applied a total of 6008 rules in 2066 ms. Remains 3101 /6107 variables (removed 3006) and now considering 2601/5607 (removed 3006) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:07:39] [INFO ] Computed 1101 place invariants in 14 ms
[2023-03-20 02:07:41] [INFO ] Implicit Places using invariants in 2448 ms returned []
[2023-03-20 02:07:41] [INFO ] Invariant cache hit.
[2023-03-20 02:07:47] [INFO ] Implicit Places using invariants and state equation in 5305 ms returned []
Implicit Place search using SMT with State Equation took 7762 ms to find 0 implicit places.
[2023-03-20 02:07:47] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-20 02:07:47] [INFO ] Invariant cache hit.
[2023-03-20 02:07:49] [INFO ] Dead Transitions using invariants and state equation in 1951 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/6107 places, 2601/5607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11875 ms. Remains : 3101/6107 places, 2601/5607 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s1674 1), p0:(OR (EQ s1532 0) (EQ s2354 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 31062 steps with 8 reset in 523 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-15 finished in 12553 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(F(!(X(p0) U X(p1)))))&&X(F(X(X(p0))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLCardinality-01
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Support contains 4 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6106 transition count 4905
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5405 transition count 4904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5404 transition count 4904
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1404 place count 5404 transition count 4405
Deduced a syphon composed of 499 places in 26 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2402 place count 4905 transition count 4405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2406 place count 4901 transition count 4401
Iterating global reduction 3 with 4 rules applied. Total rules applied 2410 place count 4901 transition count 4401
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2410 place count 4901 transition count 4398
Deduced a syphon composed of 3 places in 20 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2416 place count 4898 transition count 4398
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 6 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 3 with 3584 rules applied. Total rules applied 6000 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6002 place count 3104 transition count 2604
Applied a total of 6002 rules in 1853 ms. Remains 3104 /6107 variables (removed 3003) and now considering 2604/5607 (removed 3003) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-20 02:07:52] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-20 02:07:54] [INFO ] Implicit Places using invariants in 2224 ms returned []
[2023-03-20 02:07:54] [INFO ] Invariant cache hit.
[2023-03-20 02:07:59] [INFO ] Implicit Places using invariants and state equation in 4675 ms returned []
Implicit Place search using SMT with State Equation took 6929 ms to find 0 implicit places.
[2023-03-20 02:07:59] [INFO ] Invariant cache hit.
[2023-03-20 02:08:01] [INFO ] Dead Transitions using invariants and state equation in 2046 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3104/6107 places, 2604/5607 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10829 ms. Remains : 3104/6107 places, 2604/5607 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s2312 0) (EQ s2033 1)), p0:(OR (EQ s2432 0) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 64 reset in 1530 ms.
Product exploration explored 100000 steps with 64 reset in 2053 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 466 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Finished random walk after 1680 steps, including 0 resets, run visited all 3 properties in 121 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 491 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 515 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-20 02:08:07] [INFO ] Invariant cache hit.
[2023-03-20 02:08:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 1527 ms returned sat
[2023-03-20 02:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:08:22] [INFO ] [Real]Absence check using state equation in 9636 ms returned unknown
Could not prove EG p1
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 178 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-20 02:08:22] [INFO ] Invariant cache hit.
[2023-03-20 02:08:24] [INFO ] Implicit Places using invariants in 2152 ms returned []
[2023-03-20 02:08:24] [INFO ] Invariant cache hit.
[2023-03-20 02:08:29] [INFO ] Implicit Places using invariants and state equation in 4745 ms returned []
Implicit Place search using SMT with State Equation took 6902 ms to find 0 implicit places.
[2023-03-20 02:08:29] [INFO ] Invariant cache hit.
[2023-03-20 02:08:31] [INFO ] Dead Transitions using invariants and state equation in 2166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9247 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Finished random walk after 4835 steps, including 1 resets, run visited all 3 properties in 118 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 308 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 483 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-20 02:08:33] [INFO ] Invariant cache hit.
[2023-03-20 02:08:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 1602 ms returned sat
[2023-03-20 02:08:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:08:48] [INFO ] [Real]Absence check using state equation in 9754 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering criterion allowed to conclude after 78472 steps with 46 reset in 1288 ms.
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-01 finished in 60011 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-20 02:08:50] [INFO ] Flatten gal took : 196 ms
[2023-03-20 02:08:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 02:08:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6107 places, 5607 transitions and 16014 arcs took 30 ms.
Total runtime 412730 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-100B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/382
LTLCardinality

FORMULA ShieldPPPs-PT-100B-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679278135673

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/382/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/382/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/382/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:409
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:370
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: RELEASE
lola: RELEASE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 3 (type EXCL) for 0 ShieldPPPs-PT-100B-LTLCardinality-01
lola: time limit : 1797 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for ShieldPPPs-PT-100B-LTLCardinality-01
lola: result : false
lola: markings : 12011
lola: fired transitions : 12012
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLCardinality-01: CONJ false LTL model checker


Time elapsed: 5 secs. Pages in use: 1

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPs-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715400523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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