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.r263-smll-167863538500627.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 lolaxred
Input is Peterson-PT-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538500627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 139K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 565K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 584K Feb 25 22:22 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 64K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 161K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 841K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K 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 Peterson-PT-5-LTLCardinality-00
FORMULA_NAME Peterson-PT-5-LTLCardinality-01
FORMULA_NAME Peterson-PT-5-LTLCardinality-02
FORMULA_NAME Peterson-PT-5-LTLCardinality-03
FORMULA_NAME Peterson-PT-5-LTLCardinality-04
FORMULA_NAME Peterson-PT-5-LTLCardinality-05
FORMULA_NAME Peterson-PT-5-LTLCardinality-06
FORMULA_NAME Peterson-PT-5-LTLCardinality-07
FORMULA_NAME Peterson-PT-5-LTLCardinality-08
FORMULA_NAME Peterson-PT-5-LTLCardinality-09
FORMULA_NAME Peterson-PT-5-LTLCardinality-10
FORMULA_NAME Peterson-PT-5-LTLCardinality-11
FORMULA_NAME Peterson-PT-5-LTLCardinality-12
FORMULA_NAME Peterson-PT-5-LTLCardinality-13
FORMULA_NAME Peterson-PT-5-LTLCardinality-14
FORMULA_NAME Peterson-PT-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678864163976

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 07:09:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 07:09:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:09:28] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2023-03-15 07:09:28] [INFO ] Transformed 834 places.
[2023-03-15 07:09:28] [INFO ] Transformed 1242 transitions.
[2023-03-15 07:09:28] [INFO ] Found NUPN structural information;
[2023-03-15 07:09:28] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2023-03-15 07:09:28] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 65 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-5-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 794 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 49 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:09:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 07:09:28] [INFO ] Computed 23 place invariants in 46 ms
[2023-03-15 07:09:29] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2023-03-15 07:09:30] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:09:30] [INFO ] Invariant cache hit.
[2023-03-15 07:09:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:09:31] [INFO ] Implicit Places using invariants and state equation in 1994 ms returned []
Implicit Place search using SMT with State Equation took 3201 ms to find 0 implicit places.
[2023-03-15 07:09:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:09:32] [INFO ] Invariant cache hit.
[2023-03-15 07:09:33] [INFO ] Dead Transitions using invariants and state equation in 1432 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4693 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 794 out of 834 places after structural reductions.
[2023-03-15 07:09:34] [INFO ] Flatten gal took : 179 ms
[2023-03-15 07:09:34] [INFO ] Flatten gal took : 93 ms
[2023-03-15 07:09:34] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 07:09:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:09:35] [INFO ] Invariant cache hit.
[2023-03-15 07:09:35] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-15 07:09:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 07:09:36] [INFO ] After 1232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 07:09:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 30 ms returned sat
[2023-03-15 07:09:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-15 07:09:37] [INFO ] After 791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 07:09:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:09:37] [INFO ] After 291ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 07:09:38] [INFO ] Deduced a trap composed of 32 places in 529 ms of which 8 ms to minimize.
[2023-03-15 07:09:39] [INFO ] Deduced a trap composed of 32 places in 544 ms of which 3 ms to minimize.
[2023-03-15 07:09:39] [INFO ] Deduced a trap composed of 82 places in 654 ms of which 3 ms to minimize.
[2023-03-15 07:09:40] [INFO ] Deduced a trap composed of 96 places in 453 ms of which 2 ms to minimize.
[2023-03-15 07:09:41] [INFO ] Deduced a trap composed of 11 places in 538 ms of which 2 ms to minimize.
[2023-03-15 07:09:41] [INFO ] Deduced a trap composed of 58 places in 570 ms of which 2 ms to minimize.
[2023-03-15 07:09:42] [INFO ] Deduced a trap composed of 49 places in 575 ms of which 2 ms to minimize.
[2023-03-15 07:09:43] [INFO ] Deduced a trap composed of 37 places in 525 ms of which 2 ms to minimize.
[2023-03-15 07:09:43] [INFO ] Deduced a trap composed of 65 places in 384 ms of which 1 ms to minimize.
[2023-03-15 07:09:43] [INFO ] Deduced a trap composed of 18 places in 365 ms of which 1 ms to minimize.
[2023-03-15 07:09:44] [INFO ] Deduced a trap composed of 11 places in 494 ms of which 1 ms to minimize.
[2023-03-15 07:09:44] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 1 ms to minimize.
[2023-03-15 07:09:45] [INFO ] Deduced a trap composed of 11 places in 494 ms of which 1 ms to minimize.
[2023-03-15 07:09:45] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 1 ms to minimize.
[2023-03-15 07:09:46] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 1 ms to minimize.
[2023-03-15 07:09:46] [INFO ] Deduced a trap composed of 82 places in 289 ms of which 1 ms to minimize.
[2023-03-15 07:09:46] [INFO ] Deduced a trap composed of 56 places in 295 ms of which 1 ms to minimize.
[2023-03-15 07:09:47] [INFO ] Deduced a trap composed of 18 places in 379 ms of which 2 ms to minimize.
[2023-03-15 07:09:47] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 1 ms to minimize.
[2023-03-15 07:09:48] [INFO ] Deduced a trap composed of 104 places in 546 ms of which 1 ms to minimize.
[2023-03-15 07:09:49] [INFO ] Deduced a trap composed of 131 places in 614 ms of which 1 ms to minimize.
[2023-03-15 07:09:49] [INFO ] Deduced a trap composed of 99 places in 444 ms of which 2 ms to minimize.
[2023-03-15 07:09:50] [INFO ] Deduced a trap composed of 76 places in 434 ms of which 1 ms to minimize.
[2023-03-15 07:09:50] [INFO ] Deduced a trap composed of 130 places in 486 ms of which 1 ms to minimize.
[2023-03-15 07:09:51] [INFO ] Deduced a trap composed of 101 places in 495 ms of which 2 ms to minimize.
[2023-03-15 07:09:51] [INFO ] Deduced a trap composed of 130 places in 474 ms of which 1 ms to minimize.
[2023-03-15 07:09:52] [INFO ] Deduced a trap composed of 184 places in 465 ms of which 1 ms to minimize.
[2023-03-15 07:09:52] [INFO ] Deduced a trap composed of 184 places in 415 ms of which 0 ms to minimize.
[2023-03-15 07:09:53] [INFO ] Deduced a trap composed of 82 places in 405 ms of which 1 ms to minimize.
[2023-03-15 07:09:54] [INFO ] Deduced a trap composed of 58 places in 461 ms of which 1 ms to minimize.
[2023-03-15 07:09:54] [INFO ] Deduced a trap composed of 92 places in 487 ms of which 1 ms to minimize.
[2023-03-15 07:09:55] [INFO ] Deduced a trap composed of 58 places in 473 ms of which 2 ms to minimize.
[2023-03-15 07:09:56] [INFO ] Deduced a trap composed of 108 places in 488 ms of which 3 ms to minimize.
[2023-03-15 07:09:56] [INFO ] Deduced a trap composed of 108 places in 512 ms of which 2 ms to minimize.
[2023-03-15 07:09:57] [INFO ] Deduced a trap composed of 115 places in 446 ms of which 1 ms to minimize.
[2023-03-15 07:09:57] [INFO ] Deduced a trap composed of 201 places in 496 ms of which 2 ms to minimize.
[2023-03-15 07:09:58] [INFO ] Deduced a trap composed of 134 places in 517 ms of which 2 ms to minimize.
[2023-03-15 07:09:58] [INFO ] Deduced a trap composed of 201 places in 491 ms of which 1 ms to minimize.
[2023-03-15 07:09:59] [INFO ] Deduced a trap composed of 115 places in 498 ms of which 2 ms to minimize.
[2023-03-15 07:10:00] [INFO ] Deduced a trap composed of 43 places in 577 ms of which 5 ms to minimize.
[2023-03-15 07:10:01] [INFO ] Deduced a trap composed of 73 places in 583 ms of which 1 ms to minimize.
[2023-03-15 07:10:01] [INFO ] Deduced a trap composed of 63 places in 635 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:10:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:10:01] [INFO ] After 25511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 57 ms.
Support contains 6 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 174 Pre rules applied. Total rules applied 720 place count 474 transition count 708
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 1068 place count 300 transition count 708
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1128 place count 270 transition count 678
Applied a total of 1128 rules in 210 ms. Remains 270 /834 variables (removed 564) and now considering 678/1242 (removed 564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 270/834 places, 678/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 750680 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 750680 steps, saw 108830 distinct states, run finished after 3004 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 07:10:05] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 270 cols
[2023-03-15 07:10:05] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-15 07:10:05] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 07:10:05] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 07:10:05] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 07:10:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 07:10:06] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 07:10:06] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 07:10:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:10:06] [INFO ] After 135ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 07:10:06] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 1 ms to minimize.
[2023-03-15 07:10:06] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2023-03-15 07:10:07] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-15 07:10:07] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-15 07:10:07] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 2 ms to minimize.
[2023-03-15 07:10:07] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 1 ms to minimize.
[2023-03-15 07:10:07] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 0 ms to minimize.
[2023-03-15 07:10:08] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2023-03-15 07:10:08] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2023-03-15 07:10:08] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-15 07:10:08] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2023-03-15 07:10:08] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2023-03-15 07:10:08] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:10:09] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:10:09] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:10:09] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:10:09] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 0 ms to minimize.
[2023-03-15 07:10:09] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 1 ms to minimize.
[2023-03-15 07:10:09] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2023-03-15 07:10:10] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:10:10] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:10:10] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 2 ms to minimize.
[2023-03-15 07:10:10] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 1 ms to minimize.
[2023-03-15 07:10:11] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 4 ms to minimize.
[2023-03-15 07:10:11] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:10:11] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2023-03-15 07:10:11] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2023-03-15 07:10:11] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:10:11] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:10:12] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 1 ms to minimize.
[2023-03-15 07:10:12] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 1 ms to minimize.
[2023-03-15 07:10:12] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2023-03-15 07:10:12] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 1 ms to minimize.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 1 ms to minimize.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 1 ms to minimize.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:10:13] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 1 ms to minimize.
[2023-03-15 07:10:14] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2023-03-15 07:10:14] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 1 ms to minimize.
[2023-03-15 07:10:14] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-15 07:10:14] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2023-03-15 07:10:15] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 1 ms to minimize.
[2023-03-15 07:10:15] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:10:15] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 0 ms to minimize.
[2023-03-15 07:10:15] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 1 ms to minimize.
[2023-03-15 07:10:16] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 1 ms to minimize.
[2023-03-15 07:10:16] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 0 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 0 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 1 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 0 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 1 ms to minimize.
[2023-03-15 07:10:17] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 1 ms to minimize.
[2023-03-15 07:10:18] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2023-03-15 07:10:18] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2023-03-15 07:10:18] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2023-03-15 07:10:18] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 1 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 1 ms to minimize.
[2023-03-15 07:10:19] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2023-03-15 07:10:20] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:10:20] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2023-03-15 07:10:20] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 1 ms to minimize.
[2023-03-15 07:10:20] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 1 ms to minimize.
[2023-03-15 07:10:21] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 0 ms to minimize.
[2023-03-15 07:10:21] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 1 ms to minimize.
[2023-03-15 07:10:21] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2023-03-15 07:10:21] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2023-03-15 07:10:21] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 1 ms to minimize.
[2023-03-15 07:10:22] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 1 ms to minimize.
[2023-03-15 07:10:22] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 0 ms to minimize.
[2023-03-15 07:10:22] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2023-03-15 07:10:22] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:10:22] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:10:22] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:10:23] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 1 ms to minimize.
[2023-03-15 07:10:24] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 1 ms to minimize.
[2023-03-15 07:10:24] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-15 07:10:24] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 1 ms to minimize.
[2023-03-15 07:10:24] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 1 ms to minimize.
[2023-03-15 07:10:25] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 1 ms to minimize.
[2023-03-15 07:10:25] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 0 ms to minimize.
[2023-03-15 07:10:25] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 1 ms to minimize.
[2023-03-15 07:10:26] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 1 ms to minimize.
[2023-03-15 07:10:26] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2023-03-15 07:10:26] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 1 ms to minimize.
[2023-03-15 07:10:26] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2023-03-15 07:10:28] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2023-03-15 07:10:28] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 1 ms to minimize.
[2023-03-15 07:10:28] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:10:29] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:10:29] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 1 ms to minimize.
[2023-03-15 07:10:29] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2023-03-15 07:10:30] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 0 ms to minimize.
[2023-03-15 07:10:30] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2023-03-15 07:10:30] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 1 ms to minimize.
[2023-03-15 07:10:30] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 1 ms to minimize.
[2023-03-15 07:10:31] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-15 07:10:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:10:31] [INFO ] After 25148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 37 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 270/270 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 22 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2023-03-15 07:10:31] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2023-03-15 07:10:31] [INFO ] Invariant cache hit.
[2023-03-15 07:10:31] [INFO ] Implicit Places using invariants in 410 ms returned [229, 241, 242, 243, 244, 245]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 416 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 264/270 places, 678/678 transitions.
Applied a total of 0 rules in 26 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 465 ms. Remains : 264/270 places, 678/678 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 631365 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631365 steps, saw 91795 distinct states, run finished after 3002 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 07:10:34] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2023-03-15 07:10:34] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 07:10:34] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-03-15 07:10:35] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 07:10:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-15 07:10:35] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 07:10:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:10:35] [INFO ] After 75ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 07:10:35] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2023-03-15 07:10:35] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2023-03-15 07:10:35] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2023-03-15 07:10:36] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2023-03-15 07:10:36] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2023-03-15 07:10:36] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 0 ms to minimize.
[2023-03-15 07:10:36] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 1 ms to minimize.
[2023-03-15 07:10:37] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 0 ms to minimize.
[2023-03-15 07:10:37] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:10:37] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:10:37] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:10:38] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 1 ms to minimize.
[2023-03-15 07:10:38] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 1 ms to minimize.
[2023-03-15 07:10:38] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2023-03-15 07:10:38] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2023-03-15 07:10:38] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2023-03-15 07:10:39] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2023-03-15 07:10:39] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2023-03-15 07:10:39] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2023-03-15 07:10:39] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:10:40] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2023-03-15 07:10:40] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 0 ms to minimize.
[2023-03-15 07:10:40] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2023-03-15 07:10:40] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2023-03-15 07:10:40] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 0 ms to minimize.
[2023-03-15 07:10:41] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 1 ms to minimize.
[2023-03-15 07:10:41] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2023-03-15 07:10:41] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:10:41] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 0 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2023-03-15 07:10:42] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 0 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2023-03-15 07:10:43] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2023-03-15 07:10:44] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2023-03-15 07:10:44] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2023-03-15 07:10:44] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2023-03-15 07:10:44] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2023-03-15 07:10:44] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 0 ms to minimize.
[2023-03-15 07:10:45] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2023-03-15 07:10:45] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2023-03-15 07:10:45] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-15 07:10:45] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2023-03-15 07:10:46] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2023-03-15 07:10:46] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:10:46] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-15 07:10:46] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:10:46] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 1 ms to minimize.
[2023-03-15 07:10:46] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 1 ms to minimize.
[2023-03-15 07:10:47] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2023-03-15 07:10:48] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2023-03-15 07:10:48] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:10:48] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 0 ms to minimize.
[2023-03-15 07:10:48] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-15 07:10:48] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2023-03-15 07:10:49] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-15 07:10:49] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2023-03-15 07:10:49] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 0 ms to minimize.
[2023-03-15 07:10:49] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 1 ms to minimize.
[2023-03-15 07:10:50] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2023-03-15 07:10:50] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2023-03-15 07:10:50] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2023-03-15 07:10:50] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 0 ms to minimize.
[2023-03-15 07:10:51] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-15 07:10:51] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-15 07:10:51] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:10:51] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 1 ms to minimize.
[2023-03-15 07:10:51] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2023-03-15 07:10:52] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 1 ms to minimize.
[2023-03-15 07:10:52] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2023-03-15 07:10:52] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
[2023-03-15 07:10:52] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 1 ms to minimize.
[2023-03-15 07:10:52] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 1 ms to minimize.
[2023-03-15 07:10:53] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 0 ms to minimize.
[2023-03-15 07:10:53] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2023-03-15 07:10:53] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:10:53] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:10:53] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 0 ms to minimize.
[2023-03-15 07:10:54] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:10:54] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2023-03-15 07:10:55] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:10:56] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2023-03-15 07:10:56] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:10:56] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:10:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 90 trap constraints in 21056 ms
[2023-03-15 07:10:57] [INFO ] After 22500ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-15 07:10:57] [INFO ] After 22799ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
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' '!(X(G((X(G(p0))||G(p1)||(p1&&F(p2))))))'
Support contains 540 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:10:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 07:10:58] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-15 07:10:58] [INFO ] Implicit Places using invariants in 456 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 460 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 481 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 543 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GT 5 (ADD s381 s382 s383 s384 s385 s386 s387 s388 s393 s394 s396 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 695 ms.
Product exploration explored 100000 steps with 0 reset in 638 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 p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 718 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[true, (OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:11:02] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 07:11:02] [INFO ] Computed 17 place invariants in 6 ms
[2023-03-15 07:11:02] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 07:11:02] [INFO ] After 221ms 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 p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X p0)), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1 (NOT p0))), (F (NOT (AND (NOT p2) p1 p0))), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p1)), (F (AND p2 (NOT p1))), (F (NOT p0)), (F (AND p2 p0)), (F (NOT (AND (NOT p2) p0))), (F (NOT p1)), (F (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))]
Knowledge based reduction with 13 factoid took 837 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 296 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 5 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:11:04] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:04] [INFO ] Invariant cache hit.
[2023-03-15 07:11:04] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-15 07:11:04] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:04] [INFO ] Invariant cache hit.
[2023-03-15 07:11:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:11:06] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
[2023-03-15 07:11:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:06] [INFO ] Invariant cache hit.
[2023-03-15 07:11:07] [INFO ] Dead Transitions using invariants and state equation in 1412 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3720 ms. Remains : 828/828 places, 1242/1242 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 p2) p1), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 613 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:11:09] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:09] [INFO ] Invariant cache hit.
[2023-03-15 07:11:09] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:11:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 07:11:10] [INFO ] After 1206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:11:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:11:12] [INFO ] After 1213ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:11:13] [INFO ] Deduced a trap composed of 68 places in 543 ms of which 1 ms to minimize.
[2023-03-15 07:11:14] [INFO ] Deduced a trap composed of 68 places in 741 ms of which 2 ms to minimize.
[2023-03-15 07:11:15] [INFO ] Deduced a trap composed of 11 places in 603 ms of which 2 ms to minimize.
[2023-03-15 07:11:16] [INFO ] Deduced a trap composed of 28 places in 777 ms of which 2 ms to minimize.
[2023-03-15 07:11:16] [INFO ] Deduced a trap composed of 19 places in 772 ms of which 1 ms to minimize.
[2023-03-15 07:11:17] [INFO ] Deduced a trap composed of 11 places in 767 ms of which 2 ms to minimize.
[2023-03-15 07:11:18] [INFO ] Deduced a trap composed of 31 places in 521 ms of which 1 ms to minimize.
[2023-03-15 07:11:18] [INFO ] Deduced a trap composed of 28 places in 422 ms of which 1 ms to minimize.
[2023-03-15 07:11:19] [INFO ] Deduced a trap composed of 28 places in 577 ms of which 1 ms to minimize.
[2023-03-15 07:11:20] [INFO ] Deduced a trap composed of 28 places in 582 ms of which 1 ms to minimize.
[2023-03-15 07:11:21] [INFO ] Deduced a trap composed of 76 places in 468 ms of which 1 ms to minimize.
[2023-03-15 07:11:21] [INFO ] Deduced a trap composed of 58 places in 493 ms of which 1 ms to minimize.
[2023-03-15 07:11:22] [INFO ] Deduced a trap composed of 79 places in 419 ms of which 1 ms to minimize.
[2023-03-15 07:11:22] [INFO ] Deduced a trap composed of 58 places in 368 ms of which 1 ms to minimize.
[2023-03-15 07:11:23] [INFO ] Deduced a trap composed of 61 places in 366 ms of which 1 ms to minimize.
[2023-03-15 07:11:23] [INFO ] Deduced a trap composed of 58 places in 484 ms of which 2 ms to minimize.
[2023-03-15 07:11:24] [INFO ] Deduced a trap composed of 58 places in 497 ms of which 1 ms to minimize.
[2023-03-15 07:11:25] [INFO ] Deduced a trap composed of 58 places in 496 ms of which 1 ms to minimize.
[2023-03-15 07:11:25] [INFO ] Deduced a trap composed of 115 places in 363 ms of which 1 ms to minimize.
[2023-03-15 07:11:26] [INFO ] Deduced a trap composed of 115 places in 346 ms of which 1 ms to minimize.
[2023-03-15 07:11:26] [INFO ] Deduced a trap composed of 115 places in 341 ms of which 1 ms to minimize.
[2023-03-15 07:11:26] [INFO ] Deduced a trap composed of 115 places in 335 ms of which 2 ms to minimize.
[2023-03-15 07:11:27] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 14100 ms
[2023-03-15 07:11:27] [INFO ] After 16274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 765 ms.
[2023-03-15 07:11:27] [INFO ] After 18518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 510 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 828 transition count 1212
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 798 transition count 1212
Applied a total of 60 rules in 66 ms. Remains 798 /828 variables (removed 30) and now considering 1212/1242 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 798/828 places, 1212/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Finished probabilistic random walk after 278 steps, run visited all 1 properties in 7 ms. (steps per millisecond=39 )
Probabilistic random walk after 278 steps, saw 241 distinct states, run finished after 8 ms. (steps per millisecond=34 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 10 factoid took 809 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 294 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 299 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 511 ms.
Product exploration explored 100000 steps with 0 reset in 409 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 276 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 47 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:11:31] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-15 07:11:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:31] [INFO ] Invariant cache hit.
[2023-03-15 07:11:33] [INFO ] Dead Transitions using invariants and state equation in 1566 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1752 ms. Remains : 828/828 places, 1242/1242 transitions.
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:11:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:33] [INFO ] Invariant cache hit.
[2023-03-15 07:11:33] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-15 07:11:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:33] [INFO ] Invariant cache hit.
[2023-03-15 07:11:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:11:35] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 2399 ms to find 0 implicit places.
[2023-03-15 07:11:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:35] [INFO ] Invariant cache hit.
[2023-03-15 07:11:36] [INFO ] Dead Transitions using invariants and state equation in 1478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3893 ms. Remains : 828/828 places, 1242/1242 transitions.
Treatment of property Peterson-PT-5-LTLCardinality-01 finished in 38866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 30 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 720 place count 474 transition count 726
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 1032 place count 318 transition count 726
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1092 place count 288 transition count 696
Applied a total of 1092 rules in 58 ms. Remains 288 /834 variables (removed 546) and now considering 696/1242 (removed 546) transitions.
[2023-03-15 07:11:37] [INFO ] Flow matrix only has 576 transitions (discarded 120 similar events)
// Phase 1: matrix 576 rows 288 cols
[2023-03-15 07:11:37] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-15 07:11:37] [INFO ] Implicit Places using invariants in 265 ms returned [244, 264, 265, 266, 267, 268]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 269 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/834 places, 696/1242 transitions.
Applied a total of 0 rules in 25 ms. Remains 282 /282 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 282/834 places, 696/1242 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 433 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 62 in 2 ms.
FORMULA Peterson-PT-5-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-02 finished in 844 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 U p2)))))'
Support contains 570 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 31 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:11:38] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 07:11:38] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-15 07:11:38] [INFO ] Implicit Places using invariants in 400 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 402 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 53 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 489 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s517 s518 s519 s520 s522 s525 s526 s527 s528 s529 s530 s531 s532 s533 s534 s535 s536 s537 s538 s539 s540 s605 s606 s607 s608 s609 s610 s611 s6...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2780 reset in 2717 ms.
Stack based approach found an accepted trace after 2641 steps with 69 reset with depth 44 and stack size 44 in 72 ms.
FORMULA Peterson-PT-5-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-03 finished in 3619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 156 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:11:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:41] [INFO ] Invariant cache hit.
[2023-03-15 07:11:42] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-15 07:11:42] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:42] [INFO ] Invariant cache hit.
[2023-03-15 07:11:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:11:44] [INFO ] Implicit Places using invariants and state equation in 2509 ms returned []
Implicit Place search using SMT with State Equation took 2951 ms to find 0 implicit places.
[2023-03-15 07:11:44] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:44] [INFO ] Invariant cache hit.
[2023-03-15 07:11:45] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4362 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(LEQ 3 (ADD s785 s805 s806 s807 s808 s809)), p0:(LEQ (ADD s381 s382 s383 s384 s385 s386 s387 s388 s393 s394 s396 s413 s414 s415 s416 s417 s418 s419 s42...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-5-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLCardinality-04 finished in 4550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 186 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:11:46] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:46] [INFO ] Invariant cache hit.
[2023-03-15 07:11:46] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-15 07:11:46] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:46] [INFO ] Invariant cache hit.
[2023-03-15 07:11:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:11:49] [INFO ] Implicit Places using invariants and state equation in 3114 ms returned []
Implicit Place search using SMT with State Equation took 3777 ms to find 0 implicit places.
[2023-03-15 07:11:49] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:49] [INFO ] Invariant cache hit.
[2023-03-15 07:11:51] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5017 ms. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s573 s574 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-5-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLCardinality-05 finished in 5157 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 U p2)))))'
Support contains 192 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 834 transition count 1032
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 624 transition count 1032
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 420 place count 624 transition count 882
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 780 place count 444 transition count 852
Applied a total of 780 rules in 47 ms. Remains 444 /834 variables (removed 390) and now considering 852/1242 (removed 390) transitions.
[2023-03-15 07:11:51] [INFO ] Flow matrix only has 732 transitions (discarded 120 similar events)
// Phase 1: matrix 732 rows 444 cols
[2023-03-15 07:11:51] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-15 07:11:51] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-15 07:11:51] [INFO ] Flow matrix only has 732 transitions (discarded 120 similar events)
[2023-03-15 07:11:51] [INFO ] Invariant cache hit.
[2023-03-15 07:11:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:11:52] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2023-03-15 07:11:52] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 07:11:52] [INFO ] Flow matrix only has 732 transitions (discarded 120 similar events)
[2023-03-15 07:11:52] [INFO ] Invariant cache hit.
[2023-03-15 07:11:53] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 444/834 places, 852/1242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2024 ms. Remains : 444/834 places, 852/1242 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 3 (ADD s180 s181 s182 s183 s184 s185 s186 s187 s192 s193 s195 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 58 reset in 2309 ms.
Stack based approach found an accepted trace after 2442 steps with 2 reset with depth 969 and stack size 941 in 58 ms.
FORMULA Peterson-PT-5-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-07 finished in 4506 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' '!((p0 U X(p1)))'
Support contains 4 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:11:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 07:11:55] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 07:11:56] [INFO ] Implicit Places using invariants in 486 ms returned [785, 805, 807, 808, 809]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 502 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 829/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 829 /829 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 533 ms. Remains : 829/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (EQ s608 0) (EQ s808 1)), p1:(OR (EQ s804 0) (EQ s162 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 14303 reset in 510 ms.
Stack based approach found an accepted trace after 14392 steps with 2074 reset with depth 8 and stack size 8 in 92 ms.
FORMULA Peterson-PT-5-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-13 finished in 1283 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))'
Support contains 2 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:11:57] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:57] [INFO ] Invariant cache hit.
[2023-03-15 07:11:57] [INFO ] Implicit Places using invariants in 672 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 673 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 702 ms. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s404 0) (NEQ s825 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA Peterson-PT-5-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLCardinality-15 finished in 823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p0))||G(p1)||(p1&&F(p2))))))'
Found a Lengthening insensitive property : Peterson-PT-5-LTLCardinality-01
Stuttering acceptance computed with spot in 313 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Support contains 540 out of 834 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:11:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:11:58] [INFO ] Invariant cache hit.
[2023-03-15 07:11:58] [INFO ] Implicit Places using invariants in 378 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 379 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 411 ms. Remains : 828/834 places, 1242/1242 transitions.
Running random walk in product with property : Peterson-PT-5-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GT 5 (ADD s381 s382 s383 s384 s385 s386 s387 s388 s393 s394 s396 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 313 ms.
Product exploration explored 100000 steps with 0 reset in 448 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 p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 811 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[true, (OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 750 ms. (steps per millisecond=13 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-15 07:12:01] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2023-03-15 07:12:01] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 07:12:02] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-03-15 07:12:02] [INFO ] After 253ms 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 p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X p0)), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1 (NOT p0))), (F (NOT (AND (NOT p2) p1 p0))), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p1)), (F (AND p2 (NOT p1))), (F (NOT p0)), (F (AND p2 p0)), (F (NOT (AND (NOT p2) p0))), (F (NOT p1)), (F (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))]
Knowledge based reduction with 13 factoid took 1092 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 338 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 6 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:12:03] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:03] [INFO ] Invariant cache hit.
[2023-03-15 07:12:04] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-15 07:12:04] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:04] [INFO ] Invariant cache hit.
[2023-03-15 07:12:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:12:06] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
[2023-03-15 07:12:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:06] [INFO ] Invariant cache hit.
[2023-03-15 07:12:07] [INFO ] Dead Transitions using invariants and state equation in 1303 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3686 ms. Remains : 828/828 places, 1242/1242 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 p2) p1), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 646 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4656 steps, including 1 resets, run visited all 10 properties in 34 ms. (steps per millisecond=136 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND p1 p2))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 10 factoid took 998 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 301 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 323 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 499 ms.
Product exploration explored 100000 steps with 0 reset in 569 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 252 ms :[true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:12:12] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-15 07:12:12] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:12] [INFO ] Invariant cache hit.
[2023-03-15 07:12:13] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1453 ms. Remains : 828/828 places, 1242/1242 transitions.
Support contains 540 out of 828 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 4 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-15 07:12:13] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:13] [INFO ] Invariant cache hit.
[2023-03-15 07:12:13] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-15 07:12:13] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:13] [INFO ] Invariant cache hit.
[2023-03-15 07:12:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 07:12:15] [INFO ] Implicit Places using invariants and state equation in 1888 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
[2023-03-15 07:12:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-15 07:12:15] [INFO ] Invariant cache hit.
[2023-03-15 07:12:17] [INFO ] Dead Transitions using invariants and state equation in 1487 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3716 ms. Remains : 828/828 places, 1242/1242 transitions.
Treatment of property Peterson-PT-5-LTLCardinality-01 finished in 19376 ms.
[2023-03-15 07:12:17] [INFO ] Flatten gal took : 58 ms
[2023-03-15 07:12:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-15 07:12:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 13 ms.
Total runtime 169571 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-PT-5
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

FORMULA Peterson-PT-5-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678864338909

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-5-LTLCardinality-01: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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