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-167903714900155.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 ShieldIIPs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714900155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 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:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 846K 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 ShieldIIPs-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679268520708

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=ShieldIIPs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:28:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 23:28:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:28:43] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-19 23:28:43] [INFO ] Transformed 3003 places.
[2023-03-19 23:28:43] [INFO ] Transformed 2953 transitions.
[2023-03-19 23:28:43] [INFO ] Found NUPN structural information;
[2023-03-19 23:28:43] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-050B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 3003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Discarding 349 places :
Symmetric choice reduction at 0 with 349 rule applications. Total rules 349 place count 2654 transition count 2604
Iterating global reduction 0 with 349 rules applied. Total rules applied 698 place count 2654 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 699 place count 2653 transition count 2603
Iterating global reduction 0 with 1 rules applied. Total rules applied 700 place count 2653 transition count 2603
Applied a total of 700 rules in 888 ms. Remains 2653 /3003 variables (removed 350) and now considering 2603/2953 (removed 350) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2023-03-19 23:28:44] [INFO ] Computed 451 place invariants in 30 ms
[2023-03-19 23:28:46] [INFO ] Implicit Places using invariants in 1671 ms returned []
[2023-03-19 23:28:46] [INFO ] Invariant cache hit.
[2023-03-19 23:28:50] [INFO ] Implicit Places using invariants and state equation in 3931 ms returned []
Implicit Place search using SMT with State Equation took 5673 ms to find 0 implicit places.
[2023-03-19 23:28:50] [INFO ] Invariant cache hit.
[2023-03-19 23:28:52] [INFO ] Dead Transitions using invariants and state equation in 2394 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/3003 places, 2603/2953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8960 ms. Remains : 2653/3003 places, 2603/2953 transitions.
Support contains 12 out of 2653 places after structural reductions.
[2023-03-19 23:28:53] [INFO ] Flatten gal took : 217 ms
[2023-03-19 23:28:53] [INFO ] Flatten gal took : 140 ms
[2023-03-19 23:28:53] [INFO ] Input system was already deterministic with 2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 23:28:54] [INFO ] Invariant cache hit.
[2023-03-19 23:28:54] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:28:55] [INFO ] [Nat]Absence check using 451 positive place invariants in 212 ms returned sat
[2023-03-19 23:28:57] [INFO ] After 1946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:28:58] [INFO ] Deduced a trap composed of 18 places in 803 ms of which 8 ms to minimize.
[2023-03-19 23:28:59] [INFO ] Deduced a trap composed of 18 places in 937 ms of which 2 ms to minimize.
[2023-03-19 23:29:00] [INFO ] Deduced a trap composed of 25 places in 844 ms of which 13 ms to minimize.
[2023-03-19 23:29:00] [INFO ] Deduced a trap composed of 19 places in 589 ms of which 16 ms to minimize.
[2023-03-19 23:29:01] [INFO ] Deduced a trap composed of 17 places in 685 ms of which 17 ms to minimize.
[2023-03-19 23:29:02] [INFO ] Deduced a trap composed of 15 places in 660 ms of which 1 ms to minimize.
[2023-03-19 23:29:03] [INFO ] Deduced a trap composed of 18 places in 829 ms of which 14 ms to minimize.
[2023-03-19 23:29:04] [INFO ] Deduced a trap composed of 28 places in 957 ms of which 1 ms to minimize.
[2023-03-19 23:29:05] [INFO ] Deduced a trap composed of 23 places in 624 ms of which 1 ms to minimize.
[2023-03-19 23:29:06] [INFO ] Deduced a trap composed of 34 places in 511 ms of which 1 ms to minimize.
[2023-03-19 23:29:06] [INFO ] Deduced a trap composed of 28 places in 602 ms of which 2 ms to minimize.
[2023-03-19 23:29:07] [INFO ] Deduced a trap composed of 22 places in 581 ms of which 2 ms to minimize.
[2023-03-19 23:29:08] [INFO ] Deduced a trap composed of 34 places in 622 ms of which 1 ms to minimize.
[2023-03-19 23:29:08] [INFO ] Deduced a trap composed of 25 places in 689 ms of which 1 ms to minimize.
[2023-03-19 23:29:09] [INFO ] Deduced a trap composed of 31 places in 631 ms of which 1 ms to minimize.
[2023-03-19 23:29:10] [INFO ] Deduced a trap composed of 16 places in 657 ms of which 2 ms to minimize.
[2023-03-19 23:29:11] [INFO ] Deduced a trap composed of 25 places in 578 ms of which 1 ms to minimize.
[2023-03-19 23:29:11] [INFO ] Deduced a trap composed of 32 places in 480 ms of which 2 ms to minimize.
[2023-03-19 23:29:12] [INFO ] Deduced a trap composed of 32 places in 678 ms of which 1 ms to minimize.
[2023-03-19 23:29:13] [INFO ] Deduced a trap composed of 25 places in 506 ms of which 1 ms to minimize.
[2023-03-19 23:29:13] [INFO ] Deduced a trap composed of 39 places in 511 ms of which 1 ms to minimize.
[2023-03-19 23:29:14] [INFO ] Deduced a trap composed of 22 places in 488 ms of which 13 ms to minimize.
[2023-03-19 23:29:14] [INFO ] Deduced a trap composed of 26 places in 557 ms of which 1 ms to minimize.
[2023-03-19 23:29:15] [INFO ] Deduced a trap composed of 25 places in 636 ms of which 1 ms to minimize.
[2023-03-19 23:29:16] [INFO ] Deduced a trap composed of 29 places in 518 ms of which 1 ms to minimize.
[2023-03-19 23:29:16] [INFO ] Deduced a trap composed of 31 places in 476 ms of which 1 ms to minimize.
[2023-03-19 23:29:17] [INFO ] Deduced a trap composed of 28 places in 684 ms of which 1 ms to minimize.
[2023-03-19 23:29:18] [INFO ] Deduced a trap composed of 29 places in 515 ms of which 2 ms to minimize.
[2023-03-19 23:29:19] [INFO ] Deduced a trap composed of 29 places in 613 ms of which 1 ms to minimize.
[2023-03-19 23:29:19] [INFO ] Deduced a trap composed of 35 places in 768 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:29:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:29:20] [INFO ] After 25498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 1 properties in 343 ms.
Support contains 3 out of 2653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2653/2653 places, 2603/2603 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2653 transition count 2353
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2403 transition count 2353
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 500 place count 2403 transition count 2103
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1000 place count 2153 transition count 2103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1001 place count 2152 transition count 2102
Iterating global reduction 2 with 1 rules applied. Total rules applied 1002 place count 2152 transition count 2102
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 5 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 2 with 1796 rules applied. Total rules applied 2798 place count 1254 transition count 1204
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 348 times.
Drop transitions removed 348 transitions
Iterating global reduction 2 with 348 rules applied. Total rules applied 3146 place count 1254 transition count 1204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3147 place count 1253 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3148 place count 1252 transition count 1203
Applied a total of 3148 rules in 641 ms. Remains 1252 /2653 variables (removed 1401) and now considering 1203/2603 (removed 1400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 642 ms. Remains : 1252/2653 places, 1203/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1203 rows 1252 cols
[2023-03-19 23:29:21] [INFO ] Computed 450 place invariants in 75 ms
[2023-03-19 23:29:21] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:29:21] [INFO ] [Nat]Absence check using 449 positive place invariants in 90 ms returned sat
[2023-03-19 23:29:21] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 23:29:22] [INFO ] After 819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:29:22] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2023-03-19 23:29:23] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-03-19 23:29:23] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2023-03-19 23:29:23] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 14 ms to minimize.
[2023-03-19 23:29:23] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-19 23:29:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 870 ms
[2023-03-19 23:29:23] [INFO ] After 1734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-19 23:29:23] [INFO ] After 2165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1203/1203 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1251 transition count 1202
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1202
Applied a total of 4 rules in 133 ms. Remains 1251 /1252 variables (removed 1) and now considering 1202/1203 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 1251/1252 places, 1202/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Finished probabilistic random walk after 190270 steps, run visited all 1 properties in 2668 ms. (steps per millisecond=71 )
Probabilistic random walk after 190270 steps, saw 187146 distinct states, run finished after 2668 ms. (steps per millisecond=71 ) properties seen :1
Computed a total of 599 stabilizing places and 599 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((p0||X((!p1 U p2)))))'
Support contains 3 out of 2653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2653/2653 places, 2603/2603 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2652 transition count 2602
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2652 transition count 2602
Applied a total of 2 rules in 315 ms. Remains 2652 /2653 variables (removed 1) and now considering 2602/2603 (removed 1) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-19 23:29:27] [INFO ] Computed 451 place invariants in 36 ms
[2023-03-19 23:29:28] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2023-03-19 23:29:28] [INFO ] Invariant cache hit.
[2023-03-19 23:29:31] [INFO ] Implicit Places using invariants and state equation in 3101 ms returned []
Implicit Place search using SMT with State Equation took 4402 ms to find 0 implicit places.
[2023-03-19 23:29:31] [INFO ] Invariant cache hit.
[2023-03-19 23:29:34] [INFO ] Dead Transitions using invariants and state equation in 2714 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2653 places, 2602/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7432 ms. Remains : 2652/2653 places, 2602/2603 transitions.
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s630 1), p2:(AND (NOT (OR (EQ s1200 0) (EQ s768 1))) (EQ s630 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 75 reset in 985 ms.
Product exploration explored 100000 steps with 74 reset in 832 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/2652 stabilizing places and 599/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) (NOT p0))]
Finished random walk after 1186 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 4 factoid took 304 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) (NOT p0))]
[2023-03-19 23:29:37] [INFO ] Invariant cache hit.
[2023-03-19 23:29:40] [INFO ] [Real]Absence check using 451 positive place invariants in 721 ms returned sat
[2023-03-19 23:29:40] [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:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:29:52] [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 (AND (NOT p2) (NOT p0))
Could not prove EG (AND (NOT p2) (NOT p0))
Support contains 3 out of 2652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2652/2652 places, 2602/2602 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2651 transition count 2350
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2400 transition count 2350
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2400 transition count 2099
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2149 transition count 2099
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 4 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2790 place count 1256 transition count 1206
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 2792 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2793 place count 1253 transition count 1204
Applied a total of 2793 rules in 480 ms. Remains 1253 /2652 variables (removed 1399) and now considering 1204/2602 (removed 1398) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2023-03-19 23:29:53] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-19 23:29:54] [INFO ] Implicit Places using invariants in 700 ms returned []
[2023-03-19 23:29:54] [INFO ] Invariant cache hit.
[2023-03-19 23:29:55] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 2555 ms to find 0 implicit places.
[2023-03-19 23:29:56] [INFO ] Redundant transitions in 348 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2023-03-19 23:29:56] [INFO ] Computed 450 place invariants in 5 ms
[2023-03-19 23:29:57] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/2652 places, 1203/2602 transitions.
Applied a total of 0 rules in 49 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4415 ms. Remains : 1253/2652 places, 1203/2602 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1253 stabilizing places and 4/1203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 251 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p2) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p2) (NOT p0))]
[2023-03-19 23:29:58] [INFO ] Invariant cache hit.
[2023-03-19 23:29:59] [INFO ] [Real]Absence check using 450 positive place invariants in 249 ms returned sat
[2023-03-19 23:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:30:02] [INFO ] [Real]Absence check using state equation in 2812 ms returned sat
[2023-03-19 23:30:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:30:03] [INFO ] [Nat]Absence check using 450 positive place invariants in 246 ms returned sat
[2023-03-19 23:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:30:06] [INFO ] [Nat]Absence check using state equation in 2565 ms returned sat
[2023-03-19 23:30:06] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-19 23:30:06] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-19 23:30:07] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-03-19 23:30:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 608 ms
[2023-03-19 23:30:07] [INFO ] Computed and/alt/rep : 1196/2997/1196 causal constraints (skipped 4 transitions) in 64 ms.
[2023-03-19 23:30:18] [INFO ] Deduced a trap composed of 2 places in 617 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:30:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p2) (NOT p0))
Could not prove EG (AND (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 22513 reset in 992 ms.
Product exploration explored 100000 steps with 22449 reset in 1261 ms.
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 79 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2023-03-19 23:30:20] [INFO ] Invariant cache hit.
[2023-03-19 23:30:21] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-19 23:30:21] [INFO ] Invariant cache hit.
[2023-03-19 23:30:23] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2489 ms to find 0 implicit places.
[2023-03-19 23:30:23] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-19 23:30:23] [INFO ] Invariant cache hit.
[2023-03-19 23:30:24] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3400 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-00 finished in 57551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2653/2653 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2652 transition count 2352
Reduce places removed 250 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 251 rules applied. Total rules applied 501 place count 2402 transition count 2351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 502 place count 2401 transition count 2351
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 502 place count 2401 transition count 2100
Deduced a syphon composed of 251 places in 4 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1004 place count 2150 transition count 2100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1005 place count 2149 transition count 2099
Iterating global reduction 3 with 1 rules applied. Total rules applied 1006 place count 2149 transition count 2099
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 4 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 2800 place count 1252 transition count 1202
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 2802 place count 1250 transition count 1200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2803 place count 1249 transition count 1200
Applied a total of 2803 rules in 493 ms. Remains 1249 /2653 variables (removed 1404) and now considering 1200/2603 (removed 1403) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2023-03-19 23:30:25] [INFO ] Computed 450 place invariants in 7 ms
[2023-03-19 23:30:25] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-03-19 23:30:25] [INFO ] Invariant cache hit.
[2023-03-19 23:30:27] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2439 ms to find 0 implicit places.
[2023-03-19 23:30:27] [INFO ] Redundant transitions in 252 ms returned [1199]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2023-03-19 23:30:27] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-19 23:30:28] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/2653 places, 1199/2603 transitions.
Applied a total of 0 rules in 37 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3915 ms. Remains : 1249/2653 places, 1199/2603 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s981 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 237 reset in 940 ms.
Product exploration explored 100000 steps with 230 reset in 1099 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 279 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Finished random walk after 530 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 247 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
[2023-03-19 23:30:31] [INFO ] Invariant cache hit.
[2023-03-19 23:30:32] [INFO ] [Real]Absence check using 450 positive place invariants in 296 ms returned sat
[2023-03-19 23:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:30:37] [INFO ] [Real]Absence check using state equation in 4992 ms returned sat
[2023-03-19 23:30:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:30:39] [INFO ] [Nat]Absence check using 450 positive place invariants in 267 ms returned sat
[2023-03-19 23:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:30:41] [INFO ] [Nat]Absence check using state equation in 2493 ms returned sat
[2023-03-19 23:30:41] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 94 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:30:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 49 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2023-03-19 23:30:53] [INFO ] Invariant cache hit.
[2023-03-19 23:30:54] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2023-03-19 23:30:54] [INFO ] Invariant cache hit.
[2023-03-19 23:30:56] [INFO ] Implicit Places using invariants and state equation in 1887 ms returned []
Implicit Place search using SMT with State Equation took 2966 ms to find 0 implicit places.
[2023-03-19 23:30:56] [INFO ] Redundant transitions in 264 ms returned []
[2023-03-19 23:30:56] [INFO ] Invariant cache hit.
[2023-03-19 23:30:57] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3977 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Finished random walk after 468 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2023-03-19 23:30:57] [INFO ] Invariant cache hit.
[2023-03-19 23:30:59] [INFO ] [Real]Absence check using 450 positive place invariants in 245 ms returned sat
[2023-03-19 23:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:31:03] [INFO ] [Real]Absence check using state equation in 3930 ms returned sat
[2023-03-19 23:31:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:31:05] [INFO ] [Nat]Absence check using 450 positive place invariants in 308 ms returned sat
[2023-03-19 23:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:31:07] [INFO ] [Nat]Absence check using state equation in 2650 ms returned sat
[2023-03-19 23:31:07] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 112 ms.
[2023-03-19 23:31:19] [INFO ] Deduced a trap composed of 2 places in 719 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:31:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 235 reset in 872 ms.
Product exploration explored 100000 steps with 239 reset in 1058 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 30 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2023-03-19 23:31:21] [INFO ] Invariant cache hit.
[2023-03-19 23:31:21] [INFO ] Implicit Places using invariants in 707 ms returned []
[2023-03-19 23:31:21] [INFO ] Invariant cache hit.
[2023-03-19 23:31:23] [INFO ] Implicit Places using invariants and state equation in 2082 ms returned []
Implicit Place search using SMT with State Equation took 2808 ms to find 0 implicit places.
[2023-03-19 23:31:24] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-19 23:31:24] [INFO ] Invariant cache hit.
[2023-03-19 23:31:24] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3738 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-05 finished in 60375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U p1)||X(G(p2)))))'
Support contains 2 out of 2653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2653/2653 places, 2603/2603 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2652 transition count 2602
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2652 transition count 2602
Applied a total of 2 rules in 292 ms. Remains 2652 /2653 variables (removed 1) and now considering 2602/2603 (removed 1) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-19 23:31:25] [INFO ] Computed 451 place invariants in 19 ms
[2023-03-19 23:31:26] [INFO ] Implicit Places using invariants in 1612 ms returned []
[2023-03-19 23:31:26] [INFO ] Invariant cache hit.
[2023-03-19 23:31:30] [INFO ] Implicit Places using invariants and state equation in 3459 ms returned []
Implicit Place search using SMT with State Equation took 5085 ms to find 0 implicit places.
[2023-03-19 23:31:30] [INFO ] Invariant cache hit.
[2023-03-19 23:31:32] [INFO ] Dead Transitions using invariants and state equation in 2043 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2653 places, 2602/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7423 ms. Remains : 2652/2653 places, 2602/2603 transitions.
Stuttering acceptance computed with spot in 414 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s1855 1), p0:(NEQ s514 1), p2:(EQ s1855 0)], 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]]
Product exploration explored 100000 steps with 39862 reset in 1160 ms.
Product exploration explored 100000 steps with 40018 reset in 1112 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1578 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 10) seen :3
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 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 23:31:37] [INFO ] Invariant cache hit.
[2023-03-19 23:31:38] [INFO ] [Real]Absence check using 451 positive place invariants in 243 ms returned sat
[2023-03-19 23:31:40] [INFO ] After 2510ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-19 23:31:41] [INFO ] [Nat]Absence check using 451 positive place invariants in 182 ms returned sat
[2023-03-19 23:31:43] [INFO ] After 1847ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-19 23:31:43] [INFO ] Deduced a trap composed of 29 places in 720 ms of which 2 ms to minimize.
[2023-03-19 23:31:44] [INFO ] Deduced a trap composed of 20 places in 632 ms of which 1 ms to minimize.
[2023-03-19 23:31:45] [INFO ] Deduced a trap composed of 24 places in 778 ms of which 3 ms to minimize.
[2023-03-19 23:31:46] [INFO ] Deduced a trap composed of 19 places in 1024 ms of which 3 ms to minimize.
[2023-03-19 23:31:47] [INFO ] Deduced a trap composed of 13 places in 798 ms of which 2 ms to minimize.
[2023-03-19 23:31:48] [INFO ] Deduced a trap composed of 26 places in 623 ms of which 1 ms to minimize.
[2023-03-19 23:31:49] [INFO ] Deduced a trap composed of 13 places in 755 ms of which 1 ms to minimize.
[2023-03-19 23:31:50] [INFO ] Deduced a trap composed of 18 places in 691 ms of which 1 ms to minimize.
[2023-03-19 23:31:50] [INFO ] Deduced a trap composed of 20 places in 607 ms of which 2 ms to minimize.
[2023-03-19 23:31:51] [INFO ] Deduced a trap composed of 24 places in 643 ms of which 15 ms to minimize.
[2023-03-19 23:31:52] [INFO ] Deduced a trap composed of 19 places in 880 ms of which 4 ms to minimize.
[2023-03-19 23:31:53] [INFO ] Deduced a trap composed of 28 places in 1069 ms of which 1 ms to minimize.
[2023-03-19 23:31:54] [INFO ] Deduced a trap composed of 25 places in 621 ms of which 1 ms to minimize.
[2023-03-19 23:31:55] [INFO ] Deduced a trap composed of 19 places in 713 ms of which 2 ms to minimize.
[2023-03-19 23:31:56] [INFO ] Deduced a trap composed of 25 places in 768 ms of which 10 ms to minimize.
[2023-03-19 23:31:57] [INFO ] Deduced a trap composed of 23 places in 651 ms of which 1 ms to minimize.
[2023-03-19 23:31:57] [INFO ] Deduced a trap composed of 31 places in 696 ms of which 1 ms to minimize.
[2023-03-19 23:31:58] [INFO ] Deduced a trap composed of 33 places in 803 ms of which 2 ms to minimize.
[2023-03-19 23:31:59] [INFO ] Deduced a trap composed of 21 places in 647 ms of which 1 ms to minimize.
[2023-03-19 23:32:00] [INFO ] Deduced a trap composed of 34 places in 734 ms of which 3 ms to minimize.
[2023-03-19 23:32:01] [INFO ] Deduced a trap composed of 23 places in 751 ms of which 1 ms to minimize.
[2023-03-19 23:32:02] [INFO ] Deduced a trap composed of 32 places in 909 ms of which 3 ms to minimize.
[2023-03-19 23:32:03] [INFO ] Deduced a trap composed of 17 places in 751 ms of which 2 ms to minimize.
[2023-03-19 23:32:04] [INFO ] Deduced a trap composed of 26 places in 705 ms of which 2 ms to minimize.
[2023-03-19 23:32:04] [INFO ] Deduced a trap composed of 23 places in 715 ms of which 1 ms to minimize.
[2023-03-19 23:32:05] [INFO ] Deduced a trap composed of 22 places in 714 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-19 23:32:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:32:05] [INFO ] After 25377ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:5
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 366 ms.
Support contains 2 out of 2652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2652/2652 places, 2602/2602 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2652 transition count 2351
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2401 transition count 2351
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 502 place count 2401 transition count 2102
Deduced a syphon composed of 249 places in 7 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 1000 place count 2152 transition count 2102
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 4 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 2798 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 348 times.
Drop transitions removed 348 transitions
Iterating global reduction 2 with 348 rules applied. Total rules applied 3146 place count 1253 transition count 1203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3147 place count 1252 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3148 place count 1251 transition count 1202
Applied a total of 3148 rules in 446 ms. Remains 1251 /2652 variables (removed 1401) and now considering 1202/2602 (removed 1400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 1251/2652 places, 1202/2602 transitions.
Finished random walk after 3117 steps, including 0 resets, run visited all 4 properties in 130 ms. (steps per millisecond=23 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 p2)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 1957 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 2 out of 2652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2652/2652 places, 2602/2602 transitions.
Applied a total of 0 rules in 191 ms. Remains 2652 /2652 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-19 23:32:09] [INFO ] Invariant cache hit.
[2023-03-19 23:32:10] [INFO ] Implicit Places using invariants in 1227 ms returned []
[2023-03-19 23:32:10] [INFO ] Invariant cache hit.
[2023-03-19 23:32:14] [INFO ] Implicit Places using invariants and state equation in 3488 ms returned []
Implicit Place search using SMT with State Equation took 4736 ms to find 0 implicit places.
[2023-03-19 23:32:14] [INFO ] Invariant cache hit.
[2023-03-19 23:32:15] [INFO ] Dead Transitions using invariants and state equation in 1630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6572 ms. Remains : 2652/2652 places, 2602/2602 transitions.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) p2))), (X p2), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 726 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 23:32:17] [INFO ] Invariant cache hit.
[2023-03-19 23:32:18] [INFO ] [Real]Absence check using 451 positive place invariants in 354 ms returned sat
[2023-03-19 23:32:20] [INFO ] After 3073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:32:21] [INFO ] [Nat]Absence check using 451 positive place invariants in 194 ms returned sat
[2023-03-19 23:32:22] [INFO ] After 1793ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:32:24] [INFO ] Deduced a trap composed of 13 places in 970 ms of which 11 ms to minimize.
[2023-03-19 23:32:24] [INFO ] Deduced a trap composed of 15 places in 788 ms of which 18 ms to minimize.
[2023-03-19 23:32:26] [INFO ] Deduced a trap composed of 26 places in 934 ms of which 2 ms to minimize.
[2023-03-19 23:32:27] [INFO ] Deduced a trap composed of 31 places in 859 ms of which 3 ms to minimize.
[2023-03-19 23:32:27] [INFO ] Deduced a trap composed of 25 places in 761 ms of which 2 ms to minimize.
[2023-03-19 23:32:28] [INFO ] Deduced a trap composed of 21 places in 838 ms of which 3 ms to minimize.
[2023-03-19 23:32:29] [INFO ] Deduced a trap composed of 28 places in 701 ms of which 1 ms to minimize.
[2023-03-19 23:32:30] [INFO ] Deduced a trap composed of 29 places in 670 ms of which 2 ms to minimize.
[2023-03-19 23:32:31] [INFO ] Deduced a trap composed of 30 places in 641 ms of which 1 ms to minimize.
[2023-03-19 23:32:31] [INFO ] Deduced a trap composed of 34 places in 593 ms of which 2 ms to minimize.
[2023-03-19 23:32:32] [INFO ] Deduced a trap composed of 24 places in 664 ms of which 2 ms to minimize.
[2023-03-19 23:32:33] [INFO ] Deduced a trap composed of 21 places in 639 ms of which 2 ms to minimize.
[2023-03-19 23:32:34] [INFO ] Deduced a trap composed of 29 places in 712 ms of which 2 ms to minimize.
[2023-03-19 23:32:35] [INFO ] Deduced a trap composed of 25 places in 573 ms of which 1 ms to minimize.
[2023-03-19 23:32:35] [INFO ] Deduced a trap composed of 28 places in 634 ms of which 1 ms to minimize.
[2023-03-19 23:32:36] [INFO ] Deduced a trap composed of 26 places in 692 ms of which 3 ms to minimize.
[2023-03-19 23:32:37] [INFO ] Deduced a trap composed of 26 places in 696 ms of which 2 ms to minimize.
[2023-03-19 23:32:38] [INFO ] Deduced a trap composed of 23 places in 1377 ms of which 2 ms to minimize.
[2023-03-19 23:32:39] [INFO ] Deduced a trap composed of 25 places in 693 ms of which 2 ms to minimize.
[2023-03-19 23:32:40] [INFO ] Deduced a trap composed of 20 places in 733 ms of which 1 ms to minimize.
[2023-03-19 23:32:41] [INFO ] Deduced a trap composed of 28 places in 707 ms of which 1 ms to minimize.
[2023-03-19 23:32:42] [INFO ] Deduced a trap composed of 27 places in 711 ms of which 1 ms to minimize.
[2023-03-19 23:32:42] [INFO ] Deduced a trap composed of 28 places in 559 ms of which 1 ms to minimize.
[2023-03-19 23:32:43] [INFO ] Deduced a trap composed of 23 places in 564 ms of which 1 ms to minimize.
[2023-03-19 23:32:44] [INFO ] Deduced a trap composed of 41 places in 774 ms of which 2 ms to minimize.
[2023-03-19 23:32:45] [INFO ] Deduced a trap composed of 23 places in 605 ms of which 1 ms to minimize.
[2023-03-19 23:32:45] [INFO ] Deduced a trap composed of 23 places in 610 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:32:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:32:45] [INFO ] After 25520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 283 ms.
Support contains 2 out of 2652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2652/2652 places, 2602/2602 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2652 transition count 2351
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2401 transition count 2351
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 502 place count 2401 transition count 2102
Deduced a syphon composed of 249 places in 8 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 1000 place count 2152 transition count 2102
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 4 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 2798 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 348 times.
Drop transitions removed 348 transitions
Iterating global reduction 2 with 348 rules applied. Total rules applied 3146 place count 1253 transition count 1203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3147 place count 1252 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3148 place count 1251 transition count 1202
Applied a total of 3148 rules in 430 ms. Remains 1251 /2652 variables (removed 1401) and now considering 1202/2602 (removed 1400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 1251/2652 places, 1202/2602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1251 cols
[2023-03-19 23:32:46] [INFO ] Computed 450 place invariants in 40 ms
[2023-03-19 23:32:46] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:32:47] [INFO ] [Nat]Absence check using 449 positive place invariants in 91 ms returned sat
[2023-03-19 23:32:47] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 23:32:47] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:32:48] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2023-03-19 23:32:48] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2023-03-19 23:32:48] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-19 23:32:48] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 0 ms to minimize.
[2023-03-19 23:32:49] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-19 23:32:49] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2023-03-19 23:32:49] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-19 23:32:49] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 0 ms to minimize.
[2023-03-19 23:32:49] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2023-03-19 23:32:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2137 ms
[2023-03-19 23:32:50] [INFO ] After 2774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-19 23:32:50] [INFO ] After 3184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 46 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1251/1251 places, 1202/1202 transitions.
Finished random walk after 5547 steps, including 1 resets, run visited all 1 properties in 60 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) p2))), (X p2), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 15 factoid took 1086 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 232 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Entered a terminal (fully accepting) state of product in 4633 steps with 0 reset in 48 ms.
FORMULA ShieldIIPs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-08 finished in 87262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U G(p1))))'
Support contains 4 out of 2653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2653/2653 places, 2603/2603 transitions.
Applied a total of 0 rules in 203 ms. Remains 2653 /2653 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2023-03-19 23:32:52] [INFO ] Computed 451 place invariants in 20 ms
[2023-03-19 23:32:53] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2023-03-19 23:32:53] [INFO ] Invariant cache hit.
[2023-03-19 23:32:57] [INFO ] Implicit Places using invariants and state equation in 3244 ms returned []
Implicit Place search using SMT with State Equation took 4608 ms to find 0 implicit places.
[2023-03-19 23:32:57] [INFO ] Invariant cache hit.
[2023-03-19 23:32:59] [INFO ] Dead Transitions using invariants and state equation in 2242 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7055 ms. Remains : 2653/2653 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1161 0) (EQ s1913 1)), p0:(OR (EQ s121 0) (EQ s1507 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12505 steps with 1 reset in 171 ms.
FORMULA ShieldIIPs-PT-050B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-10 finished in 7456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2653/2653 places, 2603/2603 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2652 transition count 2602
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2652 transition count 2602
Applied a total of 2 rules in 319 ms. Remains 2652 /2653 variables (removed 1) and now considering 2602/2603 (removed 1) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-19 23:33:00] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-19 23:33:01] [INFO ] Implicit Places using invariants in 1469 ms returned []
[2023-03-19 23:33:01] [INFO ] Invariant cache hit.
[2023-03-19 23:33:04] [INFO ] Implicit Places using invariants and state equation in 3138 ms returned []
Implicit Place search using SMT with State Equation took 4628 ms to find 0 implicit places.
[2023-03-19 23:33:04] [INFO ] Invariant cache hit.
[2023-03-19 23:33:07] [INFO ] Dead Transitions using invariants and state equation in 2777 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2653 places, 2602/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7729 ms. Remains : 2652/2653 places, 2602/2603 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s919 0) (EQ s2149 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1324 ms.
Product exploration explored 100000 steps with 50000 reset in 1224 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-050B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-12 finished in 10549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((!p1 U p2)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-050B-LTLCardinality-00
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2653 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2653/2653 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2652 transition count 2351
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2401 transition count 2351
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2401 transition count 2100
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2150 transition count 2100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1005 place count 2149 transition count 2099
Iterating global reduction 2 with 1 rules applied. Total rules applied 1006 place count 2149 transition count 2099
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 4 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2792 place count 1256 transition count 1206
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 2794 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 1253 transition count 1204
Applied a total of 2795 rules in 514 ms. Remains 1253 /2653 variables (removed 1400) and now considering 1204/2603 (removed 1399) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2023-03-19 23:33:11] [INFO ] Computed 450 place invariants in 6 ms
[2023-03-19 23:33:12] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2023-03-19 23:33:12] [INFO ] Invariant cache hit.
[2023-03-19 23:33:14] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2972 ms to find 0 implicit places.
[2023-03-19 23:33:14] [INFO ] Invariant cache hit.
[2023-03-19 23:33:14] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1253/2653 places, 1204/2603 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4279 ms. Remains : 1253/2653 places, 1204/2603 transitions.
Running random walk in product with property : ShieldIIPs-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s278 1), p2:(AND (NOT (OR (EQ s555 0) (EQ s348 1))) (EQ s278 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22738 reset in 997 ms.
Product exploration explored 100000 steps with 22606 reset in 1164 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1253 stabilizing places and 4/1204 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 272 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p2) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 2 factoid took 351 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) (NOT p0))]
[2023-03-19 23:33:17] [INFO ] Invariant cache hit.
[2023-03-19 23:33:19] [INFO ] [Real]Absence check using 450 positive place invariants in 319 ms returned sat
[2023-03-19 23:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:33:21] [INFO ] [Real]Absence check using state equation in 2690 ms returned sat
[2023-03-19 23:33:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:33:23] [INFO ] [Nat]Absence check using 450 positive place invariants in 247 ms returned sat
[2023-03-19 23:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:33:27] [INFO ] [Nat]Absence check using state equation in 4540 ms returned sat
[2023-03-19 23:33:28] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-03-19 23:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-19 23:33:28] [INFO ] Computed and/alt/rep : 1197/3002/1197 causal constraints (skipped 4 transitions) in 119 ms.
[2023-03-19 23:33:37] [INFO ] Deduced a trap composed of 2 places in 799 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:33:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p2) (NOT p0))
Could not prove EG (AND (NOT p2) (NOT p0))
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1204/1204 transitions.
Applied a total of 0 rules in 60 ms. Remains 1253 /1253 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
[2023-03-19 23:33:38] [INFO ] Invariant cache hit.
[2023-03-19 23:33:38] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-19 23:33:38] [INFO ] Invariant cache hit.
[2023-03-19 23:33:40] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 2725 ms to find 0 implicit places.
[2023-03-19 23:33:40] [INFO ] Redundant transitions in 166 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2023-03-19 23:33:40] [INFO ] Computed 450 place invariants in 4 ms
[2023-03-19 23:33:41] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 1203/1204 transitions.
Applied a total of 0 rules in 30 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3700 ms. Remains : 1253/1253 places, 1203/1204 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1253 stabilizing places and 4/1203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p2) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 2 factoid took 361 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p2) (NOT p0))]
[2023-03-19 23:33:42] [INFO ] Invariant cache hit.
[2023-03-19 23:33:43] [INFO ] [Real]Absence check using 450 positive place invariants in 269 ms returned sat
[2023-03-19 23:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:33:47] [INFO ] [Real]Absence check using state equation in 3091 ms returned sat
[2023-03-19 23:33:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:33:48] [INFO ] [Nat]Absence check using 450 positive place invariants in 243 ms returned sat
[2023-03-19 23:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:33:51] [INFO ] [Nat]Absence check using state equation in 2699 ms returned sat
[2023-03-19 23:33:51] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-19 23:33:51] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2023-03-19 23:33:51] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-03-19 23:33:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 566 ms
[2023-03-19 23:33:51] [INFO ] Computed and/alt/rep : 1196/2997/1196 causal constraints (skipped 4 transitions) in 99 ms.
[2023-03-19 23:34:02] [INFO ] Added : 375 causal constraints over 75 iterations in 10513 ms. Result :unknown
Could not prove EG (AND (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 22697 reset in 1018 ms.
Product exploration explored 100000 steps with 22809 reset in 1191 ms.
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 30 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2023-03-19 23:34:04] [INFO ] Invariant cache hit.
[2023-03-19 23:34:05] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-19 23:34:05] [INFO ] Invariant cache hit.
[2023-03-19 23:34:06] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2023-03-19 23:34:06] [INFO ] Redundant transitions in 176 ms returned []
[2023-03-19 23:34:06] [INFO ] Invariant cache hit.
[2023-03-19 23:34:07] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3027 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-00 finished in 57296 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)))'
[2023-03-19 23:34:07] [INFO ] Flatten gal took : 93 ms
[2023-03-19 23:34:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 23:34:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2653 places, 2603 transitions and 8206 arcs took 16 ms.
Total runtime 324733 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-050B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

BK_STOP 1679269079131

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1799 7/32 ShieldIIPs-PT-050B-LTLCardinality-05 518853 m, 103770 m/sec, 708962 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/1799 13/32 ShieldIIPs-PT-050B-LTLCardinality-05 1041470 m, 104523 m/sec, 1480778 t fired, .

Time elapsed: 10 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/1799 20/32 ShieldIIPs-PT-050B-LTLCardinality-05 1565061 m, 104718 m/sec, 2225862 t fired, .

Time elapsed: 15 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/1799 26/32 ShieldIIPs-PT-050B-LTLCardinality-05 2085259 m, 104039 m/sec, 3011812 t fired, .

Time elapsed: 20 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for ShieldIIPs-PT-050B-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPs-PT-050B-LTLCardinality-00
lola: time limit : 3575 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3575 2/32 ShieldIIPs-PT-050B-LTLCardinality-00 105434 m, 21086 m/sec, 361028 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3575 3/32 ShieldIIPs-PT-050B-LTLCardinality-00 208342 m, 20581 m/sec, 721989 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3575 4/32 ShieldIIPs-PT-050B-LTLCardinality-00 304265 m, 19184 m/sec, 1083671 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3575 5/32 ShieldIIPs-PT-050B-LTLCardinality-00 402616 m, 19670 m/sec, 1445055 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3575 6/32 ShieldIIPs-PT-050B-LTLCardinality-00 499673 m, 19411 m/sec, 1807247 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3575 7/32 ShieldIIPs-PT-050B-LTLCardinality-00 591715 m, 18408 m/sec, 2170008 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3575 8/32 ShieldIIPs-PT-050B-LTLCardinality-00 685066 m, 18670 m/sec, 2531376 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3575 9/32 ShieldIIPs-PT-050B-LTLCardinality-00 773679 m, 17722 m/sec, 2892800 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3575 10/32 ShieldIIPs-PT-050B-LTLCardinality-00 868229 m, 18910 m/sec, 3253164 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3575 11/32 ShieldIIPs-PT-050B-LTLCardinality-00 956250 m, 17604 m/sec, 3612834 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3575 12/32 ShieldIIPs-PT-050B-LTLCardinality-00 1043790 m, 17508 m/sec, 3972311 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3575 13/32 ShieldIIPs-PT-050B-LTLCardinality-00 1133019 m, 17845 m/sec, 4331781 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3575 13/32 ShieldIIPs-PT-050B-LTLCardinality-00 1216809 m, 16758 m/sec, 4688654 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3575 14/32 ShieldIIPs-PT-050B-LTLCardinality-00 1320818 m, 20801 m/sec, 5046500 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3575 15/32 ShieldIIPs-PT-050B-LTLCardinality-00 1416073 m, 19051 m/sec, 5403782 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3575 16/32 ShieldIIPs-PT-050B-LTLCardinality-00 1505215 m, 17828 m/sec, 5761186 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3575 16/32 ShieldIIPs-PT-050B-LTLCardinality-00 1589256 m, 16808 m/sec, 6119583 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3575 17/32 ShieldIIPs-PT-050B-LTLCardinality-00 1676677 m, 17484 m/sec, 6476534 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 96/3575 17/32 ShieldIIPs-PT-050B-LTLCardinality-00 1763583 m, 17381 m/sec, 6833933 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 101/3575 18/32 ShieldIIPs-PT-050B-LTLCardinality-00 1848397 m, 16962 m/sec, 7189622 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 106/3575 19/32 ShieldIIPs-PT-050B-LTLCardinality-00 1947174 m, 19755 m/sec, 7542890 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 111/3575 20/32 ShieldIIPs-PT-050B-LTLCardinality-00 2036853 m, 17935 m/sec, 7895530 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 116/3575 20/32 ShieldIIPs-PT-050B-LTLCardinality-00 2114631 m, 15555 m/sec, 8251414 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 121/3575 21/32 ShieldIIPs-PT-050B-LTLCardinality-00 2188142 m, 14702 m/sec, 8604208 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 126/3575 21/32 ShieldIIPs-PT-050B-LTLCardinality-00 2270457 m, 16463 m/sec, 8956596 t fired, .

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 131/3575 22/32 ShieldIIPs-PT-050B-LTLCardinality-00 2353072 m, 16523 m/sec, 9308061 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 136/3575 22/32 ShieldIIPs-PT-050B-LTLCardinality-00 2423070 m, 13999 m/sec, 9662450 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 141/3575 23/32 ShieldIIPs-PT-050B-LTLCardinality-00 2512760 m, 17938 m/sec, 10020056 t fired, .

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 146/3575 23/32 ShieldIIPs-PT-050B-LTLCardinality-00 2596508 m, 16749 m/sec, 10376751 t fired, .

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 151/3575 24/32 ShieldIIPs-PT-050B-LTLCardinality-00 2677423 m, 16183 m/sec, 10734288 t fired, .

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 156/3575 25/32 ShieldIIPs-PT-050B-LTLCardinality-00 2755568 m, 15629 m/sec, 11091320 t fired, .

Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 161/3575 25/32 ShieldIIPs-PT-050B-LTLCardinality-00 2827322 m, 14350 m/sec, 11448202 t fired, .

Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 166/3575 26/32 ShieldIIPs-PT-050B-LTLCardinality-00 2907336 m, 16002 m/sec, 11801547 t fired, .

Time elapsed: 191 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 171/3575 26/32 ShieldIIPs-PT-050B-LTLCardinality-00 2982288 m, 14990 m/sec, 12156860 t fired, .

Time elapsed: 196 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 176/3575 27/32 ShieldIIPs-PT-050B-LTLCardinality-00 3074016 m, 18345 m/sec, 12511751 t fired, .

Time elapsed: 201 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 181/3575 29/32 ShieldIIPs-PT-050B-LTLCardinality-00 3197241 m, 24645 m/sec, 12870543 t fired, .

Time elapsed: 206 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 186/3575 30/32 ShieldIIPs-PT-050B-LTLCardinality-00 3302517 m, 21055 m/sec, 13210199 t fired, .

Time elapsed: 211 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 191/3575 31/32 ShieldIIPs-PT-050B-LTLCardinality-00 3388317 m, 17160 m/sec, 13547632 t fired, .

Time elapsed: 216 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 196/3575 31/32 ShieldIIPs-PT-050B-LTLCardinality-00 3471701 m, 16676 m/sec, 13884473 t fired, .

Time elapsed: 221 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 201/3575 32/32 ShieldIIPs-PT-050B-LTLCardinality-00 3554501 m, 16560 m/sec, 14220688 t fired, .

Time elapsed: 226 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for ShieldIIPs-PT-050B-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-050B-LTLCardinality-00: LTL unknown AGGR
ShieldIIPs-PT-050B-LTLCardinality-05: LTL unknown AGGR


Time elapsed: 231 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-050B"
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 ShieldIIPs-PT-050B, 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-167903714900155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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