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.r297-tall-167873950900764.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 PolyORBNT-PT-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 20K Feb 26 00:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 00:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 973K Feb 26 00:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 00:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 306K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 245K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 26 01:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 01:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679640446871

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 06:47:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 06:47:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 06:47:29] [INFO ] Load time of PNML (sax parser for PT used): 684 ms
[2023-03-24 06:47:29] [INFO ] Transformed 664 places.
[2023-03-24 06:47:29] [INFO ] Transformed 12050 transitions.
[2023-03-24 06:47:29] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 861 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-24 06:47:29] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 06:47:29] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 06:47:29] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-24 06:47:29] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-24 06:47:29] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 92 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2023-03-24 06:47:30] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-24 06:47:30] [INFO ] Computed 92 place invariants in 145 ms
[2023-03-24 06:47:32] [INFO ] Dead Transitions using invariants and state equation in 2206 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 06:47:32] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-24 06:47:32] [INFO ] Computed 92 place invariants in 59 ms
[2023-03-24 06:47:32] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-24 06:47:32] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-24 06:47:32] [INFO ] Invariant cache hit.
[2023-03-24 06:47:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:47:33] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 18 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3818 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 500 out of 664 places after structural reductions.
[2023-03-24 06:47:34] [INFO ] Flatten gal took : 263 ms
[2023-03-24 06:47:34] [INFO ] Flatten gal took : 144 ms
[2023-03-24 06:47:35] [INFO ] Input system was already deterministic with 1325 transitions.
Support contains 497 out of 664 places (down from 500) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1086 ms. (steps per millisecond=9 ) properties (out of 29) seen :5
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-24 06:47:36] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-24 06:47:36] [INFO ] Invariant cache hit.
[2023-03-24 06:47:37] [INFO ] [Real]Absence check using 62 positive place invariants in 70 ms returned sat
[2023-03-24 06:47:37] [INFO ] [Real]Absence check using 62 positive and 30 generalized place invariants in 37 ms returned sat
[2023-03-24 06:47:39] [INFO ] After 2776ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2023-03-24 06:47:39] [INFO ] [Nat]Absence check using 62 positive place invariants in 26 ms returned sat
[2023-03-24 06:47:39] [INFO ] [Nat]Absence check using 62 positive and 30 generalized place invariants in 72 ms returned sat
[2023-03-24 06:47:42] [INFO ] After 2389ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-24 06:47:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:47:42] [INFO ] After 471ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-03-24 06:47:43] [INFO ] Deduced a trap composed of 299 places in 424 ms of which 12 ms to minimize.
[2023-03-24 06:47:43] [INFO ] Deduced a trap composed of 313 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:47:44] [INFO ] Deduced a trap composed of 308 places in 455 ms of which 2 ms to minimize.
[2023-03-24 06:47:44] [INFO ] Deduced a trap composed of 298 places in 391 ms of which 2 ms to minimize.
[2023-03-24 06:47:45] [INFO ] Deduced a trap composed of 299 places in 395 ms of which 2 ms to minimize.
[2023-03-24 06:47:45] [INFO ] Deduced a trap composed of 294 places in 380 ms of which 1 ms to minimize.
[2023-03-24 06:47:45] [INFO ] Deduced a trap composed of 309 places in 370 ms of which 0 ms to minimize.
[2023-03-24 06:47:46] [INFO ] Deduced a trap composed of 294 places in 402 ms of which 1 ms to minimize.
[2023-03-24 06:47:46] [INFO ] Deduced a trap composed of 313 places in 393 ms of which 1 ms to minimize.
[2023-03-24 06:47:47] [INFO ] Deduced a trap composed of 311 places in 389 ms of which 1 ms to minimize.
[2023-03-24 06:47:47] [INFO ] Deduced a trap composed of 310 places in 364 ms of which 1 ms to minimize.
[2023-03-24 06:47:48] [INFO ] Deduced a trap composed of 302 places in 366 ms of which 1 ms to minimize.
[2023-03-24 06:47:48] [INFO ] Deduced a trap composed of 311 places in 423 ms of which 1 ms to minimize.
[2023-03-24 06:47:49] [INFO ] Deduced a trap composed of 305 places in 379 ms of which 0 ms to minimize.
[2023-03-24 06:47:50] [INFO ] Deduced a trap composed of 297 places in 386 ms of which 0 ms to minimize.
[2023-03-24 06:47:50] [INFO ] Deduced a trap composed of 299 places in 388 ms of which 1 ms to minimize.
[2023-03-24 06:47:51] [INFO ] Deduced a trap composed of 303 places in 397 ms of which 1 ms to minimize.
[2023-03-24 06:47:51] [INFO ] Deduced a trap composed of 306 places in 371 ms of which 0 ms to minimize.
[2023-03-24 06:47:52] [INFO ] Deduced a trap composed of 309 places in 384 ms of which 1 ms to minimize.
[2023-03-24 06:47:52] [INFO ] Deduced a trap composed of 307 places in 384 ms of which 2 ms to minimize.
[2023-03-24 06:47:53] [INFO ] Deduced a trap composed of 322 places in 383 ms of which 1 ms to minimize.
[2023-03-24 06:47:53] [INFO ] Deduced a trap composed of 307 places in 391 ms of which 1 ms to minimize.
[2023-03-24 06:47:54] [INFO ] Deduced a trap composed of 308 places in 385 ms of which 0 ms to minimize.
[2023-03-24 06:47:54] [INFO ] Deduced a trap composed of 309 places in 383 ms of which 1 ms to minimize.
[2023-03-24 06:47:55] [INFO ] Deduced a trap composed of 301 places in 371 ms of which 1 ms to minimize.
[2023-03-24 06:47:56] [INFO ] Deduced a trap composed of 303 places in 384 ms of which 1 ms to minimize.
[2023-03-24 06:47:56] [INFO ] Deduced a trap composed of 304 places in 367 ms of which 1 ms to minimize.
[2023-03-24 06:47:57] [INFO ] Deduced a trap composed of 300 places in 381 ms of which 0 ms to minimize.
[2023-03-24 06:47:57] [INFO ] Deduced a trap composed of 299 places in 383 ms of which 1 ms to minimize.
[2023-03-24 06:47:58] [INFO ] Deduced a trap composed of 317 places in 386 ms of which 1 ms to minimize.
[2023-03-24 06:47:58] [INFO ] Deduced a trap composed of 303 places in 388 ms of which 0 ms to minimize.
[2023-03-24 06:47:59] [INFO ] Deduced a trap composed of 297 places in 386 ms of which 1 ms to minimize.
[2023-03-24 06:47:59] [INFO ] Deduced a trap composed of 299 places in 388 ms of which 1 ms to minimize.
[2023-03-24 06:48:00] [INFO ] Deduced a trap composed of 307 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:48:02] [INFO ] Deduced a trap composed of 315 places in 353 ms of which 2 ms to minimize.
[2023-03-24 06:48:02] [INFO ] Deduced a trap composed of 306 places in 388 ms of which 1 ms to minimize.
[2023-03-24 06:48:03] [INFO ] Deduced a trap composed of 306 places in 389 ms of which 0 ms to minimize.
[2023-03-24 06:48:03] [INFO ] Deduced a trap composed of 308 places in 372 ms of which 0 ms to minimize.
[2023-03-24 06:48:04] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 21799 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.refineResultsWithTraps(DeadlockTester.java:769)
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-24 06:48:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:48:04] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:3
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 7 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 82 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 82 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 152 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 582 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 580 transition count 1251
Applied a total of 158 rules in 269 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2023-03-24 06:48:04] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-24 06:48:04] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-24 06:48:05] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1156 ms. Remains : 580/664 places, 1251/1325 transitions.
Incomplete random walk after 10000 steps, including 746 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:48:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-24 06:48:05] [INFO ] Invariant cache hit.
[2023-03-24 06:48:05] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-24 06:48:05] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 24 ms returned sat
[2023-03-24 06:48:05] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:48:06] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2023-03-24 06:48:06] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 25 ms returned sat
[2023-03-24 06:48:07] [INFO ] After 1036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:48:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:48:07] [INFO ] After 128ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 06:48:07] [INFO ] Deduced a trap composed of 228 places in 362 ms of which 1 ms to minimize.
[2023-03-24 06:48:08] [INFO ] Deduced a trap composed of 232 places in 342 ms of which 2 ms to minimize.
[2023-03-24 06:48:08] [INFO ] Deduced a trap composed of 241 places in 339 ms of which 1 ms to minimize.
[2023-03-24 06:48:08] [INFO ] Deduced a trap composed of 240 places in 351 ms of which 1 ms to minimize.
[2023-03-24 06:48:09] [INFO ] Deduced a trap composed of 238 places in 362 ms of which 0 ms to minimize.
[2023-03-24 06:48:09] [INFO ] Deduced a trap composed of 232 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:48:10] [INFO ] Deduced a trap composed of 232 places in 320 ms of which 0 ms to minimize.
[2023-03-24 06:48:10] [INFO ] Deduced a trap composed of 229 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:48:10] [INFO ] Deduced a trap composed of 228 places in 346 ms of which 0 ms to minimize.
[2023-03-24 06:48:11] [INFO ] Deduced a trap composed of 233 places in 339 ms of which 0 ms to minimize.
[2023-03-24 06:48:11] [INFO ] Deduced a trap composed of 236 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:48:12] [INFO ] Deduced a trap composed of 230 places in 321 ms of which 1 ms to minimize.
[2023-03-24 06:48:12] [INFO ] Deduced a trap composed of 237 places in 350 ms of which 1 ms to minimize.
[2023-03-24 06:48:12] [INFO ] Deduced a trap composed of 231 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:48:13] [INFO ] Deduced a trap composed of 241 places in 343 ms of which 1 ms to minimize.
[2023-03-24 06:48:13] [INFO ] Deduced a trap composed of 241 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:48:14] [INFO ] Deduced a trap composed of 233 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:48:14] [INFO ] Deduced a trap composed of 244 places in 349 ms of which 1 ms to minimize.
[2023-03-24 06:48:15] [INFO ] Deduced a trap composed of 239 places in 353 ms of which 3 ms to minimize.
[2023-03-24 06:48:15] [INFO ] Deduced a trap composed of 230 places in 350 ms of which 0 ms to minimize.
[2023-03-24 06:48:16] [INFO ] Deduced a trap composed of 232 places in 345 ms of which 0 ms to minimize.
[2023-03-24 06:48:16] [INFO ] Deduced a trap composed of 224 places in 352 ms of which 0 ms to minimize.
[2023-03-24 06:48:17] [INFO ] Deduced a trap composed of 218 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:48:17] [INFO ] Deduced a trap composed of 222 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:48:17] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:48:18] [INFO ] Deduced a trap composed of 230 places in 328 ms of which 1 ms to minimize.
[2023-03-24 06:48:18] [INFO ] Deduced a trap composed of 222 places in 335 ms of which 2 ms to minimize.
[2023-03-24 06:48:19] [INFO ] Deduced a trap composed of 226 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:48:19] [INFO ] Deduced a trap composed of 241 places in 352 ms of which 2 ms to minimize.
[2023-03-24 06:48:19] [INFO ] Deduced a trap composed of 230 places in 314 ms of which 1 ms to minimize.
[2023-03-24 06:48:20] [INFO ] Deduced a trap composed of 224 places in 329 ms of which 1 ms to minimize.
[2023-03-24 06:48:20] [INFO ] Deduced a trap composed of 239 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:48:20] [INFO ] Deduced a trap composed of 226 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:48:21] [INFO ] Deduced a trap composed of 224 places in 298 ms of which 0 ms to minimize.
[2023-03-24 06:48:21] [INFO ] Deduced a trap composed of 239 places in 308 ms of which 0 ms to minimize.
[2023-03-24 06:48:23] [INFO ] Deduced a trap composed of 228 places in 319 ms of which 0 ms to minimize.
[2023-03-24 06:48:23] [INFO ] Deduced a trap composed of 237 places in 320 ms of which 0 ms to minimize.
[2023-03-24 06:48:23] [INFO ] Deduced a trap composed of 239 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:48:24] [INFO ] Deduced a trap composed of 232 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:48:24] [INFO ] Deduced a trap composed of 245 places in 355 ms of which 1 ms to minimize.
[2023-03-24 06:48:25] [INFO ] Deduced a trap composed of 228 places in 320 ms of which 1 ms to minimize.
[2023-03-24 06:48:25] [INFO ] Deduced a trap composed of 228 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:48:25] [INFO ] Deduced a trap composed of 222 places in 332 ms of which 0 ms to minimize.
[2023-03-24 06:48:26] [INFO ] Deduced a trap composed of 224 places in 351 ms of which 1 ms to minimize.
[2023-03-24 06:48:26] [INFO ] Deduced a trap composed of 241 places in 344 ms of which 0 ms to minimize.
[2023-03-24 06:48:27] [INFO ] Deduced a trap composed of 228 places in 347 ms of which 0 ms to minimize.
[2023-03-24 06:48:27] [INFO ] Deduced a trap composed of 226 places in 333 ms of which 0 ms to minimize.
[2023-03-24 06:48:28] [INFO ] Deduced a trap composed of 232 places in 321 ms of which 1 ms to minimize.
[2023-03-24 06:48:28] [INFO ] Deduced a trap composed of 240 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:48:29] [INFO ] Deduced a trap composed of 230 places in 323 ms of which 0 ms to minimize.
[2023-03-24 06:48:29] [INFO ] Deduced a trap composed of 230 places in 316 ms of which 1 ms to minimize.
[2023-03-24 06:48:30] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 23706 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.refineResultsWithTraps(DeadlockTester.java:769)
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-24 06:48:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:48:31] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 52 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 10000 steps, including 699 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 272440 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272440 steps, saw 44799 distinct states, run finished after 3005 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:48:34] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-24 06:48:34] [INFO ] Invariant cache hit.
[2023-03-24 06:48:34] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-24 06:48:34] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 24 ms returned sat
[2023-03-24 06:48:34] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:48:34] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 06:48:34] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 24 ms returned sat
[2023-03-24 06:48:35] [INFO ] After 998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:48:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:48:35] [INFO ] After 128ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 06:48:36] [INFO ] Deduced a trap composed of 228 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:48:36] [INFO ] Deduced a trap composed of 232 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:48:36] [INFO ] Deduced a trap composed of 241 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:48:37] [INFO ] Deduced a trap composed of 240 places in 355 ms of which 1 ms to minimize.
[2023-03-24 06:48:37] [INFO ] Deduced a trap composed of 238 places in 349 ms of which 0 ms to minimize.
[2023-03-24 06:48:38] [INFO ] Deduced a trap composed of 232 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:48:38] [INFO ] Deduced a trap composed of 232 places in 367 ms of which 1 ms to minimize.
[2023-03-24 06:48:38] [INFO ] Deduced a trap composed of 229 places in 372 ms of which 1 ms to minimize.
[2023-03-24 06:48:39] [INFO ] Deduced a trap composed of 228 places in 364 ms of which 1 ms to minimize.
[2023-03-24 06:48:39] [INFO ] Deduced a trap composed of 233 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:48:40] [INFO ] Deduced a trap composed of 236 places in 346 ms of which 0 ms to minimize.
[2023-03-24 06:48:40] [INFO ] Deduced a trap composed of 230 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:48:40] [INFO ] Deduced a trap composed of 237 places in 345 ms of which 1 ms to minimize.
[2023-03-24 06:48:41] [INFO ] Deduced a trap composed of 231 places in 356 ms of which 1 ms to minimize.
[2023-03-24 06:48:41] [INFO ] Deduced a trap composed of 241 places in 351 ms of which 1 ms to minimize.
[2023-03-24 06:48:42] [INFO ] Deduced a trap composed of 241 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:48:42] [INFO ] Deduced a trap composed of 233 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:48:43] [INFO ] Deduced a trap composed of 244 places in 365 ms of which 1 ms to minimize.
[2023-03-24 06:48:43] [INFO ] Deduced a trap composed of 239 places in 350 ms of which 0 ms to minimize.
[2023-03-24 06:48:44] [INFO ] Deduced a trap composed of 230 places in 339 ms of which 1 ms to minimize.
[2023-03-24 06:48:44] [INFO ] Deduced a trap composed of 232 places in 336 ms of which 0 ms to minimize.
[2023-03-24 06:48:45] [INFO ] Deduced a trap composed of 224 places in 356 ms of which 0 ms to minimize.
[2023-03-24 06:48:45] [INFO ] Deduced a trap composed of 218 places in 338 ms of which 1 ms to minimize.
[2023-03-24 06:48:46] [INFO ] Deduced a trap composed of 222 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:48:46] [INFO ] Deduced a trap composed of 230 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:48:46] [INFO ] Deduced a trap composed of 230 places in 353 ms of which 0 ms to minimize.
[2023-03-24 06:48:47] [INFO ] Deduced a trap composed of 222 places in 351 ms of which 1 ms to minimize.
[2023-03-24 06:48:47] [INFO ] Deduced a trap composed of 226 places in 328 ms of which 2 ms to minimize.
[2023-03-24 06:48:47] [INFO ] Deduced a trap composed of 241 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:48:48] [INFO ] Deduced a trap composed of 230 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:48:48] [INFO ] Deduced a trap composed of 224 places in 338 ms of which 0 ms to minimize.
[2023-03-24 06:48:49] [INFO ] Deduced a trap composed of 239 places in 334 ms of which 0 ms to minimize.
[2023-03-24 06:48:49] [INFO ] Deduced a trap composed of 226 places in 323 ms of which 0 ms to minimize.
[2023-03-24 06:48:50] [INFO ] Deduced a trap composed of 224 places in 335 ms of which 1 ms to minimize.
[2023-03-24 06:48:50] [INFO ] Deduced a trap composed of 239 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:48:51] [INFO ] Deduced a trap composed of 228 places in 331 ms of which 1 ms to minimize.
[2023-03-24 06:48:52] [INFO ] Deduced a trap composed of 237 places in 317 ms of which 0 ms to minimize.
[2023-03-24 06:48:52] [INFO ] Deduced a trap composed of 239 places in 320 ms of which 1 ms to minimize.
[2023-03-24 06:48:52] [INFO ] Deduced a trap composed of 232 places in 325 ms of which 0 ms to minimize.
[2023-03-24 06:48:53] [INFO ] Deduced a trap composed of 245 places in 341 ms of which 1 ms to minimize.
[2023-03-24 06:48:53] [INFO ] Deduced a trap composed of 228 places in 340 ms of which 1 ms to minimize.
[2023-03-24 06:48:54] [INFO ] Deduced a trap composed of 228 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:48:54] [INFO ] Deduced a trap composed of 222 places in 359 ms of which 1 ms to minimize.
[2023-03-24 06:48:55] [INFO ] Deduced a trap composed of 224 places in 347 ms of which 0 ms to minimize.
[2023-03-24 06:48:55] [INFO ] Deduced a trap composed of 241 places in 360 ms of which 0 ms to minimize.
[2023-03-24 06:48:56] [INFO ] Deduced a trap composed of 228 places in 334 ms of which 0 ms to minimize.
[2023-03-24 06:48:56] [INFO ] Deduced a trap composed of 226 places in 335 ms of which 0 ms to minimize.
[2023-03-24 06:48:56] [INFO ] Deduced a trap composed of 232 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:48:57] [INFO ] Deduced a trap composed of 240 places in 351 ms of which 1 ms to minimize.
[2023-03-24 06:48:57] [INFO ] Deduced a trap composed of 230 places in 349 ms of which 1 ms to minimize.
[2023-03-24 06:48:58] [INFO ] Deduced a trap composed of 230 places in 349 ms of which 1 ms to minimize.
[2023-03-24 06:48:59] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 23728 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.refineResultsWithTraps(DeadlockTester.java:769)
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-24 06:48:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:48:59] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 43 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 31 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-24 06:48:59] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-24 06:48:59] [INFO ] Invariant cache hit.
[2023-03-24 06:49:00] [INFO ] Implicit Places using invariants in 775 ms returned []
[2023-03-24 06:49:00] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-24 06:49:00] [INFO ] Invariant cache hit.
[2023-03-24 06:49:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:49:13] [INFO ] Implicit Places using invariants and state equation in 13072 ms returned []
Implicit Place search using SMT with State Equation took 13849 ms to find 0 implicit places.
[2023-03-24 06:49:13] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-24 06:49:13] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-24 06:49:13] [INFO ] Invariant cache hit.
[2023-03-24 06:49:14] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14801 ms. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 167 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-24 06:49:14] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-24 06:49:14] [INFO ] [Real]Absence check using 62 positive place invariants in 12 ms returned sat
[2023-03-24 06:49:14] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 25 ms returned sat
[2023-03-24 06:49:14] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:49:14] [INFO ] [Nat]Absence check using 62 positive place invariants in 13 ms returned sat
[2023-03-24 06:49:14] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 27 ms returned sat
[2023-03-24 06:49:15] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:49:15] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 0 ms to minimize.
[2023-03-24 06:49:16] [INFO ] Deduced a trap composed of 222 places in 302 ms of which 0 ms to minimize.
[2023-03-24 06:49:16] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 1 ms to minimize.
[2023-03-24 06:49:16] [INFO ] Deduced a trap composed of 222 places in 302 ms of which 1 ms to minimize.
[2023-03-24 06:49:17] [INFO ] Deduced a trap composed of 226 places in 303 ms of which 0 ms to minimize.
[2023-03-24 06:49:17] [INFO ] Deduced a trap composed of 232 places in 303 ms of which 0 ms to minimize.
[2023-03-24 06:49:17] [INFO ] Deduced a trap composed of 240 places in 308 ms of which 0 ms to minimize.
[2023-03-24 06:49:18] [INFO ] Deduced a trap composed of 234 places in 303 ms of which 1 ms to minimize.
[2023-03-24 06:49:18] [INFO ] Deduced a trap composed of 238 places in 303 ms of which 0 ms to minimize.
[2023-03-24 06:49:18] [INFO ] Deduced a trap composed of 238 places in 291 ms of which 1 ms to minimize.
[2023-03-24 06:49:19] [INFO ] Deduced a trap composed of 231 places in 297 ms of which 1 ms to minimize.
[2023-03-24 06:49:19] [INFO ] Deduced a trap composed of 229 places in 289 ms of which 1 ms to minimize.
[2023-03-24 06:49:19] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2023-03-24 06:49:20] [INFO ] Deduced a trap composed of 231 places in 280 ms of which 1 ms to minimize.
[2023-03-24 06:49:20] [INFO ] Deduced a trap composed of 231 places in 293 ms of which 1 ms to minimize.
[2023-03-24 06:49:20] [INFO ] Deduced a trap composed of 229 places in 280 ms of which 1 ms to minimize.
[2023-03-24 06:49:21] [INFO ] Deduced a trap composed of 230 places in 297 ms of which 1 ms to minimize.
[2023-03-24 06:49:21] [INFO ] Deduced a trap composed of 226 places in 306 ms of which 0 ms to minimize.
[2023-03-24 06:49:21] [INFO ] Deduced a trap composed of 222 places in 288 ms of which 0 ms to minimize.
[2023-03-24 06:49:22] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 1 ms to minimize.
[2023-03-24 06:49:22] [INFO ] Deduced a trap composed of 224 places in 273 ms of which 1 ms to minimize.
[2023-03-24 06:49:22] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 1 ms to minimize.
[2023-03-24 06:49:23] [INFO ] Deduced a trap composed of 225 places in 299 ms of which 1 ms to minimize.
[2023-03-24 06:49:23] [INFO ] Deduced a trap composed of 228 places in 302 ms of which 1 ms to minimize.
[2023-03-24 06:49:23] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 1 ms to minimize.
[2023-03-24 06:49:24] [INFO ] Deduced a trap composed of 224 places in 282 ms of which 0 ms to minimize.
[2023-03-24 06:49:24] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 0 ms to minimize.
[2023-03-24 06:49:24] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 0 ms to minimize.
[2023-03-24 06:49:25] [INFO ] Deduced a trap composed of 226 places in 295 ms of which 1 ms to minimize.
[2023-03-24 06:49:25] [INFO ] Deduced a trap composed of 238 places in 291 ms of which 0 ms to minimize.
[2023-03-24 06:49:25] [INFO ] Deduced a trap composed of 222 places in 283 ms of which 1 ms to minimize.
[2023-03-24 06:49:26] [INFO ] Deduced a trap composed of 232 places in 306 ms of which 1 ms to minimize.
[2023-03-24 06:49:26] [INFO ] Deduced a trap composed of 230 places in 286 ms of which 1 ms to minimize.
[2023-03-24 06:49:26] [INFO ] Deduced a trap composed of 236 places in 299 ms of which 1 ms to minimize.
[2023-03-24 06:49:27] [INFO ] Deduced a trap composed of 226 places in 297 ms of which 1 ms to minimize.
[2023-03-24 06:49:27] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2023-03-24 06:49:27] [INFO ] Deduced a trap composed of 226 places in 308 ms of which 1 ms to minimize.
[2023-03-24 06:49:28] [INFO ] Deduced a trap composed of 223 places in 307 ms of which 0 ms to minimize.
[2023-03-24 06:49:28] [INFO ] Deduced a trap composed of 229 places in 297 ms of which 1 ms to minimize.
[2023-03-24 06:49:29] [INFO ] Deduced a trap composed of 225 places in 304 ms of which 1 ms to minimize.
[2023-03-24 06:49:29] [INFO ] Deduced a trap composed of 234 places in 308 ms of which 0 ms to minimize.
[2023-03-24 06:49:29] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 0 ms to minimize.
[2023-03-24 06:49:30] [INFO ] Deduced a trap composed of 228 places in 297 ms of which 1 ms to minimize.
[2023-03-24 06:49:30] [INFO ] Deduced a trap composed of 226 places in 301 ms of which 1 ms to minimize.
[2023-03-24 06:49:31] [INFO ] Deduced a trap composed of 226 places in 294 ms of which 0 ms to minimize.
[2023-03-24 06:49:31] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 0 ms to minimize.
[2023-03-24 06:49:32] [INFO ] Deduced a trap composed of 233 places in 287 ms of which 1 ms to minimize.
[2023-03-24 06:49:32] [INFO ] Deduced a trap composed of 236 places in 294 ms of which 1 ms to minimize.
[2023-03-24 06:49:32] [INFO ] Deduced a trap composed of 221 places in 292 ms of which 0 ms to minimize.
[2023-03-24 06:49:33] [INFO ] Deduced a trap composed of 228 places in 293 ms of which 1 ms to minimize.
[2023-03-24 06:49:33] [INFO ] Deduced a trap composed of 237 places in 312 ms of which 1 ms to minimize.
[2023-03-24 06:49:33] [INFO ] Deduced a trap composed of 228 places in 302 ms of which 0 ms to minimize.
[2023-03-24 06:49:34] [INFO ] Deduced a trap composed of 234 places in 298 ms of which 1 ms to minimize.
[2023-03-24 06:49:35] [INFO ] Deduced a trap composed of 224 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:49:35] [INFO ] Deduced a trap composed of 222 places in 295 ms of which 1 ms to minimize.
[2023-03-24 06:49:36] [INFO ] Deduced a trap composed of 218 places in 296 ms of which 0 ms to minimize.
[2023-03-24 06:49:36] [INFO ] Deduced a trap composed of 234 places in 306 ms of which 1 ms to minimize.
[2023-03-24 06:49:37] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 0 ms to minimize.
[2023-03-24 06:49:37] [INFO ] Deduced a trap composed of 224 places in 301 ms of which 1 ms to minimize.
[2023-03-24 06:49:37] [INFO ] Deduced a trap composed of 226 places in 303 ms of which 0 ms to minimize.
[2023-03-24 06:49:38] [INFO ] Deduced a trap composed of 232 places in 297 ms of which 0 ms to minimize.
[2023-03-24 06:49:38] [INFO ] Deduced a trap composed of 230 places in 302 ms of which 1 ms to minimize.
[2023-03-24 06:49:38] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 2 ms to minimize.
[2023-03-24 06:49:39] [INFO ] Deduced a trap composed of 232 places in 297 ms of which 1 ms to minimize.
[2023-03-24 06:49:40] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 0 ms to minimize.
[2023-03-24 06:49:40] [INFO ] Deduced a trap composed of 232 places in 313 ms of which 1 ms to minimize.
[2023-03-24 06:49:40] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 0 ms to minimize.
[2023-03-24 06:49:41] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2023-03-24 06:49:41] [INFO ] Deduced a trap composed of 228 places in 299 ms of which 1 ms to minimize.
[2023-03-24 06:49:41] [INFO ] Deduced a trap composed of 232 places in 304 ms of which 1 ms to minimize.
[2023-03-24 06:49:42] [INFO ] Deduced a trap composed of 226 places in 286 ms of which 0 ms to minimize.
[2023-03-24 06:49:42] [INFO ] Deduced a trap composed of 228 places in 299 ms of which 1 ms to minimize.
[2023-03-24 06:49:42] [INFO ] Deduced a trap composed of 238 places in 284 ms of which 1 ms to minimize.
[2023-03-24 06:49:43] [INFO ] Deduced a trap composed of 228 places in 305 ms of which 0 ms to minimize.
[2023-03-24 06:49:43] [INFO ] Deduced a trap composed of 242 places in 292 ms of which 1 ms to minimize.
[2023-03-24 06:49:43] [INFO ] Deduced a trap composed of 224 places in 297 ms of which 0 ms to minimize.
[2023-03-24 06:49:44] [INFO ] Deduced a trap composed of 224 places in 304 ms of which 1 ms to minimize.
[2023-03-24 06:49:44] [INFO ] Deduced a trap composed of 230 places in 307 ms of which 1 ms to minimize.
[2023-03-24 06:49:44] [INFO ] Deduced a trap composed of 228 places in 299 ms of which 0 ms to minimize.
[2023-03-24 06:49:45] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 0 ms to minimize.
[2023-03-24 06:49:46] [INFO ] Deduced a trap composed of 226 places in 306 ms of which 0 ms to minimize.
[2023-03-24 06:49:46] [INFO ] Deduced a trap composed of 228 places in 302 ms of which 1 ms to minimize.
[2023-03-24 06:49:46] [INFO ] Deduced a trap composed of 238 places in 315 ms of which 1 ms to minimize.
[2023-03-24 06:49:47] [INFO ] Deduced a trap composed of 224 places in 310 ms of which 1 ms to minimize.
[2023-03-24 06:49:47] [INFO ] Deduced a trap composed of 234 places in 293 ms of which 0 ms to minimize.
[2023-03-24 06:49:47] [INFO ] Deduced a trap composed of 244 places in 309 ms of which 0 ms to minimize.
[2023-03-24 06:49:48] [INFO ] Deduced a trap composed of 224 places in 303 ms of which 1 ms to minimize.
[2023-03-24 06:49:48] [INFO ] Deduced a trap composed of 236 places in 303 ms of which 1 ms to minimize.
[2023-03-24 06:49:48] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 0 ms to minimize.
[2023-03-24 06:49:49] [INFO ] Deduced a trap composed of 234 places in 316 ms of which 0 ms to minimize.
[2023-03-24 06:49:50] [INFO ] Deduced a trap composed of 235 places in 292 ms of which 0 ms to minimize.
[2023-03-24 06:49:53] [INFO ] Deduced a trap composed of 230 places in 311 ms of which 2 ms to minimize.
[2023-03-24 06:49:54] [INFO ] Deduced a trap composed of 218 places in 292 ms of which 0 ms to minimize.
[2023-03-24 06:49:55] [INFO ] Deduced a trap composed of 230 places in 307 ms of which 0 ms to minimize.
[2023-03-24 06:49:55] [INFO ] Deduced a trap composed of 232 places in 299 ms of which 0 ms to minimize.
[2023-03-24 06:49:55] [INFO ] Deduced a trap composed of 230 places in 307 ms of which 0 ms to minimize.
[2023-03-24 06:49:56] [INFO ] Deduced a trap composed of 228 places in 296 ms of which 0 ms to minimize.
[2023-03-24 06:49:56] [INFO ] Deduced a trap composed of 224 places in 300 ms of which 0 ms to minimize.
[2023-03-24 06:49:57] [INFO ] Deduced a trap composed of 220 places in 298 ms of which 0 ms to minimize.
[2023-03-24 06:49:57] [INFO ] Deduced a trap composed of 224 places in 303 ms of which 1 ms to minimize.
[2023-03-24 06:49:58] [INFO ] Deduced a trap composed of 228 places in 307 ms of which 1 ms to minimize.
[2023-03-24 06:49:58] [INFO ] Deduced a trap composed of 230 places in 302 ms of which 1 ms to minimize.
[2023-03-24 06:49:58] [INFO ] Deduced a trap composed of 232 places in 315 ms of which 0 ms to minimize.
[2023-03-24 06:49:59] [INFO ] Deduced a trap composed of 228 places in 304 ms of which 0 ms to minimize.
[2023-03-24 06:49:59] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 1 ms to minimize.
[2023-03-24 06:49:59] [INFO ] Deduced a trap composed of 238 places in 290 ms of which 0 ms to minimize.
[2023-03-24 06:50:00] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 5 ms to minimize.
[2023-03-24 06:50:00] [INFO ] Deduced a trap composed of 230 places in 307 ms of which 1 ms to minimize.
[2023-03-24 06:50:00] [INFO ] Deduced a trap composed of 224 places in 301 ms of which 2 ms to minimize.
[2023-03-24 06:50:01] [INFO ] Deduced a trap composed of 230 places in 302 ms of which 1 ms to minimize.
[2023-03-24 06:50:01] [INFO ] Deduced a trap composed of 222 places in 294 ms of which 0 ms to minimize.
[2023-03-24 06:50:02] [INFO ] Deduced a trap composed of 234 places in 303 ms of which 0 ms to minimize.
[2023-03-24 06:50:02] [INFO ] Deduced a trap composed of 236 places in 291 ms of which 1 ms to minimize.
[2023-03-24 06:50:02] [INFO ] Deduced a trap composed of 236 places in 299 ms of which 2 ms to minimize.
[2023-03-24 06:50:03] [INFO ] Deduced a trap composed of 224 places in 304 ms of which 1 ms to minimize.
[2023-03-24 06:50:03] [INFO ] Deduced a trap composed of 228 places in 302 ms of which 3 ms to minimize.
[2023-03-24 06:50:03] [INFO ] Deduced a trap composed of 228 places in 301 ms of which 1 ms to minimize.
[2023-03-24 06:50:04] [INFO ] Deduced a trap composed of 230 places in 295 ms of which 1 ms to minimize.
[2023-03-24 06:50:04] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 0 ms to minimize.
[2023-03-24 06:50:04] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 1 ms to minimize.
[2023-03-24 06:50:05] [INFO ] Deduced a trap composed of 228 places in 294 ms of which 1 ms to minimize.
[2023-03-24 06:50:05] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 0 ms to minimize.
[2023-03-24 06:50:05] [INFO ] Deduced a trap composed of 224 places in 309 ms of which 0 ms to minimize.
[2023-03-24 06:50:06] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2023-03-24 06:50:06] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 0 ms to minimize.
[2023-03-24 06:50:06] [INFO ] Deduced a trap composed of 238 places in 283 ms of which 1 ms to minimize.
[2023-03-24 06:50:07] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 1 ms to minimize.
[2023-03-24 06:50:07] [INFO ] Deduced a trap composed of 240 places in 296 ms of which 1 ms to minimize.
[2023-03-24 06:50:07] [INFO ] Deduced a trap composed of 224 places in 307 ms of which 0 ms to minimize.
[2023-03-24 06:50:08] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 1 ms to minimize.
[2023-03-24 06:50:08] [INFO ] Deduced a trap composed of 226 places in 300 ms of which 0 ms to minimize.
[2023-03-24 06:50:08] [INFO ] Deduced a trap composed of 228 places in 302 ms of which 0 ms to minimize.
[2023-03-24 06:50:09] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 1 ms to minimize.
[2023-03-24 06:50:09] [INFO ] Deduced a trap composed of 234 places in 301 ms of which 0 ms to minimize.
[2023-03-24 06:50:09] [INFO ] Deduced a trap composed of 224 places in 291 ms of which 1 ms to minimize.
[2023-03-24 06:50:10] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 1 ms to minimize.
[2023-03-24 06:50:10] [INFO ] Deduced a trap composed of 220 places in 284 ms of which 1 ms to minimize.
[2023-03-24 06:50:10] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 0 ms to minimize.
[2023-03-24 06:50:11] [INFO ] Deduced a trap composed of 230 places in 310 ms of which 1 ms to minimize.
[2023-03-24 06:50:11] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 1 ms to minimize.
[2023-03-24 06:50:14] [INFO ] Deduced a trap composed of 228 places in 296 ms of which 1 ms to minimize.
[2023-03-24 06:50:14] [INFO ] Deduced a trap composed of 230 places in 315 ms of which 0 ms to minimize.
[2023-03-24 06:50:15] [INFO ] Deduced a trap composed of 226 places in 302 ms of which 0 ms to minimize.
[2023-03-24 06:50:15] [INFO ] Deduced a trap composed of 224 places in 300 ms of which 1 ms to minimize.
[2023-03-24 06:50:24] [INFO ] Trap strengthening (SAT) tested/added 144/144 trap constraints in 69115 ms
[2023-03-24 06:50:25] [INFO ] After 70597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 06:50:25] [INFO ] After 70729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-PT-S10J30-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 620 transition count 1289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 72 place count 618 transition count 1257
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 583 transition count 1254
Applied a total of 142 rules in 196 ms. Remains 583 /664 variables (removed 81) and now considering 1254/1325 (removed 71) transitions.
[2023-03-24 06:50:26] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-24 06:50:26] [INFO ] Computed 82 place invariants in 19 ms
[2023-03-24 06:50:26] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
[2023-03-24 06:50:26] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:26] [INFO ] Invariant cache hit.
[2023-03-24 06:50:27] [INFO ] Implicit Places using invariants in 726 ms returned []
[2023-03-24 06:50:27] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:27] [INFO ] Invariant cache hit.
[2023-03-24 06:50:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:50:35] [INFO ] Implicit Places using invariants and state equation in 7602 ms returned []
Implicit Place search using SMT with State Equation took 8330 ms to find 0 implicit places.
[2023-03-24 06:50:35] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-24 06:50:35] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:35] [INFO ] Invariant cache hit.
[2023-03-24 06:50:36] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/664 places, 1254/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10319 ms. Remains : 583/664 places, 1254/1325 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s251 1) (LT s327 1)), p1:(AND (GEQ s3 1) (GEQ s187 1)), p2:(LT s255 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6844 reset in 811 ms.
Product exploration explored 100000 steps with 6845 reset in 734 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 : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 9 factoid took 530 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 682 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:50:38] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:38] [INFO ] Invariant cache hit.
[2023-03-24 06:50:38] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 06:50:38] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 24 ms returned sat
[2023-03-24 06:50:38] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 654 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 38 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-24 06:50:39] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:39] [INFO ] Invariant cache hit.
[2023-03-24 06:50:40] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
[2023-03-24 06:50:40] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:40] [INFO ] Invariant cache hit.
[2023-03-24 06:50:41] [INFO ] Implicit Places using invariants in 748 ms returned []
[2023-03-24 06:50:41] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:41] [INFO ] Invariant cache hit.
[2023-03-24 06:50:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:50:49] [INFO ] Implicit Places using invariants and state equation in 7508 ms returned []
Implicit Place search using SMT with State Equation took 8259 ms to find 0 implicit places.
[2023-03-24 06:50:49] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-24 06:50:49] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:49] [INFO ] Invariant cache hit.
[2023-03-24 06:50:49] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10059 ms. Remains : 583/583 places, 1254/1254 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 : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 682 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:50:50] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:50] [INFO ] Invariant cache hit.
[2023-03-24 06:50:50] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-24 06:50:50] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2023-03-24 06:50:50] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:50:50] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-24 06:50:50] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 24 ms returned sat
[2023-03-24 06:50:51] [INFO ] After 1101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:50:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:50:52] [INFO ] After 275ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 06:50:54] [INFO ] Deduced a trap composed of 250 places in 378 ms of which 1 ms to minimize.
[2023-03-24 06:50:54] [INFO ] Deduced a trap composed of 246 places in 353 ms of which 0 ms to minimize.
[2023-03-24 06:50:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 884 ms
[2023-03-24 06:50:54] [INFO ] After 2844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-24 06:50:54] [INFO ] After 4191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 583 transition count 1252
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 581 transition count 1252
Applied a total of 4 rules in 41 ms. Remains 581 /583 variables (removed 2) and now considering 1252/1254 (removed 2) transitions.
[2023-03-24 06:50:54] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:50:54] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-24 06:50:55] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1091 ms. Remains : 581/583 places, 1252/1254 transitions.
Finished random walk after 75 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 268 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 6852 reset in 647 ms.
Product exploration explored 100000 steps with 6850 reset in 648 ms.
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 28 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-24 06:50:57] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-24 06:50:57] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-24 06:50:58] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
[2023-03-24 06:50:58] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:58] [INFO ] Invariant cache hit.
[2023-03-24 06:50:59] [INFO ] Implicit Places using invariants in 749 ms returned []
[2023-03-24 06:50:59] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:50:59] [INFO ] Invariant cache hit.
[2023-03-24 06:50:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:51:11] [INFO ] Implicit Places using invariants and state equation in 12229 ms returned []
Implicit Place search using SMT with State Equation took 12979 ms to find 0 implicit places.
[2023-03-24 06:51:11] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-24 06:51:11] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-24 06:51:11] [INFO ] Invariant cache hit.
[2023-03-24 06:51:12] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14764 ms. Remains : 583/583 places, 1254/1254 transitions.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-00 finished in 46917 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)||G(p1)))'
Support contains 363 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 664 transition count 1321
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 660 transition count 1321
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 8 place count 660 transition count 1286
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 625 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 624 transition count 1285
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 624 transition count 1285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 623 transition count 1284
Applied a total of 82 rules in 99 ms. Remains 623 /664 variables (removed 41) and now considering 1284/1325 (removed 41) transitions.
[2023-03-24 06:51:12] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
// Phase 1: matrix 1275 rows 623 cols
[2023-03-24 06:51:12] [INFO ] Computed 92 place invariants in 16 ms
[2023-03-24 06:51:13] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
[2023-03-24 06:51:13] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-24 06:51:13] [INFO ] Invariant cache hit.
[2023-03-24 06:51:14] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-24 06:51:14] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-24 06:51:14] [INFO ] Invariant cache hit.
[2023-03-24 06:51:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:51:19] [INFO ] Implicit Places using invariants and state equation in 4710 ms returned []
Implicit Place search using SMT with State Equation took 5231 ms to find 0 implicit places.
[2023-03-24 06:51:19] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-24 06:51:19] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-24 06:51:19] [INFO ] Invariant cache hit.
[2023-03-24 06:51:20] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/664 places, 1284/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7331 ms. Remains : 623/664 places, 1284/1325 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s135 1) (GEQ s572 1)) (AND (GEQ s441 1) (GEQ s555 1)) (AND (GEQ s165 1) (GEQ s485 1)) (AND (GEQ s19 1) (GEQ s47 1)) (AND (GEQ s256 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-01 finished in 7425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 12 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 84 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-24 06:51:20] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-24 06:51:20] [INFO ] Computed 82 place invariants in 33 ms
[2023-03-24 06:51:21] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
[2023-03-24 06:51:21] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:51:21] [INFO ] Invariant cache hit.
[2023-03-24 06:51:21] [INFO ] Implicit Places using invariants in 662 ms returned []
[2023-03-24 06:51:21] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:51:21] [INFO ] Invariant cache hit.
[2023-03-24 06:51:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:51:30] [INFO ] Implicit Places using invariants and state equation in 8952 ms returned []
Implicit Place search using SMT with State Equation took 9616 ms to find 0 implicit places.
[2023-03-24 06:51:30] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-24 06:51:30] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:51:30] [INFO ] Invariant cache hit.
[2023-03-24 06:51:31] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11514 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s88 8) (GEQ s333 2) (GEQ s511 1)) (AND (GEQ s88 8) (GEQ s96 1) (GEQ s182 1) (GEQ s511 1)) (AND (GEQ s88 8) (GEQ s98 1) (GEQ s411 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-02 finished in 11567 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 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 654 transition count 1292
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 621 transition count 1291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 620 transition count 1291
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 68 place count 620 transition count 1257
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 584 transition count 1255
Applied a total of 140 rules in 89 ms. Remains 584 /664 variables (removed 80) and now considering 1255/1325 (removed 70) transitions.
[2023-03-24 06:51:31] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2023-03-24 06:51:31] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-24 06:51:32] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
[2023-03-24 06:51:32] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-24 06:51:32] [INFO ] Invariant cache hit.
[2023-03-24 06:51:33] [INFO ] Implicit Places using invariants in 715 ms returned []
[2023-03-24 06:51:33] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-24 06:51:33] [INFO ] Invariant cache hit.
[2023-03-24 06:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:51:42] [INFO ] Implicit Places using invariants and state equation in 8912 ms returned []
Implicit Place search using SMT with State Equation took 9628 ms to find 0 implicit places.
[2023-03-24 06:51:42] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-24 06:51:42] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-24 06:51:42] [INFO ] Invariant cache hit.
[2023-03-24 06:51:43] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/664 places, 1255/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11415 ms. Remains : 584/664 places, 1255/1325 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-03 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:(AND (GEQ s122 1) (LT s494 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]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-03 finished in 11501 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&&G((p1 U !p2)))))'
Support contains 36 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 581 transition count 1252
Applied a total of 146 rules in 106 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-24 06:51:43] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:51:43] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-24 06:51:44] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
[2023-03-24 06:51:44] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:51:44] [INFO ] Invariant cache hit.
[2023-03-24 06:51:44] [INFO ] Implicit Places using invariants in 755 ms returned []
[2023-03-24 06:51:44] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:51:44] [INFO ] Invariant cache hit.
[2023-03-24 06:51:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:51:52] [INFO ] Implicit Places using invariants and state equation in 8068 ms returned []
Implicit Place search using SMT with State Equation took 8824 ms to find 0 implicit places.
[2023-03-24 06:51:52] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-24 06:51:52] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:51:52] [INFO ] Invariant cache hit.
[2023-03-24 06:51:53] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10531 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s67 1) (GEQ s144 1) (GEQ s534 1)) (AND (GEQ s67 1) (GEQ s483 1) (GEQ s534 1)) (AND (GEQ s67 1) (GEQ s92 1) (GEQ s534 1)) (AND (GEQ s67 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-04 finished in 10693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||(F(p2)&&X(p1))))'
Support contains 54 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 26 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:51:53] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-24 06:51:53] [INFO ] Computed 82 place invariants in 17 ms
[2023-03-24 06:51:55] [INFO ] Dead Transitions using invariants and state equation in 1263 ms found 0 transitions.
[2023-03-24 06:51:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:51:55] [INFO ] Invariant cache hit.
[2023-03-24 06:51:55] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-24 06:51:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:51:55] [INFO ] Invariant cache hit.
[2023-03-24 06:51:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:52:00] [INFO ] Implicit Places using invariants and state equation in 4716 ms returned []
Implicit Place search using SMT with State Equation took 5264 ms to find 0 implicit places.
[2023-03-24 06:52:00] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:52:00] [INFO ] Invariant cache hit.
[2023-03-24 06:52:01] [INFO ] Dead Transitions using invariants and state equation in 1261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7827 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s102 7) (GEQ s180 1) (GEQ s511 1) (GEQ s572 1) (GEQ s647 1)) (AND (GEQ s102 7) (GEQ s111 2) (GEQ s437 1) (GEQ s572 1)) (AND (GEQ s102 7) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-07 finished in 8159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 75 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-24 06:52:02] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-24 06:52:02] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-24 06:52:02] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
[2023-03-24 06:52:02] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:02] [INFO ] Invariant cache hit.
[2023-03-24 06:52:03] [INFO ] Implicit Places using invariants in 761 ms returned []
[2023-03-24 06:52:03] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:03] [INFO ] Invariant cache hit.
[2023-03-24 06:52:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:52:10] [INFO ] Implicit Places using invariants and state equation in 7164 ms returned []
Implicit Place search using SMT with State Equation took 7926 ms to find 0 implicit places.
[2023-03-24 06:52:10] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-24 06:52:10] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:10] [INFO ] Invariant cache hit.
[2023-03-24 06:52:11] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9729 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s119 1) (GEQ s299 1) (GEQ s310 1)), p1:(LT s357 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7232 reset in 774 ms.
Product exploration explored 100000 steps with 7298 reset in 812 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 : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 326 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 722 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:52:13] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:13] [INFO ] Invariant cache hit.
[2023-03-24 06:52:14] [INFO ] [Real]Absence check using 62 positive place invariants in 12 ms returned sat
[2023-03-24 06:52:14] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 25 ms returned sat
[2023-03-24 06:52:14] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 412 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Support contains 1 out of 582 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 32 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-24 06:52:14] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:14] [INFO ] Invariant cache hit.
[2023-03-24 06:52:15] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
[2023-03-24 06:52:15] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:15] [INFO ] Invariant cache hit.
[2023-03-24 06:52:16] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-24 06:52:16] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:16] [INFO ] Invariant cache hit.
[2023-03-24 06:52:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:52:23] [INFO ] Implicit Places using invariants and state equation in 7797 ms returned []
Implicit Place search using SMT with State Equation took 8521 ms to find 0 implicit places.
[2023-03-24 06:52:23] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-24 06:52:23] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:23] [INFO ] Invariant cache hit.
[2023-03-24 06:52:24] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10191 ms. Remains : 582/582 places, 1253/1253 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Finished random walk after 42 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7216 reset in 737 ms.
Product exploration explored 100000 steps with 7303 reset in 770 ms.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 25 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-24 06:52:26] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:26] [INFO ] Invariant cache hit.
[2023-03-24 06:52:27] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
[2023-03-24 06:52:27] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:27] [INFO ] Invariant cache hit.
[2023-03-24 06:52:28] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-24 06:52:28] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:28] [INFO ] Invariant cache hit.
[2023-03-24 06:52:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:52:35] [INFO ] Implicit Places using invariants and state equation in 7705 ms returned []
Implicit Place search using SMT with State Equation took 8440 ms to find 0 implicit places.
[2023-03-24 06:52:36] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-24 06:52:36] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-24 06:52:36] [INFO ] Invariant cache hit.
[2023-03-24 06:52:36] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10032 ms. Remains : 582/582 places, 1253/1253 transitions.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-10 finished in 34868 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((p0 U ((p1 U p2)||F((p3||X(p3)))))))'
Support contains 10 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 655 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 654 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 654 transition count 1324
Applied a total of 11 rules in 27 ms. Remains 654 /664 variables (removed 10) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:52:36] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 654 cols
[2023-03-24 06:52:36] [INFO ] Computed 83 place invariants in 15 ms
[2023-03-24 06:52:38] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
[2023-03-24 06:52:38] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:52:38] [INFO ] Invariant cache hit.
[2023-03-24 06:52:38] [INFO ] Implicit Places using invariants in 774 ms returned []
[2023-03-24 06:52:38] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:52:38] [INFO ] Invariant cache hit.
[2023-03-24 06:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:52:47] [INFO ] Implicit Places using invariants and state equation in 8525 ms returned []
Implicit Place search using SMT with State Equation took 9300 ms to find 0 implicit places.
[2023-03-24 06:52:47] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:52:47] [INFO ] Invariant cache hit.
[2023-03-24 06:52:48] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11757 ms. Remains : 654/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(LT s475 1), p2:(AND (GEQ s102 1) (GEQ s133 1) (GEQ s174 1) (GEQ s599 1)), p1:(GEQ s143 1), p0:(AND (GEQ s102 7) (GEQ s181 1) (GEQ s375 1) (GEQ s446 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1036 ms.
Product exploration explored 100000 steps with 50000 reset in 963 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 : [(AND p3 p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))
Knowledge based reduction with 10 factoid took 153 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J30-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-12 finished in 14111 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(F(p0))||(!p0&&F(p0))))))'
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 24 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:52:51] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-24 06:52:51] [INFO ] Computed 82 place invariants in 19 ms
[2023-03-24 06:52:52] [INFO ] Dead Transitions using invariants and state equation in 1281 ms found 0 transitions.
[2023-03-24 06:52:52] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:52:52] [INFO ] Invariant cache hit.
[2023-03-24 06:52:53] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-24 06:52:53] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:52:53] [INFO ] Invariant cache hit.
[2023-03-24 06:52:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:53:01] [INFO ] Implicit Places using invariants and state equation in 8880 ms returned []
Implicit Place search using SMT with State Equation took 9654 ms to find 0 implicit places.
[2023-03-24 06:53:01] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:53:01] [INFO ] Invariant cache hit.
[2023-03-24 06:53:03] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12177 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s79 1) (GEQ s141 1) (GEQ s603 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-13 finished in 12291 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)||(p1 U X(p2)))))'
Support contains 7 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 29 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:53:03] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:53:03] [INFO ] Invariant cache hit.
[2023-03-24 06:53:04] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
[2023-03-24 06:53:04] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:53:04] [INFO ] Invariant cache hit.
[2023-03-24 06:53:05] [INFO ] Implicit Places using invariants in 777 ms returned []
[2023-03-24 06:53:05] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:53:05] [INFO ] Invariant cache hit.
[2023-03-24 06:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:53:15] [INFO ] Implicit Places using invariants and state equation in 10081 ms returned []
Implicit Place search using SMT with State Equation took 10859 ms to find 0 implicit places.
[2023-03-24 06:53:15] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:53:15] [INFO ] Invariant cache hit.
[2023-03-24 06:53:16] [INFO ] Dead Transitions using invariants and state equation in 1194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13319 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(OR (LT s284 1) (LT s366 1)), p1:(OR (AND (GEQ s284 1) (GEQ s366 1)) (NOT (AND (GEQ s102 7) (GEQ s111 1) (GEQ s437 1) (GEQ s462 1) (GEQ s572 1)))), p2:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-14 finished in 13526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-24 06:53:17] [INFO ] Flatten gal took : 79 ms
[2023-03-24 06:53:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-24 06:53:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1325 transitions and 8384 arcs took 8 ms.
Total runtime 348357 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2158/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2158/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-00
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLFireability-10

BK_STOP 1679640799548

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-00
ltl formula formula --ltl=/tmp/2158/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 664 places, 1325 transitions and 8384 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.490 real 0.070 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2158/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2158/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2158/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2158/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
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) [0x55ae946853f4]
1: pnml2lts-mc(+0xa2496) [0x55ae94685496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f83dc1b0140]
3: pnml2lts-mc(+0x405be5) [0x55ae949e8be5]
4: pnml2lts-mc(+0x16b3f9) [0x55ae9474e3f9]
5: pnml2lts-mc(+0x164ac4) [0x55ae94747ac4]
6: pnml2lts-mc(+0x272e0a) [0x55ae94855e0a]
7: pnml2lts-mc(+0xb61f0) [0x55ae946991f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f83dc0034d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f83dc00367a]
10: pnml2lts-mc(+0xa1581) [0x55ae94684581]
11: pnml2lts-mc(+0xa1910) [0x55ae94684910]
12: pnml2lts-mc(+0xa32a2) [0x55ae946862a2]
13: pnml2lts-mc(+0xa50f4) [0x55ae946880f4]
14: pnml2lts-mc(+0xa516b) [0x55ae9468816b]
15: pnml2lts-mc(+0x3f34b3) [0x55ae949d64b3]
16: pnml2lts-mc(+0x7c63d) [0x55ae9465f63d]
17: pnml2lts-mc(+0x67d86) [0x55ae9464ad86]
18: pnml2lts-mc(+0x60a8a) [0x55ae94643a8a]
19: pnml2lts-mc(+0x5eb15) [0x55ae94641b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f83dbfebd0a]
21: pnml2lts-mc(+0x6075e) [0x55ae9464375e]
ltl formula name PolyORBNT-PT-S10J30-LTLFireability-10
ltl formula formula --ltl=/tmp/2158/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 664 places, 1325 transitions and 8384 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.470 real 0.070 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2158/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2158/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2158/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2158/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="PolyORBNT-PT-S10J30"
export BK_EXAMINATION="LTLFireability"
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 PolyORBNT-PT-S10J30, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950900764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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