Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716700155.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700155
=====================================================================

--------------------
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 1679428582594

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:56:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 19:56:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:56:25] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-21 19:56:25] [INFO ] Transformed 3003 places.
[2023-03-21 19:56:25] [INFO ] Transformed 2953 transitions.
[2023-03-21 19:56:25] [INFO ] Found NUPN structural information;
[2023-03-21 19:56:25] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 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 921 ms. Remains 2653 /3003 variables (removed 350) and now considering 2603/2953 (removed 350) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2023-03-21 19:56:27] [INFO ] Computed 451 place invariants in 47 ms
[2023-03-21 19:56:29] [INFO ] Implicit Places using invariants in 2649 ms returned []
[2023-03-21 19:56:29] [INFO ] Invariant cache hit.
[2023-03-21 19:56:30] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 3885 ms to find 0 implicit places.
[2023-03-21 19:56:31] [INFO ] Invariant cache hit.
[2023-03-21 19:56:35] [INFO ] Dead Transitions using invariants and state equation in 4011 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 8822 ms. Remains : 2653/3003 places, 2603/2953 transitions.
Support contains 12 out of 2653 places after structural reductions.
[2023-03-21 19:56:35] [INFO ] Flatten gal took : 220 ms
[2023-03-21 19:56:35] [INFO ] Flatten gal took : 145 ms
[2023-03-21 19:56:35] [INFO ] Input system was already deterministic with 2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 19:56:36] [INFO ] Invariant cache hit.
[2023-03-21 19:56:37] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:56:38] [INFO ] [Nat]Absence check using 451 positive place invariants in 325 ms returned sat
[2023-03-21 19:56:41] [INFO ] After 2816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:56:43] [INFO ] Deduced a trap composed of 35 places in 1619 ms of which 20 ms to minimize.
[2023-03-21 19:56:45] [INFO ] Deduced a trap composed of 22 places in 2387 ms of which 20 ms to minimize.
[2023-03-21 19:56:46] [INFO ] Deduced a trap composed of 13 places in 871 ms of which 2 ms to minimize.
[2023-03-21 19:56:47] [INFO ] Deduced a trap composed of 20 places in 778 ms of which 2 ms to minimize.
[2023-03-21 19:56:48] [INFO ] Deduced a trap composed of 15 places in 1132 ms of which 3 ms to minimize.
[2023-03-21 19:56:49] [INFO ] Deduced a trap composed of 34 places in 964 ms of which 2 ms to minimize.
[2023-03-21 19:56:50] [INFO ] Deduced a trap composed of 35 places in 899 ms of which 17 ms to minimize.
[2023-03-21 19:56:51] [INFO ] Deduced a trap composed of 35 places in 882 ms of which 2 ms to minimize.
[2023-03-21 19:56:53] [INFO ] Deduced a trap composed of 18 places in 1126 ms of which 1 ms to minimize.
[2023-03-21 19:56:55] [INFO ] Deduced a trap composed of 45 places in 1776 ms of which 2 ms to minimize.
[2023-03-21 19:56:58] [INFO ] Deduced a trap composed of 18 places in 3516 ms of which 1 ms to minimize.
[2023-03-21 19:57:00] [INFO ] Deduced a trap composed of 31 places in 1451 ms of which 2 ms to minimize.
[2023-03-21 19:57:03] [INFO ] Deduced a trap composed of 22 places in 2576 ms of which 27 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-21 19:57:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:57:03] [INFO ] After 25516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 1 properties in 457 ms.
Support contains 5 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 6 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
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 2 with 1794 rules applied. Total rules applied 2794 place count 1256 transition count 1206
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 3142 place count 1256 transition count 1206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3143 place count 1255 transition count 1205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3144 place count 1254 transition count 1205
Applied a total of 3144 rules in 985 ms. Remains 1254 /2653 variables (removed 1399) and now considering 1205/2603 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 997 ms. Remains : 1254/2653 places, 1205/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1205 rows 1254 cols
[2023-03-21 19:57:04] [INFO ] Computed 450 place invariants in 71 ms
[2023-03-21 19:57:05] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:57:05] [INFO ] [Nat]Absence check using 449 positive place invariants in 333 ms returned sat
[2023-03-21 19:57:05] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 26 ms returned sat
[2023-03-21 19:57:09] [INFO ] After 3263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:57:09] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2023-03-21 19:57:09] [INFO ] Deduced a trap composed of 8 places in 346 ms of which 0 ms to minimize.
[2023-03-21 19:57:09] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 0 ms to minimize.
[2023-03-21 19:57:10] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2023-03-21 19:57:10] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2023-03-21 19:57:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1266 ms
[2023-03-21 19:57:10] [INFO ] After 4604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-21 19:57:10] [INFO ] After 5410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 1254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1254/1254 places, 1205/1205 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 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 8 place count 1251 transition count 1202
Applied a total of 8 rules in 155 ms. Remains 1251 /1254 variables (removed 3) and now considering 1202/1205 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 1251/1254 places, 1202/1205 transitions.
Finished random walk after 6574 steps, including 1 resets, run visited all 1 properties in 75 ms. (steps per millisecond=87 )
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 418 ms. Remains 2652 /2653 variables (removed 1) and now considering 2602/2603 (removed 1) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-21 19:57:11] [INFO ] Computed 451 place invariants in 11 ms
[2023-03-21 19:57:13] [INFO ] Implicit Places using invariants in 1512 ms returned []
[2023-03-21 19:57:13] [INFO ] Invariant cache hit.
[2023-03-21 19:57:18] [INFO ] Implicit Places using invariants and state equation in 5123 ms returned []
Implicit Place search using SMT with State Equation took 6662 ms to find 0 implicit places.
[2023-03-21 19:57:18] [INFO ] Invariant cache hit.
[2023-03-21 19:57:21] [INFO ] Dead Transitions using invariants and state equation in 2827 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 9926 ms. Remains : 2652/2653 places, 2602/2603 transitions.
Stuttering acceptance computed with spot in 435 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 993 ms.
Product exploration explored 100000 steps with 75 reset in 1115 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 329 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 86 ms :[(AND (NOT p2) (NOT p0))]
Finished random walk after 1663 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=79 )
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 311 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0))]
[2023-03-21 19:57:25] [INFO ] Invariant cache hit.
[2023-03-21 19:57:29] [INFO ] [Real]Absence check using 451 positive place invariants in 1620 ms returned sat
[2023-03-21 19:57:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:57:40] [INFO ] [Real]Absence check using state equation in 10526 ms returned unknown
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 652 ms. Remains 1253 /2652 variables (removed 1399) and now considering 1204/2602 (removed 1398) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2023-03-21 19:57:40] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-21 19:57:45] [INFO ] Implicit Places using invariants in 4629 ms returned []
[2023-03-21 19:57:45] [INFO ] Invariant cache hit.
[2023-03-21 19:57:47] [INFO ] Implicit Places using invariants and state equation in 2590 ms returned []
Implicit Place search using SMT with State Equation took 7236 ms to find 0 implicit places.
[2023-03-21 19:57:48] [INFO ] Redundant transitions in 394 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-21 19:57:48] [INFO ] Computed 450 place invariants in 4 ms
[2023-03-21 19:57:49] [INFO ] Dead Transitions using invariants and state equation in 1215 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 78 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 9598 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 220 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 53 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 256 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 82 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p0))]
[2023-03-21 19:57:50] [INFO ] Invariant cache hit.
[2023-03-21 19:57:52] [INFO ] [Real]Absence check using 450 positive place invariants in 464 ms returned sat
[2023-03-21 19:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:57:55] [INFO ] [Real]Absence check using state equation in 3634 ms returned sat
[2023-03-21 19:57:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:57:57] [INFO ] [Nat]Absence check using 450 positive place invariants in 235 ms returned sat
[2023-03-21 19:57:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:58:01] [INFO ] [Nat]Absence check using state equation in 3530 ms returned sat
[2023-03-21 19:58:01] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 1 ms to minimize.
[2023-03-21 19:58:02] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 0 ms to minimize.
[2023-03-21 19:58:02] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 4 ms to minimize.
[2023-03-21 19:58:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1265 ms
[2023-03-21 19:58:02] [INFO ] Computed and/alt/rep : 1196/2997/1196 causal constraints (skipped 4 transitions) in 146 ms.
[2023-03-21 19:58:11] [INFO ] Deduced a trap composed of 2 places in 952 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-21 19:58:11] [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 72 ms :[(AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 22594 reset in 1184 ms.
Product exploration explored 100000 steps with 22438 reset in 1305 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 35 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2023-03-21 19:58:14] [INFO ] Invariant cache hit.
[2023-03-21 19:58:15] [INFO ] Implicit Places using invariants in 909 ms returned []
[2023-03-21 19:58:15] [INFO ] Invariant cache hit.
[2023-03-21 19:58:17] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2821 ms to find 0 implicit places.
[2023-03-21 19:58:17] [INFO ] Redundant transitions in 154 ms returned []
[2023-03-21 19:58:17] [INFO ] Invariant cache hit.
[2023-03-21 19:58:18] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3796 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-00 finished in 67407 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 6 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 5 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 1107 ms. Remains 1249 /2653 variables (removed 1404) and now considering 1200/2603 (removed 1403) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2023-03-21 19:58:19] [INFO ] Computed 450 place invariants in 2 ms
[2023-03-21 19:58:20] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-21 19:58:20] [INFO ] Invariant cache hit.
[2023-03-21 19:58:21] [INFO ] Implicit Places using invariants and state equation in 1753 ms returned []
Implicit Place search using SMT with State Equation took 2329 ms to find 0 implicit places.
[2023-03-21 19:58:22] [INFO ] Redundant transitions in 209 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-21 19:58:22] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-21 19:58:22] [INFO ] Dead Transitions using invariants and state equation in 612 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 33 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 4298 ms. Remains : 1249/2653 places, 1199/2603 transitions.
Stuttering acceptance computed with spot in 64 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 235 reset in 849 ms.
Product exploration explored 100000 steps with 231 reset in 1012 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 181 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 118 ms :[(NOT p0), (NOT p0)]
Finished random walk after 365 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=52 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 284 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 136 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
[2023-03-21 19:58:25] [INFO ] Invariant cache hit.
[2023-03-21 19:58:27] [INFO ] [Real]Absence check using 450 positive place invariants in 255 ms returned sat
[2023-03-21 19:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:58:31] [INFO ] [Real]Absence check using state equation in 4271 ms returned sat
[2023-03-21 19:58:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:58:32] [INFO ] [Nat]Absence check using 450 positive place invariants in 272 ms returned sat
[2023-03-21 19:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:58:35] [INFO ] [Nat]Absence check using state equation in 3106 ms returned sat
[2023-03-21 19:58:36] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 97 ms.
[2023-03-21 19:58:47] [INFO ] Deduced a trap composed of 2 places in 698 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.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-21 19:58:47] [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 32 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2023-03-21 19:58:47] [INFO ] Invariant cache hit.
[2023-03-21 19:58:48] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-21 19:58:48] [INFO ] Invariant cache hit.
[2023-03-21 19:58:49] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
[2023-03-21 19:58:49] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-21 19:58:49] [INFO ] Invariant cache hit.
[2023-03-21 19:58:50] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3026 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 136 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 116 ms :[(NOT p0), (NOT p0)]
Finished random walk after 498 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=38 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 250 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 125 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
[2023-03-21 19:58:51] [INFO ] Invariant cache hit.
[2023-03-21 19:58:52] [INFO ] [Real]Absence check using 450 positive place invariants in 234 ms returned sat
[2023-03-21 19:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:58:57] [INFO ] [Real]Absence check using state equation in 4691 ms returned sat
[2023-03-21 19:58:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:58:58] [INFO ] [Nat]Absence check using 450 positive place invariants in 242 ms returned sat
[2023-03-21 19:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:59:01] [INFO ] [Nat]Absence check using state equation in 2571 ms returned sat
[2023-03-21 19:59:01] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 118 ms.
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.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: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-21 19:59:12] [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 (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 231 reset in 874 ms.
Product exploration explored 100000 steps with 233 reset in 1049 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-21 19:59:14] [INFO ] Invariant cache hit.
[2023-03-21 19:59:15] [INFO ] Implicit Places using invariants in 678 ms returned []
[2023-03-21 19:59:15] [INFO ] Invariant cache hit.
[2023-03-21 19:59:16] [INFO ] Implicit Places using invariants and state equation in 1642 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
[2023-03-21 19:59:17] [INFO ] Redundant transitions in 208 ms returned []
[2023-03-21 19:59:17] [INFO ] Invariant cache hit.
[2023-03-21 19:59:17] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3255 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-05 finished in 59395 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 334 ms. Remains 2652 /2653 variables (removed 1) and now considering 2602/2603 (removed 1) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-21 19:59:18] [INFO ] Computed 451 place invariants in 19 ms
[2023-03-21 19:59:19] [INFO ] Implicit Places using invariants in 1205 ms returned []
[2023-03-21 19:59:19] [INFO ] Invariant cache hit.
[2023-03-21 19:59:23] [INFO ] Implicit Places using invariants and state equation in 3858 ms returned []
Implicit Place search using SMT with State Equation took 5118 ms to find 0 implicit places.
[2023-03-21 19:59:23] [INFO ] Invariant cache hit.
[2023-03-21 19:59:25] [INFO ] Dead Transitions using invariants and state equation in 2194 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 7649 ms. Remains : 2652/2653 places, 2602/2603 transitions.
Stuttering acceptance computed with spot in 465 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 40079 reset in 1423 ms.
Product exploration explored 100000 steps with 39993 reset in 1477 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 1810 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 467 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 523 ms. (steps per millisecond=19 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 19:59:31] [INFO ] Invariant cache hit.
[2023-03-21 19:59:32] [INFO ] [Real]Absence check using 451 positive place invariants in 176 ms returned sat
[2023-03-21 19:59:34] [INFO ] After 2900ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-21 19:59:36] [INFO ] [Nat]Absence check using 451 positive place invariants in 248 ms returned sat
[2023-03-21 19:59:38] [INFO ] After 1896ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-21 19:59:39] [INFO ] Deduced a trap composed of 29 places in 718 ms of which 1 ms to minimize.
[2023-03-21 19:59:39] [INFO ] Deduced a trap composed of 20 places in 631 ms of which 2 ms to minimize.
[2023-03-21 19:59:41] [INFO ] Deduced a trap composed of 24 places in 987 ms of which 18 ms to minimize.
[2023-03-21 19:59:41] [INFO ] Deduced a trap composed of 19 places in 839 ms of which 15 ms to minimize.
[2023-03-21 19:59:42] [INFO ] Deduced a trap composed of 13 places in 765 ms of which 2 ms to minimize.
[2023-03-21 19:59:43] [INFO ] Deduced a trap composed of 26 places in 971 ms of which 3 ms to minimize.
[2023-03-21 19:59:44] [INFO ] Deduced a trap composed of 13 places in 922 ms of which 1 ms to minimize.
[2023-03-21 19:59:45] [INFO ] Deduced a trap composed of 18 places in 727 ms of which 1 ms to minimize.
[2023-03-21 19:59:46] [INFO ] Deduced a trap composed of 20 places in 582 ms of which 2 ms to minimize.
[2023-03-21 19:59:47] [INFO ] Deduced a trap composed of 24 places in 615 ms of which 2 ms to minimize.
[2023-03-21 19:59:48] [INFO ] Deduced a trap composed of 19 places in 920 ms of which 1 ms to minimize.
[2023-03-21 19:59:49] [INFO ] Deduced a trap composed of 28 places in 696 ms of which 1 ms to minimize.
[2023-03-21 19:59:49] [INFO ] Deduced a trap composed of 25 places in 687 ms of which 2 ms to minimize.
[2023-03-21 19:59:50] [INFO ] Deduced a trap composed of 19 places in 641 ms of which 2 ms to minimize.
[2023-03-21 19:59:51] [INFO ] Deduced a trap composed of 25 places in 718 ms of which 1 ms to minimize.
[2023-03-21 19:59:54] [INFO ] Deduced a trap composed of 23 places in 2423 ms of which 10 ms to minimize.
[2023-03-21 19:59:54] [INFO ] Deduced a trap composed of 31 places in 916 ms of which 3 ms to minimize.
[2023-03-21 19:59:55] [INFO ] Deduced a trap composed of 33 places in 894 ms of which 11 ms to minimize.
[2023-03-21 19:59:57] [INFO ] Deduced a trap composed of 21 places in 964 ms of which 3 ms to minimize.
[2023-03-21 19:59:58] [INFO ] Deduced a trap composed of 34 places in 982 ms of which 3 ms to minimize.
[2023-03-21 19:59:59] [INFO ] Deduced a trap composed of 23 places in 729 ms of which 3 ms to minimize.
[2023-03-21 19:59:59] [INFO ] Deduced a trap composed of 32 places in 683 ms of which 2 ms to minimize.
[2023-03-21 20:00:02] [INFO ] Deduced a trap composed of 12 places in 2365 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:00:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:00:02] [INFO ] After 27380ms 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 282 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 447 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 447 ms. Remains : 1251/2652 places, 1202/2602 transitions.
Finished random walk after 2574 steps, including 0 resets, run visited all 4 properties in 79 ms. (steps per millisecond=32 )
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 2229 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 330 ms :[true, (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 264 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 142 ms. Remains 2652 /2652 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-21 20:00:06] [INFO ] Invariant cache hit.
[2023-03-21 20:00:07] [INFO ] Implicit Places using invariants in 1450 ms returned []
[2023-03-21 20:00:07] [INFO ] Invariant cache hit.
[2023-03-21 20:00:11] [INFO ] Implicit Places using invariants and state equation in 4238 ms returned []
Implicit Place search using SMT with State Equation took 5726 ms to find 0 implicit places.
[2023-03-21 20:00:11] [INFO ] Invariant cache hit.
[2023-03-21 20:00:14] [INFO ] Dead Transitions using invariants and state equation in 2483 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8353 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 956 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 361 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 225 ms. (steps per millisecond=44 ) properties (out of 7) seen :4
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 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 20:00:15] [INFO ] Invariant cache hit.
[2023-03-21 20:00:16] [INFO ] [Real]Absence check using 451 positive place invariants in 172 ms returned sat
[2023-03-21 20:00:18] [INFO ] After 2399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:00:19] [INFO ] [Nat]Absence check using 451 positive place invariants in 352 ms returned sat
[2023-03-21 20:00:21] [INFO ] After 1979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:00:22] [INFO ] Deduced a trap composed of 13 places in 805 ms of which 1 ms to minimize.
[2023-03-21 20:00:23] [INFO ] Deduced a trap composed of 15 places in 983 ms of which 2 ms to minimize.
[2023-03-21 20:00:24] [INFO ] Deduced a trap composed of 26 places in 621 ms of which 1 ms to minimize.
[2023-03-21 20:00:24] [INFO ] Deduced a trap composed of 31 places in 689 ms of which 15 ms to minimize.
[2023-03-21 20:00:25] [INFO ] Deduced a trap composed of 25 places in 868 ms of which 2 ms to minimize.
[2023-03-21 20:00:26] [INFO ] Deduced a trap composed of 21 places in 549 ms of which 1 ms to minimize.
[2023-03-21 20:00:27] [INFO ] Deduced a trap composed of 28 places in 808 ms of which 2 ms to minimize.
[2023-03-21 20:00:28] [INFO ] Deduced a trap composed of 29 places in 691 ms of which 1 ms to minimize.
[2023-03-21 20:00:29] [INFO ] Deduced a trap composed of 30 places in 1669 ms of which 23 ms to minimize.
[2023-03-21 20:00:31] [INFO ] Deduced a trap composed of 34 places in 1673 ms of which 3 ms to minimize.
[2023-03-21 20:00:32] [INFO ] Deduced a trap composed of 24 places in 764 ms of which 2 ms to minimize.
[2023-03-21 20:00:33] [INFO ] Deduced a trap composed of 21 places in 1196 ms of which 2 ms to minimize.
[2023-03-21 20:00:34] [INFO ] Deduced a trap composed of 29 places in 958 ms of which 2 ms to minimize.
[2023-03-21 20:00:35] [INFO ] Deduced a trap composed of 25 places in 734 ms of which 1 ms to minimize.
[2023-03-21 20:00:37] [INFO ] Deduced a trap composed of 28 places in 1331 ms of which 1 ms to minimize.
[2023-03-21 20:00:38] [INFO ] Deduced a trap composed of 26 places in 650 ms of which 2 ms to minimize.
[2023-03-21 20:00:39] [INFO ] Deduced a trap composed of 26 places in 1483 ms of which 1 ms to minimize.
[2023-03-21 20:00:40] [INFO ] Deduced a trap composed of 23 places in 1091 ms of which 1 ms to minimize.
[2023-03-21 20:00:41] [INFO ] Deduced a trap composed of 25 places in 727 ms of which 2 ms to minimize.
[2023-03-21 20:00:42] [INFO ] Deduced a trap composed of 20 places in 989 ms of which 2 ms to minimize.
[2023-03-21 20:00:43] [INFO ] Deduced a trap composed of 28 places in 704 ms of which 13 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-21 20:00:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:00:43] [INFO ] After 25264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 266 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 3 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 472 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 472 ms. Remains : 1251/2652 places, 1202/2602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1251 cols
[2023-03-21 20:00:44] [INFO ] Computed 450 place invariants in 25 ms
[2023-03-21 20:00:44] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:00:45] [INFO ] [Nat]Absence check using 449 positive place invariants in 118 ms returned sat
[2023-03-21 20:00:45] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 20:00:45] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:00:46] [INFO ] Deduced a trap composed of 8 places in 561 ms of which 9 ms to minimize.
[2023-03-21 20:00:46] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 8 ms to minimize.
[2023-03-21 20:00:47] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-21 20:00:47] [INFO ] Deduced a trap composed of 24 places in 325 ms of which 20 ms to minimize.
[2023-03-21 20:00:47] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 0 ms to minimize.
[2023-03-21 20:00:47] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2023-03-21 20:00:48] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-21 20:00:48] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 1 ms to minimize.
[2023-03-21 20:00:48] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2023-03-21 20:00:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2884 ms
[2023-03-21 20:00:48] [INFO ] After 3594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-21 20:00:48] [INFO ] After 3947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 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 49 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 49 ms. Remains : 1251/1251 places, 1202/1202 transitions.
Finished random walk after 2822 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=85 )
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 1113 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 244 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 272 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 304 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 4436 steps with 0 reset in 70 ms.
FORMULA ShieldIIPs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-08 finished in 93129 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 181 ms. Remains 2653 /2653 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2023-03-21 20:00:51] [INFO ] Computed 451 place invariants in 31 ms
[2023-03-21 20:00:52] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2023-03-21 20:00:52] [INFO ] Invariant cache hit.
[2023-03-21 20:00:55] [INFO ] Implicit Places using invariants and state equation in 3498 ms returned []
Implicit Place search using SMT with State Equation took 4633 ms to find 0 implicit places.
[2023-03-21 20:00:55] [INFO ] Invariant cache hit.
[2023-03-21 20:00:58] [INFO ] Dead Transitions using invariants and state equation in 2251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7078 ms. Remains : 2653/2653 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 187 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 6251 steps with 0 reset in 103 ms.
FORMULA ShieldIIPs-PT-050B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-10 finished in 7422 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 328 ms. Remains 2652 /2653 variables (removed 1) and now considering 2602/2603 (removed 1) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-21 20:00:58] [INFO ] Computed 451 place invariants in 16 ms
[2023-03-21 20:00:59] [INFO ] Implicit Places using invariants in 1140 ms returned []
[2023-03-21 20:00:59] [INFO ] Invariant cache hit.
[2023-03-21 20:01:04] [INFO ] Implicit Places using invariants and state equation in 5111 ms returned []
Implicit Place search using SMT with State Equation took 6278 ms to find 0 implicit places.
[2023-03-21 20:01:04] [INFO ] Invariant cache hit.
[2023-03-21 20:01:07] [INFO ] Dead Transitions using invariants and state equation in 2220 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 8828 ms. Remains : 2652/2653 places, 2602/2603 transitions.
Stuttering acceptance computed with spot in 124 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 1782 ms.
Product exploration explored 100000 steps with 50000 reset in 1735 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 132 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 12671 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 133 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 8 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 3 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 566 ms. Remains 1253 /2653 variables (removed 1400) and now considering 1204/2603 (removed 1399) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2023-03-21 20:01:12] [INFO ] Computed 450 place invariants in 5 ms
[2023-03-21 20:01:12] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-21 20:01:12] [INFO ] Invariant cache hit.
[2023-03-21 20:01:14] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2620 ms to find 0 implicit places.
[2023-03-21 20:01:14] [INFO ] Invariant cache hit.
[2023-03-21 20:01:15] [INFO ] Dead Transitions using invariants and state equation in 799 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 3987 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 22644 reset in 1129 ms.
Product exploration explored 100000 steps with 22637 reset in 1214 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 206 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 33 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 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 79 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p0))]
[2023-03-21 20:01:18] [INFO ] Invariant cache hit.
[2023-03-21 20:01:20] [INFO ] [Real]Absence check using 450 positive place invariants in 269 ms returned sat
[2023-03-21 20:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:01:23] [INFO ] [Real]Absence check using state equation in 3747 ms returned sat
[2023-03-21 20:01:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 20:01:25] [INFO ] [Nat]Absence check using 450 positive place invariants in 343 ms returned sat
[2023-03-21 20:01:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 20:01:30] [INFO ] [Nat]Absence check using state equation in 4612 ms returned sat
[2023-03-21 20:01:30] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-21 20:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-21 20:01:30] [INFO ] Computed and/alt/rep : 1197/3002/1197 causal constraints (skipped 4 transitions) in 135 ms.
[2023-03-21 20:01:39] [INFO ] Deduced a trap composed of 2 places in 730 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-21 20:01:39] [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 40 ms. Remains 1253 /1253 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
[2023-03-21 20:01:39] [INFO ] Invariant cache hit.
[2023-03-21 20:01:40] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-21 20:01:40] [INFO ] Invariant cache hit.
[2023-03-21 20:01:42] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2538 ms to find 0 implicit places.
[2023-03-21 20:01:42] [INFO ] Redundant transitions in 250 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-21 20:01:42] [INFO ] Computed 450 place invariants in 6 ms
[2023-03-21 20:01:43] [INFO ] Dead Transitions using invariants and state equation in 1074 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 32 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 3960 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 188 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 58 ms :[(AND (NOT p2) (NOT p0))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
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 349 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 68 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p0))]
[2023-03-21 20:01:44] [INFO ] Invariant cache hit.
[2023-03-21 20:01:46] [INFO ] [Real]Absence check using 450 positive place invariants in 595 ms returned sat
[2023-03-21 20:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:01:49] [INFO ] [Real]Absence check using state equation in 3150 ms returned sat
[2023-03-21 20:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 20:01:50] [INFO ] [Nat]Absence check using 450 positive place invariants in 341 ms returned sat
[2023-03-21 20:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 20:01:54] [INFO ] [Nat]Absence check using state equation in 3057 ms returned sat
[2023-03-21 20:01:54] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-21 20:01:54] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-21 20:01:54] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-03-21 20:01:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 567 ms
[2023-03-21 20:01:54] [INFO ] Computed and/alt/rep : 1196/2997/1196 causal constraints (skipped 4 transitions) in 99 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:261)
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-21 20:02:04] [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 38 ms :[(AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 22577 reset in 1099 ms.
Product exploration explored 100000 steps with 22388 reset in 1360 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 35 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2023-03-21 20:02:06] [INFO ] Invariant cache hit.
[2023-03-21 20:02:07] [INFO ] Implicit Places using invariants in 837 ms returned []
[2023-03-21 20:02:07] [INFO ] Invariant cache hit.
[2023-03-21 20:02:09] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 2767 ms to find 0 implicit places.
[2023-03-21 20:02:09] [INFO ] Redundant transitions in 179 ms returned []
[2023-03-21 20:02:09] [INFO ] Invariant cache hit.
[2023-03-21 20:02:10] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3658 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLCardinality-00 finished in 59598 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-21 20:02:10] [INFO ] Flatten gal took : 81 ms
[2023-03-21 20:02:10] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 20:02:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2653 places, 2603 transitions and 8206 arcs took 33 ms.
Total runtime 345499 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1762/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1762/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-050B-LTLCardinality-00
Could not compute solution for formula : ShieldIIPs-PT-050B-LTLCardinality-05

BK_STOP 1679428933895

--------------------
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
mcc2023
ltl formula name ShieldIIPs-PT-050B-LTLCardinality-00
ltl formula formula --ltl=/tmp/1762/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2653 places, 2603 transitions and 8206 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1762/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1762/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.630 real 0.280 user 0.240 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1762/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1762/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5626a059f3f4]
1: pnml2lts-mc(+0xa2496) [0x5626a059f496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f561ea22140]
3: pnml2lts-mc(+0x405be5) [0x5626a0902be5]
4: pnml2lts-mc(+0x16b3f9) [0x5626a06683f9]
5: pnml2lts-mc(+0x164ac4) [0x5626a0661ac4]
6: pnml2lts-mc(+0x272e0a) [0x5626a076fe0a]
7: pnml2lts-mc(+0xb61f0) [0x5626a05b31f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f561e8754d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f561e87567a]
10: pnml2lts-mc(+0xa1581) [0x5626a059e581]
11: pnml2lts-mc(+0xa1910) [0x5626a059e910]
12: pnml2lts-mc(+0xa32a2) [0x5626a05a02a2]
13: pnml2lts-mc(+0xa50f4) [0x5626a05a20f4]
14: pnml2lts-mc(+0xa516b) [0x5626a05a216b]
15: pnml2lts-mc(+0x3f34b3) [0x5626a08f04b3]
16: pnml2lts-mc(+0x7c63d) [0x5626a057963d]
17: pnml2lts-mc(+0x67d86) [0x5626a0564d86]
18: pnml2lts-mc(+0x60a8a) [0x5626a055da8a]
19: pnml2lts-mc(+0x5eb15) [0x5626a055bb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f561e85dd0a]
21: pnml2lts-mc(+0x6075e) [0x5626a055d75e]
ltl formula name ShieldIIPs-PT-050B-LTLCardinality-05
ltl formula formula --ltl=/tmp/1762/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2653 places, 2603 transitions and 8206 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.450 real 0.180 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1762/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1762/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1762/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1762/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55ea7af223f4]
1: pnml2lts-mc(+0xa2496) [0x55ea7af22496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f99c52f3140]
3: pnml2lts-mc(+0x405be5) [0x55ea7b285be5]
4: pnml2lts-mc(+0x16b3f9) [0x55ea7afeb3f9]
5: pnml2lts-mc(+0x164ac4) [0x55ea7afe4ac4]
6: pnml2lts-mc(+0x272e0a) [0x55ea7b0f2e0a]
7: pnml2lts-mc(+0xb61f0) [0x55ea7af361f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f99c51464d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f99c514667a]
10: pnml2lts-mc(+0xa1581) [0x55ea7af21581]
11: pnml2lts-mc(+0xa1910) [0x55ea7af21910]
12: pnml2lts-mc(+0xa32a2) [0x55ea7af232a2]
13: pnml2lts-mc(+0xa50f4) [0x55ea7af250f4]
14: pnml2lts-mc(+0xa516b) [0x55ea7af2516b]
15: pnml2lts-mc(+0x3f34b3) [0x55ea7b2734b3]
16: pnml2lts-mc(+0x7c63d) [0x55ea7aefc63d]
17: pnml2lts-mc(+0x67d86) [0x55ea7aee7d86]
18: pnml2lts-mc(+0x60a8a) [0x55ea7aee0a8a]
19: pnml2lts-mc(+0x5eb15) [0x55ea7aedeb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f99c512ed0a]
21: pnml2lts-mc(+0x6075e) [0x55ea7aee075e]

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r393-oct2-167903716700155"
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 ;