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.r083-smll-167814405800273.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 itstools
Input is CloudDeployment-PT-6b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-smll-167814405800273
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.8M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678224549498

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=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-6b
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202303021504
[2023-03-07 21:29:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-07 21:29:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 21:29:12] [INFO ] Load time of PNML (sax parser for PT used): 711 ms
[2023-03-07 21:29:12] [INFO ] Transformed 1888 places.
[2023-03-07 21:29:13] [INFO ] Transformed 6804 transitions.
[2023-03-07 21:29:13] [INFO ] Found NUPN structural information;
[2023-03-07 21:29:13] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 955 ms.
Graph (trivial) has 1908 edges and 1888 vertex of which 504 / 1888 are part of one of the 48 SCC in 18 ms
Free SCC test removed 456 places
Structural test allowed to assert that 641 places are NOT stable. Took 98 ms.
Ensure Unique test removed 510 transitions
Reduce redundant transitions removed 510 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 1978 ms. (steps per millisecond=5 ) properties (out of 1247) seen :539
Running SMT prover for 708 properties.
[2023-03-07 21:29:15] [INFO ] Flow matrix only has 6247 transitions (discarded 47 similar events)
// Phase 1: matrix 6247 rows 1432 cols
[2023-03-07 21:29:15] [INFO ] Computed 25 place invariants in 319 ms
[2023-03-07 21:29:16] [INFO ] Flatten gal took : 1948 ms
[2023-03-07 21:29:17] [INFO ] Flatten gal took : 1165 ms
[2023-03-07 21:29:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5744660405648454762.gal : 290 ms
[2023-03-07 21:29:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17810204870636424167.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5744660405648454762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17810204870636424167.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17810204870636424167.prop.
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.assertInvariants(DeadlockTester.java:2347)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-07 21:29:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-07 21:29:42] [INFO ] After 25099ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 708 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 708 out of 1432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1432/1432 places, 6294/6294 transitions.
Graph (complete) has 4302 edges and 1432 vertex of which 1428 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.36 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 382 rules applied. Total rules applied 383 place count 1428 transition count 5910
Reduce places removed 332 places and 0 transitions.
Iterating post reduction 1 with 332 rules applied. Total rules applied 715 place count 1096 transition count 5910
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 715 place count 1096 transition count 5901
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 733 place count 1087 transition count 5901
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 887 place count 933 transition count 5747
Iterating global reduction 2 with 154 rules applied. Total rules applied 1041 place count 933 transition count 5747
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1046 place count 933 transition count 5742
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 21 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 1154 place count 879 transition count 5688
Performed 28 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 28 places in 20 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1210 place count 851 transition count 5728
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1215 place count 851 transition count 5723
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 19 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1225 place count 846 transition count 5773
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 4 with 38 rules applied. Total rules applied 1263 place count 846 transition count 5735
Free-agglomeration rule applied 60 times with reduction of 10 identical transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1323 place count 846 transition count 5665
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 1476 place count 786 transition count 5572
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 1488 place count 786 transition count 5560
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1489 place count 786 transition count 9654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1490 place count 785 transition count 9654
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1491 place count 785 transition count 9654
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1492 place count 785 transition count 9654
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1493 place count 785 transition count 9653
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1494 place count 784 transition count 9652
Applied a total of 1494 rules in 3515 ms. Remains 784 /1432 variables (removed 648) and now considering 9652/6294 (removed -3358) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3524 ms. Remains : 784/1432 places, 9652/6294 transitions.
SDD proceeding with computation,708 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,708 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,708 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,708 properties remain. new max is 32
SDD size :11 after 18
SDD proceeding with computation,708 properties remain. new max is 64
SDD size :18 after 21
SDD proceeding with computation,708 properties remain. new max is 128
SDD size :21 after 120
SDD proceeding with computation,708 properties remain. new max is 256
SDD size :120 after 915
SDD proceeding with computation,708 properties remain. new max is 512
SDD size :915 after 972
SDD proceeding with computation,708 properties remain. new max is 1024
SDD size :972 after 5357
SDD proceeding with computation,708 properties remain. new max is 2048
SDD size :5357 after 246653
SDD proceeding with computation,708 properties remain. new max is 4096
SDD size :246653 after 273229
Interrupted random walk after 235290 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 121
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 587) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 587) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 585) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 585) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 583) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 583) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 583) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 583) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 583) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 583) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Running SMT prover for 581 properties.
[2023-03-07 21:30:16] [INFO ] Flow matrix only has 9632 transitions (discarded 20 similar events)
// Phase 1: matrix 9632 rows 784 cols
[2023-03-07 21:30:17] [INFO ] Computed 25 place invariants in 322 ms
SDD proceeding with computation,708 properties remain. new max is 8192
SDD size :273229 after 278573
[2023-03-07 21:30:30] [INFO ] After 12702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:581
[2023-03-07 21:30:40] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 30 ms returned sat
Invariant property smplace_240 does not hold.
Invariant property smplace_239 does not hold.
Invariant property smplace_17 does not hold.
Invariant property smplace_16 does not hold.
SDD proceeding with computation,704 properties remain. new max is 8192
SDD size :278573 after 6.73043e+06
SDD proceeding with computation,704 properties remain. new max is 16384
SDD size :6.73043e+06 after 6.77075e+06
SDD proceeding with computation,704 properties remain. new max is 32768
SDD size :6.77075e+06 after 8.34553e+06
[2023-03-07 21:33:22] [INFO ] After 152341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :581
SDD proceeding with computation,704 properties remain. new max is 65536
SDD size :8.34553e+06 after 8.75176e+06
[2023-03-07 21:34:15] [INFO ] After 205496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :581
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-07 21:34:15] [INFO ] After 225101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :581
Fused 581 Parikh solutions to 579 different solutions.
Parikh walk visited 168 properties in 6453 ms.
Support contains 413 out of 784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 9652/9652 transitions.
Graph (complete) has 3097 edges and 784 vertex of which 780 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 780 transition count 9501
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 297 place count 633 transition count 9501
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 297 place count 633 transition count 9493
Deduced a syphon composed of 8 places in 24 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 313 place count 625 transition count 9493
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 370 place count 568 transition count 9435
Iterating global reduction 2 with 57 rules applied. Total rules applied 427 place count 568 transition count 9435
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 452 place count 568 transition count 9410
Performed 37 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 37 places in 24 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 526 place count 531 transition count 9366
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 577 place count 531 transition count 9315
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 8 places in 24 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 593 place count 523 transition count 9334
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 600 place count 523 transition count 9327
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 636 place count 523 transition count 9291
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 641 place count 523 transition count 9286
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 650 place count 518 transition count 9282
Applied a total of 650 rules in 1400 ms. Remains 518 /784 variables (removed 266) and now considering 9282/9652 (removed 370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1402 ms. Remains : 518/784 places, 9282/9652 transitions.
SDD proceeding with computation,704 properties remain. new max is 131072
SDD size :8.75176e+06 after 1.18546e+07
Interrupted random walk after 456368 steps, including 5033 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 363
Incomplete Best-First random walk after 100001 steps, including 133 resets, run finished after 828 ms. (steps per millisecond=120 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 100001 steps, including 134 resets, run finished after 825 ms. (steps per millisecond=121 ) properties (out of 50) seen :2
Incomplete Best-First random walk after 100001 steps, including 139 resets, run finished after 769 ms. (steps per millisecond=130 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 136 resets, run finished after 774 ms. (steps per millisecond=129 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 138 resets, run finished after 765 ms. (steps per millisecond=130 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 135 resets, run finished after 773 ms. (steps per millisecond=129 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100000 steps, including 129 resets, run finished after 701 ms. (steps per millisecond=142 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 138 resets, run finished after 770 ms. (steps per millisecond=129 ) properties (out of 48) seen :2
Incomplete Best-First random walk after 100001 steps, including 134 resets, run finished after 770 ms. (steps per millisecond=129 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 129 resets, run finished after 740 ms. (steps per millisecond=135 ) properties (out of 46) seen :2
Incomplete Best-First random walk after 100001 steps, including 133 resets, run finished after 737 ms. (steps per millisecond=135 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 133 resets, run finished after 730 ms. (steps per millisecond=136 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 135 resets, run finished after 719 ms. (steps per millisecond=139 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 130 resets, run finished after 679 ms. (steps per millisecond=147 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 139 resets, run finished after 743 ms. (steps per millisecond=134 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 133 resets, run finished after 738 ms. (steps per millisecond=135 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 134 resets, run finished after 683 ms. (steps per millisecond=146 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 133 resets, run finished after 757 ms. (steps per millisecond=132 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 132 resets, run finished after 736 ms. (steps per millisecond=135 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 135 resets, run finished after 720 ms. (steps per millisecond=138 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 131 resets, run finished after 747 ms. (steps per millisecond=133 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 136 resets, run finished after 692 ms. (steps per millisecond=144 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 138 resets, run finished after 694 ms. (steps per millisecond=144 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 134 resets, run finished after 723 ms. (steps per millisecond=138 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 133 resets, run finished after 739 ms. (steps per millisecond=135 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 128 resets, run finished after 713 ms. (steps per millisecond=140 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 133 resets, run finished after 731 ms. (steps per millisecond=136 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 140 resets, run finished after 721 ms. (steps per millisecond=138 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 136 resets, run finished after 726 ms. (steps per millisecond=137 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 135 resets, run finished after 731 ms. (steps per millisecond=136 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 135 resets, run finished after 716 ms. (steps per millisecond=139 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 133 resets, run finished after 743 ms. (steps per millisecond=134 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 133 resets, run finished after 733 ms. (steps per millisecond=136 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 132 resets, run finished after 724 ms. (steps per millisecond=138 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 133 resets, run finished after 737 ms. (steps per millisecond=135 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 132 resets, run finished after 732 ms. (steps per millisecond=136 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 134 resets, run finished after 727 ms. (steps per millisecond=137 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 134 resets, run finished after 727 ms. (steps per millisecond=137 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 138 resets, run finished after 727 ms. (steps per millisecond=137 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 134 resets, run finished after 742 ms. (steps per millisecond=134 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 131 resets, run finished after 741 ms. (steps per millisecond=134 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 733 ms. (steps per millisecond=136 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 141 resets, run finished after 724 ms. (steps per millisecond=138 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 746 ms. (steps per millisecond=134 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 138 resets, run finished after 730 ms. (steps per millisecond=136 ) properties (out of 44) seen :2
Incomplete Best-First random walk after 100001 steps, including 134 resets, run finished after 744 ms. (steps per millisecond=134 ) properties (out of 42) seen :0
Running SMT prover for 42 properties.
// Phase 1: matrix 9282 rows 518 cols
[2023-03-07 21:35:27] [INFO ] Computed 25 place invariants in 174 ms
[2023-03-07 21:35:28] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:42
[2023-03-07 21:35:29] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-07 21:35:42] [INFO ] After 12661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :42
[2023-03-07 21:35:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:35:51] [INFO ] After 9489ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :42
[2023-03-07 21:36:07] [INFO ] After 25550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :42
Attempting to minimize the solution found.
Minimization took 9381 ms.
[2023-03-07 21:36:17] [INFO ] After 48493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :42
Fused 42 Parikh solutions to 27 different solutions.
Parikh walk visited 39 properties in 3681 ms.
Support contains 3 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 9282/9282 transitions.
Graph (complete) has 2522 edges and 518 vertex of which 495 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8211 transitions
Reduce isomorphic transitions removed 8211 transitions.
Drop transitions removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 8388 rules applied. Total rules applied 8389 place count 495 transition count 892
Reduce places removed 177 places and 0 transitions.
Iterating post reduction 1 with 177 rules applied. Total rules applied 8566 place count 318 transition count 892
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 8566 place count 318 transition count 868
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 8614 place count 294 transition count 868
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 8670 place count 238 transition count 808
Iterating global reduction 2 with 56 rules applied. Total rules applied 8726 place count 238 transition count 808
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 8768 place count 238 transition count 766
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8768 place count 238 transition count 763
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 8774 place count 235 transition count 763
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 8777 place count 232 transition count 760
Iterating global reduction 3 with 3 rules applied. Total rules applied 8780 place count 232 transition count 760
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8782 place count 230 transition count 758
Iterating global reduction 3 with 2 rules applied. Total rules applied 8784 place count 230 transition count 758
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8785 place count 229 transition count 757
Iterating global reduction 3 with 1 rules applied. Total rules applied 8786 place count 229 transition count 757
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 8890 place count 177 transition count 705
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 8894 place count 177 transition count 701
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 8898 place count 173 transition count 679
Iterating global reduction 4 with 4 rules applied. Total rules applied 8902 place count 173 transition count 679
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8903 place count 172 transition count 678
Iterating global reduction 4 with 1 rules applied. Total rules applied 8904 place count 172 transition count 678
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8905 place count 171 transition count 677
Iterating global reduction 4 with 1 rules applied. Total rules applied 8906 place count 171 transition count 677
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8907 place count 170 transition count 676
Iterating global reduction 4 with 1 rules applied. Total rules applied 8908 place count 170 transition count 676
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -174
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 8952 place count 148 transition count 850
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 8961 place count 148 transition count 841
Drop transitions removed 216 transitions
Redundant transition composition rules discarded 216 transitions
Iterating global reduction 5 with 216 rules applied. Total rules applied 9177 place count 148 transition count 625
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 9185 place count 148 transition count 617
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 9229 place count 140 transition count 581
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 9232 place count 137 transition count 560
Iterating global reduction 6 with 3 rules applied. Total rules applied 9235 place count 137 transition count 560
Applied a total of 9235 rules in 248 ms. Remains 137 /518 variables (removed 381) and now considering 560/9282 (removed 8722) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 137/518 places, 560/9282 transitions.
Incomplete random walk after 1000000 steps, including 13401 resets, run finished after 12379 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1666 resets, run finished after 2043 ms. (steps per millisecond=489 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1647 resets, run finished after 2039 ms. (steps per millisecond=490 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1688 resets, run finished after 2018 ms. (steps per millisecond=495 ) properties (out of 3) seen :0
SDD proceeding with computation,704 properties remain. new max is 262144
SDD size :1.18546e+07 after 1.48612e+07
Interrupted probabilistic random walk after 10101365 steps, run timeout after 54001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 10101365 steps, saw 1313391 distinct states, run finished after 54005 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-07 21:37:33] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
// Phase 1: matrix 278 rows 137 cols
[2023-03-07 21:37:33] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-07 21:37:33] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-07 21:37:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-07 21:37:33] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-07 21:37:33] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-07 21:37:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:37:33] [INFO ] After 44ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-07 21:37:34] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-07 21:37:34] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 560/560 transitions.
Applied a total of 0 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 137/137 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 560/560 transitions.
Applied a total of 0 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-07 21:37:34] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:37:34] [INFO ] Invariant cache hit.
[2023-03-07 21:37:34] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-07 21:37:34] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:37:34] [INFO ] Invariant cache hit.
[2023-03-07 21:37:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:37:34] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-07 21:37:34] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-07 21:37:34] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:37:34] [INFO ] Invariant cache hit.
[2023-03-07 21:37:35] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 883 ms. Remains : 137/137 places, 560/560 transitions.
Incomplete random walk after 100000 steps, including 1351 resets, run finished after 2674 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-07 21:37:37] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:37:37] [INFO ] Invariant cache hit.
[2023-03-07 21:37:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 21:37:37] [INFO ] [Real]Absence check using 3 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-07 21:37:37] [INFO ] After 117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-07 21:37:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:37:37] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :3
[2023-03-07 21:37:37] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-07 21:37:37] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-07 21:37:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 21:37:37] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-07 21:37:38] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-07 21:37:38] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-07 21:37:38] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-07 21:37:38] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Incomplete random walk after 1000000 steps, including 13431 resets, run finished after 15797 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1671 resets, run finished after 2054 ms. (steps per millisecond=486 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1677 resets, run finished after 2094 ms. (steps per millisecond=477 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1662 resets, run finished after 2062 ms. (steps per millisecond=484 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 12202538 steps, run timeout after 66001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 12202538 steps, saw 1578232 distinct states, run finished after 66001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-07 21:39:06] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:39:06] [INFO ] Invariant cache hit.
[2023-03-07 21:39:06] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-07 21:39:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-07 21:39:06] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-07 21:39:06] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-07 21:39:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:06] [INFO ] After 42ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-07 21:39:06] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-07 21:39:06] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 560/560 transitions.
Applied a total of 0 rules in 12 ms. Remains 137 /137 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 137/137 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 560/560 transitions.
Applied a total of 0 rules in 24 ms. Remains 137 /137 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-07 21:39:06] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:39:06] [INFO ] Invariant cache hit.
[2023-03-07 21:39:06] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-07 21:39:06] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:39:06] [INFO ] Invariant cache hit.
[2023-03-07 21:39:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:07] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-07 21:39:07] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-07 21:39:07] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:39:07] [INFO ] Invariant cache hit.
[2023-03-07 21:39:07] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 963 ms. Remains : 137/137 places, 560/560 transitions.
Incomplete random walk after 100000 steps, including 1324 resets, run finished after 2911 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-07 21:39:10] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:39:10] [INFO ] Invariant cache hit.
[2023-03-07 21:39:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-07 21:39:10] [INFO ] [Real]Absence check using 3 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-07 21:39:10] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-07 21:39:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:10] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :3
[2023-03-07 21:39:10] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-07 21:39:10] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-07 21:39:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 21:39:10] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-07 21:39:10] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-07 21:39:10] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-07 21:39:11] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-07 21:39:11] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Incomplete random walk after 10000 steps, including 135 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 633937 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 633937 steps, saw 105027 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 21:39:14] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
[2023-03-07 21:39:14] [INFO ] Invariant cache hit.
[2023-03-07 21:39:14] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:39:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-07 21:39:14] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-07 21:39:14] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:14] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:14] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-07 21:39:14] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 560/560 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 137 transition count 558
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 135 transition count 558
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 133 transition count 556
Applied a total of 8 rules in 26 ms. Remains 133 /137 variables (removed 4) and now considering 556/560 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 133/137 places, 556/560 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 652427 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 652427 steps, saw 107814 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 21:39:17] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
// Phase 1: matrix 274 rows 133 cols
[2023-03-07 21:39:17] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-07 21:39:17] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:39:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 21:39:17] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-07 21:39:17] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:17] [INFO ] After 25ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:17] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-07 21:39:17] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 556/556 transitions.
Applied a total of 0 rules in 27 ms. Remains 133 /133 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 133/133 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 556/556 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2023-03-07 21:39:17] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-07 21:39:17] [INFO ] Invariant cache hit.
Detected timeout of ITS tools.
[2023-03-07 21:39:17] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-07 21:39:17] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-07 21:39:17] [INFO ] Invariant cache hit.
[2023-03-07 21:39:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:18] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-07 21:39:18] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-07 21:39:18] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-07 21:39:18] [INFO ] Invariant cache hit.
[2023-03-07 21:39:18] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1051 ms. Remains : 133/133 places, 556/556 transitions.
Graph (trivial) has 134 edges and 133 vertex of which 48 / 133 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 69 transitions
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 369 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 80 transition count 171
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 44 place count 64 transition count 171
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 44 place count 64 transition count 161
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 54 transition count 161
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 49 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 49 transition count 156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 44 transition count 126
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 44 transition count 126
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 119 place count 44 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 133 place count 37 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 145 place count 37 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 157 place count 31 transition count 102
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 205 place count 31 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 220 place count 21 transition count 49
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 248 place count 21 transition count 21
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 20 transition count 20
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 256 place count 20 transition count 20
Applied a total of 256 rules in 17 ms. Remains 20 /133 variables (removed 113) and now considering 20/556 (removed 536) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 20 cols
[2023-03-07 21:39:18] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-07 21:39:18] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:39:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-07 21:39:18] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-07 21:39:18] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:18] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-07 21:39:18] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 133 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-07 21:39:19] [INFO ] Flatten gal took : 1232 ms
[2023-03-07 21:39:19] [INFO ] Applying decomposition
[2023-03-07 21:39:19] [INFO ] Flatten gal took : 925 ms
Interrupted probabilistic random walk after 514516 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 514516 steps, saw 87380 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 21:39:21] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
// Phase 1: matrix 278 rows 137 cols
[2023-03-07 21:39:21] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-07 21:39:21] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:39:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-07 21:39:21] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-07 21:39:22] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:22] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:22] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-07 21:39:22] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 560/560 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 137 transition count 558
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 135 transition count 558
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 133 transition count 556
Applied a total of 8 rules in 22 ms. Remains 133 /137 variables (removed 4) and now considering 556/560 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 133/137 places, 556/560 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2906463782103904934.txt' '-o' '/tmp/graph2906463782103904934.bin' '-w' '/tmp/graph2906463782103904934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2906463782103904934.bin' '-l' '-1' '-v' '-w' '/tmp/graph2906463782103904934.weights' '-q' '0' '-e' '0.001'
[2023-03-07 21:39:22] [INFO ] Decomposing Gal with order
[2023-03-07 21:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
Interrupted probabilistic random walk after 597746 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 597746 steps, saw 99786 distinct states, run finished after 3005 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 21:39:25] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
// Phase 1: matrix 274 rows 133 cols
[2023-03-07 21:39:25] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-07 21:39:25] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:39:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-07 21:39:25] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-07 21:39:25] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:25] [INFO ] After 20ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:25] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-07 21:39:25] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 556/556 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 133/133 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 556/556 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2023-03-07 21:39:25] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-07 21:39:25] [INFO ] Invariant cache hit.
[2023-03-07 21:39:25] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-07 21:39:25] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-07 21:39:25] [INFO ] Invariant cache hit.
[2023-03-07 21:39:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:25] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-07 21:39:25] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-07 21:39:25] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-07 21:39:25] [INFO ] Invariant cache hit.
[2023-03-07 21:39:26] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 835 ms. Remains : 133/133 places, 556/556 transitions.
Graph (trivial) has 134 edges and 133 vertex of which 48 / 133 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 69 transitions
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 369 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 80 transition count 171
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 44 place count 64 transition count 171
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 44 place count 64 transition count 161
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 54 transition count 161
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 49 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 49 transition count 156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 44 transition count 126
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 44 transition count 126
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 119 place count 44 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 133 place count 37 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 145 place count 37 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 157 place count 31 transition count 102
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 205 place count 31 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 220 place count 21 transition count 49
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 248 place count 21 transition count 21
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 20 transition count 20
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 256 place count 20 transition count 20
Applied a total of 256 rules in 19 ms. Remains 20 /133 variables (removed 113) and now considering 20/556 (removed 536) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 20 cols
[2023-03-07 21:39:26] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-07 21:39:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:39:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-07 21:39:26] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-07 21:39:26] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:26] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-07 21:39:26] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 132 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 563462 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 563462 steps, saw 94624 distinct states, run finished after 3003 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 21:39:29] [INFO ] Flow matrix only has 278 transitions (discarded 282 similar events)
// Phase 1: matrix 278 rows 137 cols
[2023-03-07 21:39:29] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-07 21:39:29] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:39:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 21:39:29] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-07 21:39:29] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:29] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:29] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-07 21:39:29] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 560/560 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 137 transition count 558
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 135 transition count 558
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 133 transition count 556
Applied a total of 8 rules in 17 ms. Remains 133 /137 variables (removed 4) and now considering 556/560 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 133/137 places, 556/560 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-07 21:39:31] [INFO ] Removed a total of 39172 redundant transitions.
Interrupted probabilistic random walk after 524988 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 524988 steps, saw 89057 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 21:39:32] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
// Phase 1: matrix 274 rows 133 cols
[2023-03-07 21:39:32] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-07 21:39:32] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:39:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-07 21:39:32] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 19 ms returned sat
[2023-03-07 21:39:32] [INFO ] Flatten gal took : 9114 ms
[2023-03-07 21:39:33] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:33] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:33] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-07 21:39:33] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 556/556 transitions.
Applied a total of 0 rules in 17 ms. Remains 133 /133 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 133/133 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 556/556 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2023-03-07 21:39:33] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-07 21:39:33] [INFO ] Invariant cache hit.
[2023-03-07 21:39:33] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-07 21:39:33] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-07 21:39:33] [INFO ] Invariant cache hit.
[2023-03-07 21:39:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 21:39:33] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-07 21:39:33] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 21:39:33] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-07 21:39:33] [INFO ] Invariant cache hit.
[2023-03-07 21:39:34] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 924 ms. Remains : 133/133 places, 556/556 transitions.
Graph (trivial) has 134 edges and 133 vertex of which 48 / 133 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 69 transitions
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 369 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 80 transition count 171
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 44 place count 64 transition count 171
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 44 place count 64 transition count 161
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 54 transition count 161
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 49 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 49 transition count 156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 44 transition count 126
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 44 transition count 126
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 119 place count 44 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 133 place count 37 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 145 place count 37 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 157 place count 31 transition count 102
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 205 place count 31 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 220 place count 21 transition count 49
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 248 place count 21 transition count 21
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 20 transition count 20
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 256 place count 20 transition count 20
Applied a total of 256 rules in 16 ms. Remains 20 /133 variables (removed 113) and now considering 20/556 (removed 536) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 20 cols
[2023-03-07 21:39:34] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-07 21:39:34] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:39:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-07 21:39:34] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-07 21:39:34] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 21:39:34] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-07 21:39:34] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 134 edges and 137 vertex of which 48 / 137 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 69 transitions
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 369 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 84 transition count 175
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 44 place count 68 transition count 175
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 44 place count 68 transition count 165
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 58 transition count 165
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 53 transition count 160
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 53 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 48 transition count 130
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 48 transition count 130
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 119 place count 48 transition count 95
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 133 place count 41 transition count 88
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 145 place count 41 transition count 76
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 157 place count 35 transition count 106
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 205 place count 35 transition count 58
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 214 place count 29 transition count 55
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 228 place count 29 transition count 41
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 234 place count 29 transition count 41
Applied a total of 234 rules in 13 ms. Remains 29 /137 variables (removed 108) and now considering 41/560 (removed 519) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 29 cols
[2023-03-07 21:39:34] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-07 21:39:34] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-07 21:39:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 21:39:34] [INFO ] [Nat]Absence check using 3 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-07 21:39:34] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-07 21:39:34] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-07 21:39:34] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-07 21:39:34] [INFO ] Flatten gal took : 3 ms
[2023-03-07 21:39:34] [INFO ] Flatten gal took : 1 ms
[2023-03-07 21:39:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13694672192442773996.gal : 2 ms
[2023-03-07 21:39:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2070043457990821561.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13694672192442773996.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2070043457990821561.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2070043457990821561.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 16
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :16 after 42
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :42 after 227
Invariant property smplace_1214 does not hold.
Invariant property smplace_322 does not hold.
Invariant property smplace_99 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,554,0.017042,4608,2,157,13,786,6,0,152,431,0
Total reachable state count : 554

Verifying 3 reachability properties.
Invariant property smplace_99 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_99,1,0.017438,4608,2,30,13,786,7,0,155,431,0
Invariant property smplace_322 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_322,4,0.017699,4608,2,33,13,786,8,0,157,431,0
Invariant property smplace_1214 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1214,16,0.017928,4608,2,36,13,786,9,0,159,431,0
[2023-03-07 21:39:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8295 labels/synchronizations in 1263 ms.
[2023-03-07 21:39:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11034413489512010031.gal : 89 ms
[2023-03-07 21:39:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10182466140321803847.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11034413489512010031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10182466140321803847.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-07 21:39:35] [INFO ] Flatten gal took : 34 ms
[2023-03-07 21:39:35] [INFO ] Flatten gal took : 26 ms
[2023-03-07 21:39:35] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6204126230745333461.gal : 4 ms
[2023-03-07 21:39:35] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability916154669220619249.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6204126230745333461.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability916154669220619249.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityFireability916154669220619249.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :19 after 117
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :117 after 229
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :229 after 106408
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :106408 after 145646
Invariant property smplace_322 does not hold.
Invariant property smplace_99 does not hold.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :145646 after 5.45228e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.95192e+08,0.501526,13500,2,2005,15,34056,7,0,1093,29851,0
Total reachable state count : 195191798

Verifying 3 reachability properties.
Invariant property smplace_99 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_99,1,0.502471,13764,2,138,15,34056,8,0,1096,29851,0
Invariant property smplace_322 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_322,1,0.502962,13764,2,138,15,34056,9,0,1098,29851,0
Invariant property smplace_1214 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1214,128,0.503247,13764,2,254,15,34056,9,0,1099,29851,0
Able to resolve query StableMarking after proving 1249 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS TRIVIAL_UNMARKED_SCC_TEST COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL
Total runtime 624091 ms.

BK_STOP 1678225177603

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="CloudDeployment-PT-6b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is CloudDeployment-PT-6b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-smll-167814405800273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6b.tgz
mv CloudDeployment-PT-6b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;