/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b
[2022-12-06 01:53:44,213 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-12-06 01:53:44,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-12-06 01:53:44,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-12-06 01:53:44,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-12-06 01:53:44,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-12-06 01:53:44,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-12-06 01:53:44,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-12-06 01:53:44,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-12-06 01:53:44,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-12-06 01:53:44,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-12-06 01:53:44,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-12-06 01:53:44,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-12-06 01:53:44,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-12-06 01:53:44,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-12-06 01:53:44,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-12-06 01:53:44,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-12-06 01:53:44,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-12-06 01:53:44,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-12-06 01:53:44,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-12-06 01:53:44,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-12-06 01:53:44,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-12-06 01:53:44,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-12-06 01:53:44,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-12-06 01:53:44,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-12-06 01:53:44,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-12-06 01:53:44,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-12-06 01:53:44,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-12-06 01:53:44,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-12-06 01:53:44,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-12-06 01:53:44,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-12-06 01:53:44,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-12-06 01:53:44,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-12-06 01:53:44,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-12-06 01:53:44,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-12-06 01:53:44,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-12-06 01:53:44,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-12-06 01:53:44,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-12-06 01:53:44,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-12-06 01:53:44,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-12-06 01:53:44,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-12-06 01:53:44,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf
[2022-12-06 01:53:44,310 INFO L113 SettingsManager]: Loading preferences was successful
[2022-12-06 01:53:44,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-12-06 01:53:44,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-12-06 01:53:44,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-12-06 01:53:44,312 INFO L138 SettingsManager]: * Use SBE=true
[2022-12-06 01:53:44,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-12-06 01:53:44,313 INFO L138 SettingsManager]: * sizeof long=4
[2022-12-06 01:53:44,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-12-06 01:53:44,313 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-12-06 01:53:44,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-12-06 01:53:44,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-12-06 01:53:44,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-12-06 01:53:44,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-12-06 01:53:44,314 INFO L138 SettingsManager]: * sizeof long double=12
[2022-12-06 01:53:44,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-12-06 01:53:44,314 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-12-06 01:53:44,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-12-06 01:53:44,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-12-06 01:53:44,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-12-06 01:53:44,314 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-12-06 01:53:44,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-12-06 01:53:44,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-12-06 01:53:44,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-12-06 01:53:44,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-12-06 01:53:44,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-12-06 01:53:44,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-12-06 01:53:44,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-12-06 01:53:44,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN
[2022-12-06 01:53:44,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true
[2022-12-06 01:53:44,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-12-06 01:53:44,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-12-06 01:53:44,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-12-06 01:53:44,592 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-12-06 01:53:44,596 INFO L275 PluginConnector]: CDTParser initialized
[2022-12-06 01:53:44,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c
[2022-12-06 01:53:45,568 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2022-12-06 01:53:45,784 INFO L351 CDTParser]: Found 1 translation units.
[2022-12-06 01:53:45,785 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c
[2022-12-06 01:53:45,791 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33ae98bd/68509161fc514df29a8ec999200f05ac/FLAG89eddcc47
[2022-12-06 01:53:45,806 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33ae98bd/68509161fc514df29a8ec999200f05ac
[2022-12-06 01:53:45,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-12-06 01:53:45,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-12-06 01:53:45,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-12-06 01:53:45,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-12-06 01:53:45,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-12-06 01:53:45,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:53:45" (1/1) ...
[2022-12-06 01:53:45,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528b9f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:45, skipping insertion in model container
[2022-12-06 01:53:45,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:53:45" (1/1) ...
[2022-12-06 01:53:45,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-12-06 01:53:45,840 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-12-06 01:53:45,988 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c[3034,3047]
[2022-12-06 01:53:45,994 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-12-06 01:53:46,000 INFO L203 MainTranslator]: Completed pre-run
[2022-12-06 01:53:46,030 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c[3034,3047]
[2022-12-06 01:53:46,032 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-12-06 01:53:46,045 INFO L208 MainTranslator]: Completed translation
[2022-12-06 01:53:46,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46 WrapperNode
[2022-12-06 01:53:46,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-12-06 01:53:46,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-12-06 01:53:46,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-12-06 01:53:46,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-12-06 01:53:46,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,094 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 16, calls inlined = 24, statements flattened = 271
[2022-12-06 01:53:46,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-12-06 01:53:46,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-12-06 01:53:46,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-12-06 01:53:46,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-12-06 01:53:46,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,131 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-12-06 01:53:46,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-12-06 01:53:46,135 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-12-06 01:53:46,135 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-12-06 01:53:46,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (1/1) ...
[2022-12-06 01:53:46,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-12-06 01:53:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:53:46,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-12-06 01:53:46,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-12-06 01:53:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-12-06 01:53:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-12-06 01:53:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-12-06 01:53:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-12-06 01:53:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2022-12-06 01:53:46,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2022-12-06 01:53:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2022-12-06 01:53:46,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2022-12-06 01:53:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread3
[2022-12-06 01:53:46,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3
[2022-12-06 01:53:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-12-06 01:53:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-12-06 01:53:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-12-06 01:53:46,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-12-06 01:53:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-12-06 01:53:46,212 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2022-12-06 01:53:46,286 INFO L236 CfgBuilder]: Building ICFG
[2022-12-06 01:53:46,287 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-12-06 01:53:46,599 INFO L277 CfgBuilder]: Performing block encoding
[2022-12-06 01:53:46,608 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-12-06 01:53:46,608 INFO L302 CfgBuilder]: Removed 6 assume(true) statements.
[2022-12-06 01:53:46,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:53:46 BoogieIcfgContainer
[2022-12-06 01:53:46,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-12-06 01:53:46,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-12-06 01:53:46,612 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-12-06 01:53:46,614 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-12-06 01:53:46,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:53:45" (1/3) ...
[2022-12-06 01:53:46,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51af9360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:53:46, skipping insertion in model container
[2022-12-06 01:53:46,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:53:46" (2/3) ...
[2022-12-06 01:53:46,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51af9360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:53:46, skipping insertion in model container
[2022-12-06 01:53:46,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:53:46" (3/3) ...
[2022-12-06 01:53:46,615 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c
[2022-12-06 01:53:46,628 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-12-06 01:53:46,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-12-06 01:53:46,628 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-12-06 01:53:46,730 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2022-12-06 01:53:46,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 312 transitions, 648 flow
[2022-12-06 01:53:46,858 INFO L130 PetriNetUnfolder]: 28/309 cut-off events.
[2022-12-06 01:53:46,858 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2022-12-06 01:53:46,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 309 events. 28/309 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 479 event pairs, 0 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 238. Up to 2 conditions per place.
[2022-12-06 01:53:46,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 312 transitions, 648 flow
[2022-12-06 01:53:46,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 299 transitions, 616 flow
[2022-12-06 01:53:46,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:53:46,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 299 transitions, 616 flow
[2022-12-06 01:53:46,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 299 transitions, 616 flow
[2022-12-06 01:53:46,959 INFO L130 PetriNetUnfolder]: 28/299 cut-off events.
[2022-12-06 01:53:46,960 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2022-12-06 01:53:46,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 28/299 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 477 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 238. Up to 2 conditions per place.
[2022-12-06 01:53:46,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 299 transitions, 616 flow
[2022-12-06 01:53:46,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 15390
[2022-12-06 01:53:54,920 INFO L203 LiptonReduction]: Total number of compositions: 269
[2022-12-06 01:53:54,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-12-06 01:53:54,941 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a9a237d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-12-06 01:53:54,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2022-12-06 01:53:54,946 INFO L130 PetriNetUnfolder]: 6/29 cut-off events.
[2022-12-06 01:53:54,946 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2022-12-06 01:53:54,946 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:53:54,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:53:54,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:53:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:53:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1502034649, now seen corresponding path program 1 times
[2022-12-06 01:53:54,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:53:54,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729441985]
[2022-12-06 01:53:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:53:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:53:55,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:53:55,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729441985]
[2022-12-06 01:53:55,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729441985] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:53:55,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:53:55,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-12-06 01:53:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538399399]
[2022-12-06 01:53:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:53:55,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-12-06 01:53:55,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:53:55,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-12-06 01:53:55,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-12-06 01:53:55,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:53:55,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:55,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:53:55,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:53:55,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:53:55,398 INFO L130 PetriNetUnfolder]: 370/545 cut-off events.
[2022-12-06 01:53:55,398 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES.
[2022-12-06 01:53:55,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 545 events. 370/545 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1540 event pairs, 253 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 936. Up to 543 conditions per place.
[2022-12-06 01:53:55,403 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 27 selfloop transitions, 6 changer transitions 0/33 dead transitions.
[2022-12-06 01:53:55,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 150 flow
[2022-12-06 01:53:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-12-06 01:53:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-12-06 01:53:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions.
[2022-12-06 01:53:55,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4
[2022-12-06 01:53:55,415 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places.
[2022-12-06 01:53:55,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:53:55,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 150 flow
[2022-12-06 01:53:55,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 33 transitions, 150 flow
[2022-12-06 01:53:55,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:53:55,421 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:53:55,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8
[2022-12-06 01:53:55,423 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 150 flow
[2022-12-06 01:53:55,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:55,424 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:53:55,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:53:55,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-12-06 01:53:55,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:53:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:53:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash 145490352, now seen corresponding path program 1 times
[2022-12-06 01:53:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:53:55,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547926634]
[2022-12-06 01:53:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:53:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-12-06 01:53:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:53:55,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547926634]
[2022-12-06 01:53:55,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547926634] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:53:55,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174936781]
[2022-12-06 01:53:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:55,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:53:55,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:53:55,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:53:55,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-12-06 01:53:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:55,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-12-06 01:53:55,795 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:53:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-12-06 01:53:55,838 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:53:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-12-06 01:53:55,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174936781] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:53:55,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:53:55,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7
[2022-12-06 01:53:55,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645547715]
[2022-12-06 01:53:55,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:53:55,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-12-06 01:53:55,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:53:55,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-12-06 01:53:55,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56
[2022-12-06 01:53:55,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:53:55,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 150 flow. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:55,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:53:55,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:53:55,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:53:56,036 INFO L130 PetriNetUnfolder]: 370/554 cut-off events.
[2022-12-06 01:53:56,036 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES.
[2022-12-06 01:53:56,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 554 events. 370/554 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1548 event pairs, 253 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 1384. Up to 552 conditions per place.
[2022-12-06 01:53:56,039 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 27 selfloop transitions, 15 changer transitions 0/42 dead transitions.
[2022-12-06 01:53:56,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 270 flow
[2022-12-06 01:53:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-12-06 01:53:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2022-12-06 01:53:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions.
[2022-12-06 01:53:56,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333
[2022-12-06 01:53:56,044 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places.
[2022-12-06 01:53:56,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:53:56,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 42 transitions, 270 flow
[2022-12-06 01:53:56,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 42 transitions, 270 flow
[2022-12-06 01:53:56,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:53:56,048 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:53:56,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5
[2022-12-06 01:53:56,049 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 270 flow
[2022-12-06 01:53:56,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:56,049 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:53:56,049 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:53:56,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-12-06 01:53:56,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:53:56,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:53:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:53:56,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1157664169, now seen corresponding path program 2 times
[2022-12-06 01:53:56,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:53:56,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44105697]
[2022-12-06 01:53:56,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:56,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:53:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2022-12-06 01:53:56,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:53:56,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44105697]
[2022-12-06 01:53:56,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44105697] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:53:56,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991605790]
[2022-12-06 01:53:56,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-12-06 01:53:56,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:53:56,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:53:56,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:53:56,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-12-06 01:53:56,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-12-06 01:53:56,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 01:53:56,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-12-06 01:53:56,548 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:53:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2022-12-06 01:53:56,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-12-06 01:53:56,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991605790] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:53:56,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-12-06 01:53:56,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9
[2022-12-06 01:53:56,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368493009]
[2022-12-06 01:53:56,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:53:56,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-12-06 01:53:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:53:56,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-12-06 01:53:56,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2022-12-06 01:53:56,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:53:56,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:56,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:53:56,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:53:56,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:53:56,776 INFO L130 PetriNetUnfolder]: 644/962 cut-off events.
[2022-12-06 01:53:56,776 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES.
[2022-12-06 01:53:56,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3959 conditions, 962 events. 644/962 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3483 event pairs, 253 based on Foata normal form. 14/761 useless extension candidates. Maximal degree in co-relation 3174. Up to 960 conditions per place.
[2022-12-06 01:53:56,782 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 69 selfloop transitions, 3 changer transitions 2/74 dead transitions.
[2022-12-06 01:53:56,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 631 flow
[2022-12-06 01:53:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-12-06 01:53:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2022-12-06 01:53:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions.
[2022-12-06 01:53:56,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525
[2022-12-06 01:53:56,785 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places.
[2022-12-06 01:53:56,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:53:56,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 74 transitions, 631 flow
[2022-12-06 01:53:56,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 74 transitions, 631 flow
[2022-12-06 01:53:56,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:53:56,790 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:53:56,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6
[2022-12-06 01:53:56,791 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 74 transitions, 631 flow
[2022-12-06 01:53:56,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:56,791 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:53:56,791 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:53:56,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-12-06 01:53:56,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-12-06 01:53:56,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:53:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:53:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1547493757, now seen corresponding path program 3 times
[2022-12-06 01:53:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:53:56,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129017294]
[2022-12-06 01:53:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:53:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2022-12-06 01:53:57,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:53:57,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129017294]
[2022-12-06 01:53:57,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129017294] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:53:57,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180759122]
[2022-12-06 01:53:57,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-12-06 01:53:57,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:53:57,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:53:57,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:53:57,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-12-06 01:53:57,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2022-12-06 01:53:57,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 01:53:57,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-12-06 01:53:57,251 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:53:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2022-12-06 01:53:57,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-12-06 01:53:57,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180759122] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:53:57,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-12-06 01:53:57,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9
[2022-12-06 01:53:57,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259012645]
[2022-12-06 01:53:57,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:53:57,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-12-06 01:53:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:53:57,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-12-06 01:53:57,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2022-12-06 01:53:57,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:53:57,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 74 transitions, 631 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:57,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:53:57,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:53:57,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:53:57,493 INFO L130 PetriNetUnfolder]: 758/1124 cut-off events.
[2022-12-06 01:53:57,493 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES.
[2022-12-06 01:53:57,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5744 conditions, 1124 events. 758/1124 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4338 event pairs, 39 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 4772. Up to 1122 conditions per place.
[2022-12-06 01:53:57,500 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 97 selfloop transitions, 6 changer transitions 11/114 dead transitions.
[2022-12-06 01:53:57,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 114 transitions, 1197 flow
[2022-12-06 01:53:57,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-12-06 01:53:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2022-12-06 01:53:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions.
[2022-12-06 01:53:57,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45
[2022-12-06 01:53:57,501 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places.
[2022-12-06 01:53:57,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:53:57,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 114 transitions, 1197 flow
[2022-12-06 01:53:57,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 114 transitions, 1197 flow
[2022-12-06 01:53:57,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:53:57,507 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:53:57,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7
[2022-12-06 01:53:57,508 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 114 transitions, 1197 flow
[2022-12-06 01:53:57,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:57,508 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:53:57,508 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:53:57,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-12-06 01:53:57,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:53:57,714 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:53:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:53:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -909243217, now seen corresponding path program 4 times
[2022-12-06 01:53:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:53:57,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834717437]
[2022-12-06 01:53:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:57,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:53:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2022-12-06 01:53:57,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:53:57,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834717437]
[2022-12-06 01:53:57,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834717437] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:53:57,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222259859]
[2022-12-06 01:53:57,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-12-06 01:53:57,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:53:57,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:53:57,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:53:57,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-12-06 01:53:57,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-12-06 01:53:57,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 01:53:57,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core
[2022-12-06 01:53:57,962 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:53:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2022-12-06 01:53:58,007 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:53:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2022-12-06 01:53:58,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222259859] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:53:58,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:53:58,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12
[2022-12-06 01:53:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227729783]
[2022-12-06 01:53:58,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:53:58,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-12-06 01:53:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:53:58,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-12-06 01:53:58,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2022-12-06 01:53:58,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:53:58,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 114 transitions, 1197 flow. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:58,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:53:58,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:53:58,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:53:58,235 INFO L130 PetriNetUnfolder]: 758/1127 cut-off events.
[2022-12-06 01:53:58,235 INFO L131 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES.
[2022-12-06 01:53:58,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6887 conditions, 1127 events. 758/1127 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4352 event pairs, 39 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 5710. Up to 1125 conditions per place.
[2022-12-06 01:53:58,242 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 88 selfloop transitions, 18 changer transitions 11/117 dead transitions.
[2022-12-06 01:53:58,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 117 transitions, 1461 flow
[2022-12-06 01:53:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-12-06 01:53:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2022-12-06 01:53:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions.
[2022-12-06 01:53:58,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856
[2022-12-06 01:53:58,244 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places.
[2022-12-06 01:53:58,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:53:58,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 117 transitions, 1461 flow
[2022-12-06 01:53:58,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 117 transitions, 1461 flow
[2022-12-06 01:53:58,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:53:58,251 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:53:58,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8
[2022-12-06 01:53:58,252 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 117 transitions, 1461 flow
[2022-12-06 01:53:58,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:58,252 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:53:58,252 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:53:58,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-12-06 01:53:58,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:53:58,457 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:53:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:53:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash 172481596, now seen corresponding path program 5 times
[2022-12-06 01:53:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:53:58,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224646084]
[2022-12-06 01:53:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:53:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-12-06 01:53:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:53:58,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224646084]
[2022-12-06 01:53:58,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224646084] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:53:58,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:53:58,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-12-06 01:53:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812557554]
[2022-12-06 01:53:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:53:58,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-12-06 01:53:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:53:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-12-06 01:53:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-12-06 01:53:58,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:53:58,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 117 transitions, 1461 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:58,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:53:58,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:53:58,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:53:58,943 INFO L130 PetriNetUnfolder]: 659/978 cut-off events.
[2022-12-06 01:53:58,944 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES.
[2022-12-06 01:53:58,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6953 conditions, 978 events. 659/978 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3608 event pairs, 39 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 6075. Up to 976 conditions per place.
[2022-12-06 01:53:58,950 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 100 selfloop transitions, 8 changer transitions 11/119 dead transitions.
[2022-12-06 01:53:58,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 119 transitions, 1720 flow
[2022-12-06 01:53:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-12-06 01:53:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2022-12-06 01:53:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions.
[2022-12-06 01:53:58,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333
[2022-12-06 01:53:58,954 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places.
[2022-12-06 01:53:58,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:53:58,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 119 transitions, 1720 flow
[2022-12-06 01:53:58,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 119 transitions, 1720 flow
[2022-12-06 01:53:58,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:53:58,965 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:53:58,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12
[2022-12-06 01:53:58,969 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 119 transitions, 1720 flow
[2022-12-06 01:53:58,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:58,969 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:53:58,969 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:53:58,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-12-06 01:53:58,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:53:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:53:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1221370983, now seen corresponding path program 1 times
[2022-12-06 01:53:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:53:58,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333940173]
[2022-12-06 01:53:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:53:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:53:59,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:53:59,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333940173]
[2022-12-06 01:53:59,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333940173] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:53:59,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:53:59,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-12-06 01:53:59,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504000727]
[2022-12-06 01:53:59,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:53:59,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:53:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:53:59,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:53:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2022-12-06 01:53:59,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:53:59,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 119 transitions, 1720 flow. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:59,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:53:59,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:53:59,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:53:59,394 INFO L130 PetriNetUnfolder]: 1005/1473 cut-off events.
[2022-12-06 01:53:59,394 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES.
[2022-12-06 01:53:59,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11905 conditions, 1473 events. 1005/1473 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5721 event pairs, 14 based on Foata normal form. 1/1153 useless extension candidates. Maximal degree in co-relation 11279. Up to 1471 conditions per place.
[2022-12-06 01:53:59,404 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 147 selfloop transitions, 18 changer transitions 25/190 dead transitions.
[2022-12-06 01:53:59,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 190 transitions, 3115 flow
[2022-12-06 01:53:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-12-06 01:53:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2022-12-06 01:53:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions.
[2022-12-06 01:53:59,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2022-12-06 01:53:59,406 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places.
[2022-12-06 01:53:59,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:53:59,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 190 transitions, 3115 flow
[2022-12-06 01:53:59,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 190 transitions, 3115 flow
[2022-12-06 01:53:59,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:53:59,416 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:53:59,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10
[2022-12-06 01:53:59,417 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 190 transitions, 3115 flow
[2022-12-06 01:53:59,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:59,417 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:53:59,417 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:53:59,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-12-06 01:53:59,417 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:53:59,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:53:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1288096376, now seen corresponding path program 1 times
[2022-12-06 01:53:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:53:59,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018219731]
[2022-12-06 01:53:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:59,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:53:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:53:59,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:53:59,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018219731]
[2022-12-06 01:53:59,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018219731] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:53:59,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193317732]
[2022-12-06 01:53:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:53:59,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:53:59,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:53:59,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:53:59,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-12-06 01:53:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:53:59,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-12-06 01:53:59,822 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:53:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:53:59,853 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:53:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:53:59,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193317732] provided 1 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:53:59,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2022-12-06 01:53:59,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8
[2022-12-06 01:53:59,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692853644]
[2022-12-06 01:53:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:53:59,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:53:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:53:59,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:53:59,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2022-12-06 01:53:59,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:53:59,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 190 transitions, 3115 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:53:59,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:53:59,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:53:59,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:00,244 INFO L130 PetriNetUnfolder]: 1093/1597 cut-off events.
[2022-12-06 01:54:00,244 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES.
[2022-12-06 01:54:00,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14497 conditions, 1597 events. 1093/1597 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6112 event pairs, 0 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 13796. Up to 1595 conditions per place.
[2022-12-06 01:54:00,263 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 224 selfloop transitions, 52 changer transitions 33/309 dead transitions.
[2022-12-06 01:54:00,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 309 transitions, 5670 flow
[2022-12-06 01:54:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-12-06 01:54:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2022-12-06 01:54:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions.
[2022-12-06 01:54:00,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238
[2022-12-06 01:54:00,267 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places.
[2022-12-06 01:54:00,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:00,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 309 transitions, 5670 flow
[2022-12-06 01:54:00,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 309 transitions, 5670 flow
[2022-12-06 01:54:00,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:00,281 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:54:00,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17
[2022-12-06 01:54:00,284 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 309 transitions, 5670 flow
[2022-12-06 01:54:00,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:00,284 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:00,284 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:00,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2022-12-06 01:54:00,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:00,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:00,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2064217000, now seen corresponding path program 2 times
[2022-12-06 01:54:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:00,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728632917]
[2022-12-06 01:54:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:54:00,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:00,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728632917]
[2022-12-06 01:54:00,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728632917] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:54:00,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:54:00,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-12-06 01:54:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058524105]
[2022-12-06 01:54:00,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:54:00,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:54:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:00,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:54:00,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-12-06 01:54:00,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:00,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 309 transitions, 5670 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:00,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:00,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:00,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:01,205 INFO L130 PetriNetUnfolder]: 1895/2771 cut-off events.
[2022-12-06 01:54:01,206 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES.
[2022-12-06 01:54:01,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27910 conditions, 2771 events. 1895/2771 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11970 event pairs, 0 based on Foata normal form. 0/2170 useless extension candidates. Maximal degree in co-relation 26824. Up to 2769 conditions per place.
[2022-12-06 01:54:01,262 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 456 selfloop transitions, 30 changer transitions 99/585 dead transitions.
[2022-12-06 01:54:01,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 585 transitions, 11895 flow
[2022-12-06 01:54:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-12-06 01:54:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2022-12-06 01:54:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions.
[2022-12-06 01:54:01,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667
[2022-12-06 01:54:01,264 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places.
[2022-12-06 01:54:01,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:01,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 585 transitions, 11895 flow
[2022-12-06 01:54:01,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 585 transitions, 11895 flow
[2022-12-06 01:54:01,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:01,281 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:54:01,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17
[2022-12-06 01:54:01,281 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 585 transitions, 11895 flow
[2022-12-06 01:54:01,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:01,281 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:01,282 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:01,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-12-06 01:54:01,282 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:01,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1451182048, now seen corresponding path program 3 times
[2022-12-06 01:54:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:01,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123441420]
[2022-12-06 01:54:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:54:01,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:01,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123441420]
[2022-12-06 01:54:01,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123441420] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:54:01,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:54:01,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-12-06 01:54:01,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479832092]
[2022-12-06 01:54:01,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:54:01,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:54:01,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:01,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:54:01,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-12-06 01:54:01,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:01,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 585 transitions, 11895 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:01,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:01,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:01,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:02,139 INFO L130 PetriNetUnfolder]: 2143/3132 cut-off events.
[2022-12-06 01:54:02,139 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES.
[2022-12-06 01:54:02,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34662 conditions, 3132 events. 2143/3132 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13887 event pairs, 0 based on Foata normal form. 0/2447 useless extension candidates. Maximal degree in co-relation 33391. Up to 3130 conditions per place.
[2022-12-06 01:54:02,156 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 488 selfloop transitions, 42 changer transitions 132/662 dead transitions.
[2022-12-06 01:54:02,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 662 transitions, 14774 flow
[2022-12-06 01:54:02,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-12-06 01:54:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2022-12-06 01:54:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions.
[2022-12-06 01:54:02,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667
[2022-12-06 01:54:02,158 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places.
[2022-12-06 01:54:02,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:02,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 662 transitions, 14774 flow
[2022-12-06 01:54:02,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 662 transitions, 14774 flow
[2022-12-06 01:54:02,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:02,183 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:54:02,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25
[2022-12-06 01:54:02,183 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 662 transitions, 14774 flow
[2022-12-06 01:54:02,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:02,184 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:02,184 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:02,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-12-06 01:54:02,184 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:02,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1047085342, now seen corresponding path program 4 times
[2022-12-06 01:54:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:02,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589913786]
[2022-12-06 01:54:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:54:02,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:02,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589913786]
[2022-12-06 01:54:02,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589913786] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:54:02,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903590705]
[2022-12-06 01:54:02,457 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-12-06 01:54:02,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:02,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:54:02,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:54:02,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-12-06 01:54:02,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-12-06 01:54:02,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 01:54:02,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-12-06 01:54:02,666 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:54:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:54:02,703 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:54:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:54:02,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903590705] provided 1 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:54:02,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2022-12-06 01:54:02,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11
[2022-12-06 01:54:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657039042]
[2022-12-06 01:54:02,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:54:02,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:54:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:02,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:54:02,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2022-12-06 01:54:02,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:02,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 662 transitions, 14774 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:02,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:02,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:02,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:03,382 INFO L130 PetriNetUnfolder]: 2231/3256 cut-off events.
[2022-12-06 01:54:03,382 INFO L131 PetriNetUnfolder]: For 244/244 co-relation queries the response was YES.
[2022-12-06 01:54:03,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39285 conditions, 3256 events. 2231/3256 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14538 event pairs, 0 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 37902. Up to 3254 conditions per place.
[2022-12-06 01:54:03,400 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 500 selfloop transitions, 78 changer transitions 132/710 dead transitions.
[2022-12-06 01:54:03,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 710 transitions, 17256 flow
[2022-12-06 01:54:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-12-06 01:54:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2022-12-06 01:54:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions.
[2022-12-06 01:54:03,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667
[2022-12-06 01:54:03,402 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places.
[2022-12-06 01:54:03,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:03,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 710 transitions, 17256 flow
[2022-12-06 01:54:03,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 710 transitions, 17256 flow
[2022-12-06 01:54:03,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:03,426 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:54:03,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24
[2022-12-06 01:54:03,427 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 710 transitions, 17256 flow
[2022-12-06 01:54:03,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:03,427 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:03,427 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:03,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2022-12-06 01:54:03,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:03,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1585229266, now seen corresponding path program 5 times
[2022-12-06 01:54:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:03,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531638371]
[2022-12-06 01:54:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:54:03,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:03,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531638371]
[2022-12-06 01:54:03,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531638371] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:54:03,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743511902]
[2022-12-06 01:54:03,861 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2022-12-06 01:54:03,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:03,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:54:03,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:54:03,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2022-12-06 01:54:04,384 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s)
[2022-12-06 01:54:04,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 01:54:04,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-12-06 01:54:04,390 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:54:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:54:04,417 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:54:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:54:04,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743511902] provided 1 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:54:04,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2022-12-06 01:54:04,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10
[2022-12-06 01:54:04,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419850744]
[2022-12-06 01:54:04,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:54:04,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:54:04,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:04,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:54:04,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2022-12-06 01:54:04,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:04,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 710 transitions, 17256 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:04,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:04,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:04,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:05,121 INFO L130 PetriNetUnfolder]: 2283/3344 cut-off events.
[2022-12-06 01:54:05,122 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES.
[2022-12-06 01:54:05,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43688 conditions, 3344 events. 2283/3344 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 15176 event pairs, 0 based on Foata normal form. 0/2651 useless extension candidates. Maximal degree in co-relation 42193. Up to 3342 conditions per place.
[2022-12-06 01:54:05,139 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 500 selfloop transitions, 100 changer transitions 132/732 dead transitions.
[2022-12-06 01:54:05,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 732 transitions, 19251 flow
[2022-12-06 01:54:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-12-06 01:54:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2022-12-06 01:54:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions.
[2022-12-06 01:54:05,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555
[2022-12-06 01:54:05,140 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places.
[2022-12-06 01:54:05,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:05,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 732 transitions, 19251 flow
[2022-12-06 01:54:05,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 732 transitions, 19251 flow
[2022-12-06 01:54:05,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:05,164 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:54:05,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24
[2022-12-06 01:54:05,164 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 732 transitions, 19251 flow
[2022-12-06 01:54:05,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:05,165 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:05,165 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:05,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2022-12-06 01:54:05,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:05,374 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -211470640, now seen corresponding path program 6 times
[2022-12-06 01:54:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:05,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288511633]
[2022-12-06 01:54:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2022-12-06 01:54:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288511633]
[2022-12-06 01:54:05,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288511633] provided 1 perfect and 0 imperfect interpolant sequences
[2022-12-06 01:54:05,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-12-06 01:54:05,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-12-06 01:54:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186814583]
[2022-12-06 01:54:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-12-06 01:54:05,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-12-06 01:54:05,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:05,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-12-06 01:54:05,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-12-06 01:54:05,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:05,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 732 transitions, 19251 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:05,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:05,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:05,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:06,293 INFO L130 PetriNetUnfolder]: 2207/3226 cut-off events.
[2022-12-06 01:54:06,293 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES.
[2022-12-06 01:54:06,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45376 conditions, 3226 events. 2207/3226 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14495 event pairs, 0 based on Foata normal form. 0/2577 useless extension candidates. Maximal degree in co-relation 43940. Up to 3224 conditions per place.
[2022-12-06 01:54:06,314 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 496 selfloop transitions, 54 changer transitions 152/702 dead transitions.
[2022-12-06 01:54:06,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 702 transitions, 19866 flow
[2022-12-06 01:54:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-12-06 01:54:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2022-12-06 01:54:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions.
[2022-12-06 01:54:06,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2022-12-06 01:54:06,316 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places.
[2022-12-06 01:54:06,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:06,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 702 transitions, 19866 flow
[2022-12-06 01:54:06,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 702 transitions, 19866 flow
[2022-12-06 01:54:06,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:06,347 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:54:06,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32
[2022-12-06 01:54:06,348 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 702 transitions, 19866 flow
[2022-12-06 01:54:06,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:06,348 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:06,348 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:06,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-12-06 01:54:06,349 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:06,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash 518431137, now seen corresponding path program 1 times
[2022-12-06 01:54:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:06,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786608563]
[2022-12-06 01:54:06,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-12-06 01:54:07,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:07,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786608563]
[2022-12-06 01:54:07,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786608563] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:54:07,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708158194]
[2022-12-06 01:54:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:54:07,475 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:54:07,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2022-12-06 01:54:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:07,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 54 conjunts are in the unsatisfiable core
[2022-12-06 01:54:07,644 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:54:08,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:54:08,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:54:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-12-06 01:54:08,052 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:54:08,517 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:54:08,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:54:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2022-12-06 01:54:08,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708158194] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:54:08,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:54:08,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 10] total 30
[2022-12-06 01:54:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031429422]
[2022-12-06 01:54:08,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:54:08,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2022-12-06 01:54:08,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:08,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2022-12-06 01:54:08,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930
[2022-12-06 01:54:08,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:08,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 702 transitions, 19866 flow. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:08,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:08,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:08,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:11,983 INFO L130 PetriNetUnfolder]: 5524/8098 cut-off events.
[2022-12-06 01:54:11,983 INFO L131 PetriNetUnfolder]: For 709/709 co-relation queries the response was YES.
[2022-12-06 01:54:11,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121988 conditions, 8098 events. 5524/8098 cut-off events. For 709/709 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 43587 event pairs, 5 based on Foata normal form. 1/6266 useless extension candidates. Maximal degree in co-relation 116516. Up to 8096 conditions per place.
[2022-12-06 01:54:12,038 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 927 selfloop transitions, 338 changer transitions 389/1654 dead transitions.
[2022-12-06 01:54:12,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 1654 transitions, 50214 flow
[2022-12-06 01:54:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-12-06 01:54:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2022-12-06 01:54:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 240 transitions.
[2022-12-06 01:54:12,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4
[2022-12-06 01:54:12,041 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 71 predicate places.
[2022-12-06 01:54:12,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:12,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 1654 transitions, 50214 flow
[2022-12-06 01:54:12,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 1654 transitions, 50214 flow
[2022-12-06 01:54:12,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:13,034 INFO L203 LiptonReduction]: Total number of compositions: 1
[2022-12-06 01:54:13,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 995
[2022-12-06 01:54:13,036 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 1653 transitions, 50184 flow
[2022-12-06 01:54:13,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:13,036 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:13,036 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:13,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2022-12-06 01:54:13,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2022-12-06 01:54:13,246 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash -691013315, now seen corresponding path program 1 times
[2022-12-06 01:54:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:13,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863380974]
[2022-12-06 01:54:13,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:13,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2022-12-06 01:54:15,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:15,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863380974]
[2022-12-06 01:54:15,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863380974] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:54:15,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379946164]
[2022-12-06 01:54:15,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:15,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:15,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:54:15,428 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:54:15,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2022-12-06 01:54:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:15,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 54 conjunts are in the unsatisfiable core
[2022-12-06 01:54:15,593 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:54:16,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:54:16,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:54:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-12-06 01:54:16,072 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:54:16,532 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:54:16,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:54:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-12-06 01:54:16,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379946164] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:54:16,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:54:16,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 10] total 42
[2022-12-06 01:54:16,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077695898]
[2022-12-06 01:54:16,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:54:16,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2022-12-06 01:54:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2022-12-06 01:54:16,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806
[2022-12-06 01:54:16,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:16,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 1653 transitions, 50184 flow. Second operand has 43 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:16,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:16,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:16,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:23,085 INFO L130 PetriNetUnfolder]: 6817/9940 cut-off events.
[2022-12-06 01:54:23,086 INFO L131 PetriNetUnfolder]: For 877/877 co-relation queries the response was YES.
[2022-12-06 01:54:23,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159625 conditions, 9940 events. 6817/9940 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 54816 event pairs, 26 based on Foata normal form. 1/7622 useless extension candidates. Maximal degree in co-relation 152867. Up to 9939 conditions per place.
[2022-12-06 01:54:23,144 INFO L137 encePairwiseOnDemand]: 10/30 looper letters, 1061 selfloop transitions, 507 changer transitions 765/2333 dead transitions.
[2022-12-06 01:54:23,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 2333 transitions, 75451 flow
[2022-12-06 01:54:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2022-12-06 01:54:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2022-12-06 01:54:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 394 transitions.
[2022-12-06 01:54:23,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3203252032520325
[2022-12-06 01:54:23,147 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 110 predicate places.
[2022-12-06 01:54:23,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:23,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 2333 transitions, 75451 flow
[2022-12-06 01:54:23,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 2333 transitions, 75451 flow
[2022-12-06 01:54:23,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:24,716 INFO L203 LiptonReduction]: Total number of compositions: 2
[2022-12-06 01:54:24,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1570
[2022-12-06 01:54:24,717 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 2331 transitions, 75387 flow
[2022-12-06 01:54:24,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:24,717 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:24,717 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:24,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2022-12-06 01:54:24,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2022-12-06 01:54:24,923 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1805330387, now seen corresponding path program 1 times
[2022-12-06 01:54:24,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:24,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122058684]
[2022-12-06 01:54:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:24,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2022-12-06 01:54:26,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:26,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122058684]
[2022-12-06 01:54:26,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122058684] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:54:26,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381856915]
[2022-12-06 01:54:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:26,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:26,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:54:26,533 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:54:26,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2022-12-06 01:54:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:26,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 54 conjunts are in the unsatisfiable core
[2022-12-06 01:54:26,711 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:54:27,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:54:27,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:54:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2022-12-06 01:54:27,052 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:54:27,502 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:54:27,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:54:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2022-12-06 01:54:27,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381856915] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:54:27,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:54:27,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 10] total 39
[2022-12-06 01:54:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523909473]
[2022-12-06 01:54:27,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:54:27,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2022-12-06 01:54:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:27,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2022-12-06 01:54:27,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1401, Unknown=0, NotChecked=0, Total=1560
[2022-12-06 01:54:27,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:27,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 2331 transitions, 75387 flow. Second operand has 40 states, 39 states have (on average 2.076923076923077) internal successors, (81), 40 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:27,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:27,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:27,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:34,337 INFO L130 PetriNetUnfolder]: 7012/10283 cut-off events.
[2022-12-06 01:54:34,338 INFO L131 PetriNetUnfolder]: For 906/906 co-relation queries the response was YES.
[2022-12-06 01:54:34,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175417 conditions, 10283 events. 7012/10283 cut-off events. For 906/906 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 57771 event pairs, 46 based on Foata normal form. 1/7895 useless extension candidates. Maximal degree in co-relation 168066. Up to 10282 conditions per place.
[2022-12-06 01:54:34,411 INFO L137 encePairwiseOnDemand]: 12/30 looper letters, 1088 selfloop transitions, 493 changer transitions 861/2442 dead transitions.
[2022-12-06 01:54:34,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 2442 transitions, 83871 flow
[2022-12-06 01:54:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2022-12-06 01:54:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2022-12-06 01:54:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 276 transitions.
[2022-12-06 01:54:34,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857
[2022-12-06 01:54:34,416 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 135 predicate places.
[2022-12-06 01:54:34,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:34,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 2442 transitions, 83871 flow
[2022-12-06 01:54:34,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 2442 transitions, 83871 flow
[2022-12-06 01:54:34,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:36,379 INFO L203 LiptonReduction]: Total number of compositions: 1
[2022-12-06 01:54:36,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1964
[2022-12-06 01:54:36,381 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 2441 transitions, 83837 flow
[2022-12-06 01:54:36,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.076923076923077) internal successors, (81), 40 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:36,381 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:36,381 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:36,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2022-12-06 01:54:36,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2022-12-06 01:54:36,587 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1903520068, now seen corresponding path program 1 times
[2022-12-06 01:54:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:36,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544357569]
[2022-12-06 01:54:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2022-12-06 01:54:38,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:38,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544357569]
[2022-12-06 01:54:38,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544357569] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:54:38,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721300196]
[2022-12-06 01:54:38,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:38,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:38,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:54:38,297 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:54:38,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2022-12-06 01:54:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:38,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 54 conjunts are in the unsatisfiable core
[2022-12-06 01:54:38,474 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:54:38,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:54:38,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:54:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2022-12-06 01:54:38,928 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:54:39,475 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:54:39,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:54:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2022-12-06 01:54:39,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721300196] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:54:39,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:54:39,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 10] total 40
[2022-12-06 01:54:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088806233]
[2022-12-06 01:54:39,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:54:39,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2022-12-06 01:54:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2022-12-06 01:54:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640
[2022-12-06 01:54:39,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:39,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 2441 transitions, 83837 flow. Second operand has 41 states, 40 states have (on average 2.1) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:39,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:39,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:39,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:46,322 INFO L130 PetriNetUnfolder]: 7156/10500 cut-off events.
[2022-12-06 01:54:46,323 INFO L131 PetriNetUnfolder]: For 926/926 co-relation queries the response was YES.
[2022-12-06 01:54:46,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189621 conditions, 10500 events. 7156/10500 cut-off events. For 926/926 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 59223 event pairs, 14 based on Foata normal form. 2/8045 useless extension candidates. Maximal degree in co-relation 181533. Up to 10499 conditions per place.
[2022-12-06 01:54:46,387 INFO L137 encePairwiseOnDemand]: 11/30 looper letters, 1155 selfloop transitions, 456 changer transitions 863/2474 dead transitions.
[2022-12-06 01:54:46,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 2474 transitions, 89928 flow
[2022-12-06 01:54:46,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2022-12-06 01:54:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2022-12-06 01:54:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 238 transitions.
[2022-12-06 01:54:46,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33055555555555555
[2022-12-06 01:54:46,389 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 157 predicate places.
[2022-12-06 01:54:46,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:46,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 2474 transitions, 89928 flow
[2022-12-06 01:54:46,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 2474 transitions, 89928 flow
[2022-12-06 01:54:46,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:54:48,218 INFO L203 LiptonReduction]: Total number of compositions: 1
[2022-12-06 01:54:48,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1830
[2022-12-06 01:54:48,219 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 2473 transitions, 89892 flow
[2022-12-06 01:54:48,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.1) internal successors, (84), 41 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:48,219 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:54:48,219 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:54:48,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2022-12-06 01:54:48,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2022-12-06 01:54:48,420 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:54:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:54:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1406516331, now seen corresponding path program 1 times
[2022-12-06 01:54:48,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:54:48,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349040699]
[2022-12-06 01:54:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:54:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2022-12-06 01:54:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:54:49,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349040699]
[2022-12-06 01:54:49,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349040699] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:54:49,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841764951]
[2022-12-06 01:54:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:54:49,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:54:49,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:54:49,380 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:54:49,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2022-12-06 01:54:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:54:49,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 54 conjunts are in the unsatisfiable core
[2022-12-06 01:54:49,553 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:54:49,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:54:49,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:54:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2022-12-06 01:54:49,849 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:54:50,248 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:54:50,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:54:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2022-12-06 01:54:50,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841764951] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:54:50,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:54:50,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 10] total 29
[2022-12-06 01:54:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854131077]
[2022-12-06 01:54:50,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:54:50,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2022-12-06 01:54:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:54:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2022-12-06 01:54:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870
[2022-12-06 01:54:50,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30
[2022-12-06 01:54:50,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 2473 transitions, 89892 flow. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:54:50,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:54:50,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30
[2022-12-06 01:54:50,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:54:56,708 INFO L130 PetriNetUnfolder]: 7313/10727 cut-off events.
[2022-12-06 01:54:56,708 INFO L131 PetriNetUnfolder]: For 946/946 co-relation queries the response was YES.
[2022-12-06 01:54:56,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204446 conditions, 10727 events. 7313/10727 cut-off events. For 946/946 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 60574 event pairs, 42 based on Foata normal form. 1/8204 useless extension candidates. Maximal degree in co-relation 195704. Up to 10725 conditions per place.
[2022-12-06 01:54:56,775 INFO L137 encePairwiseOnDemand]: 14/30 looper letters, 1155 selfloop transitions, 488 changer transitions 864/2507 dead transitions.
[2022-12-06 01:54:56,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 2507 transitions, 96145 flow
[2022-12-06 01:54:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2022-12-06 01:54:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2022-12-06 01:54:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 292 transitions.
[2022-12-06 01:54:56,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37435897435897436
[2022-12-06 01:54:56,779 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 181 predicate places.
[2022-12-06 01:54:56,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:54:56,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 2507 transitions, 96145 flow
[2022-12-06 01:54:56,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 2507 transitions, 96145 flow
[2022-12-06 01:54:56,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:55:00,475 INFO L203 LiptonReduction]: Total number of compositions: 2
[2022-12-06 01:55:00,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3699
[2022-12-06 01:55:00,479 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 2505 transitions, 96069 flow
[2022-12-06 01:55:00,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:55:00,479 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:55:00,479 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:55:00,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2022-12-06 01:55:00,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2022-12-06 01:55:00,684 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:55:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:55:00,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2127704870, now seen corresponding path program 1 times
[2022-12-06 01:55:00,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:55:00,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072005946]
[2022-12-06 01:55:00,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:55:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:55:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:55:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2022-12-06 01:55:02,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:55:02,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072005946]
[2022-12-06 01:55:02,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072005946] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:55:02,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604099162]
[2022-12-06 01:55:02,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:55:02,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:55:02,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:55:02,593 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:55:02,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2022-12-06 01:55:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:55:02,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 52 conjunts are in the unsatisfiable core
[2022-12-06 01:55:02,795 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:55:03,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:55:03,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:55:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2022-12-06 01:55:03,284 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:55:03,751 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:55:03,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:55:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2022-12-06 01:55:03,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604099162] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:55:03,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:55:03,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 10] total 39
[2022-12-06 01:55:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344456412]
[2022-12-06 01:55:03,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:55:03,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2022-12-06 01:55:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:55:03,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2022-12-06 01:55:03,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1405, Unknown=0, NotChecked=0, Total=1560
[2022-12-06 01:55:03,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31
[2022-12-06 01:55:03,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 2505 transitions, 96069 flow. Second operand has 40 states, 39 states have (on average 2.051282051282051) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:55:03,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:55:03,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31
[2022-12-06 01:55:03,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:55:11,408 INFO L130 PetriNetUnfolder]: 7617/11236 cut-off events.
[2022-12-06 01:55:11,409 INFO L131 PetriNetUnfolder]: For 1048/1048 co-relation queries the response was YES.
[2022-12-06 01:55:11,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225396 conditions, 11236 events. 7617/11236 cut-off events. For 1048/1048 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 64462 event pairs, 34 based on Foata normal form. 2/8580 useless extension candidates. Maximal degree in co-relation 215524. Up to 11236 conditions per place.
[2022-12-06 01:55:11,508 INFO L137 encePairwiseOnDemand]: 12/31 looper letters, 1216 selfloop transitions, 471 changer transitions 941/2628 dead transitions.
[2022-12-06 01:55:11,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 2628 transitions, 106086 flow
[2022-12-06 01:55:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2022-12-06 01:55:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2022-12-06 01:55:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 252 transitions.
[2022-12-06 01:55:11,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043
[2022-12-06 01:55:11,510 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 201 predicate places.
[2022-12-06 01:55:11,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:55:11,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 2628 transitions, 106086 flow
[2022-12-06 01:55:11,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 2628 transitions, 106086 flow
[2022-12-06 01:55:11,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:55:18,662 INFO L203 LiptonReduction]: Total number of compositions: 5
[2022-12-06 01:55:18,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7153
[2022-12-06 01:55:18,663 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 2623 transitions, 105886 flow
[2022-12-06 01:55:18,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.051282051282051) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:55:18,663 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:55:18,663 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:55:18,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2022-12-06 01:55:18,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:55:18,869 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:55:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:55:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1431613793, now seen corresponding path program 1 times
[2022-12-06 01:55:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:55:18,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182666818]
[2022-12-06 01:55:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:55:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:55:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:55:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-12-06 01:55:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:55:19,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182666818]
[2022-12-06 01:55:19,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182666818] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:55:19,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360556916]
[2022-12-06 01:55:19,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:55:19,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:55:19,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:55:19,638 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:55:19,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2022-12-06 01:55:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:55:19,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 52 conjunts are in the unsatisfiable core
[2022-12-06 01:55:19,813 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:55:20,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:55:20,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:55:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-12-06 01:55:20,057 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:55:20,464 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:55:20,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:55:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-12-06 01:55:20,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360556916] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:55:20,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:55:20,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 10] total 27
[2022-12-06 01:55:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894169365]
[2022-12-06 01:55:20,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:55:20,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2022-12-06 01:55:20,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:55:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2022-12-06 01:55:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756
[2022-12-06 01:55:20,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28
[2022-12-06 01:55:20,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 2623 transitions, 105886 flow. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:55:20,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:55:20,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28
[2022-12-06 01:55:20,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:55:27,111 INFO L130 PetriNetUnfolder]: 7650/11291 cut-off events.
[2022-12-06 01:55:27,111 INFO L131 PetriNetUnfolder]: For 1040/1040 co-relation queries the response was YES.
[2022-12-06 01:55:27,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237793 conditions, 11291 events. 7650/11291 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 64896 event pairs, 26 based on Foata normal form. 1/8620 useless extension candidates. Maximal degree in co-relation 227475. Up to 11292 conditions per place.
[2022-12-06 01:55:27,231 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 1204 selfloop transitions, 493 changer transitions 944/2641 dead transitions.
[2022-12-06 01:55:27,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 2641 transitions, 111900 flow
[2022-12-06 01:55:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-12-06 01:55:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2022-12-06 01:55:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 249 transitions.
[2022-12-06 01:55:27,233 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4042207792207792
[2022-12-06 01:55:27,233 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 201 predicate places.
[2022-12-06 01:55:27,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:55:27,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 2641 transitions, 111900 flow
[2022-12-06 01:55:27,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 2641 transitions, 111900 flow
[2022-12-06 01:55:27,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:55:30,659 INFO L203 LiptonReduction]: Total number of compositions: 2
[2022-12-06 01:55:30,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3426
[2022-12-06 01:55:30,660 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 2639 transitions, 111816 flow
[2022-12-06 01:55:30,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:55:30,660 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:55:30,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:55:30,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2022-12-06 01:55:30,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:55:30,866 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:55:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:55:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1364350942, now seen corresponding path program 1 times
[2022-12-06 01:55:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:55:30,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234352598]
[2022-12-06 01:55:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:55:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:55:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:55:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-12-06 01:55:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:55:31,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234352598]
[2022-12-06 01:55:31,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234352598] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:55:31,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119450980]
[2022-12-06 01:55:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:55:31,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:55:31,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:55:32,013 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:55:32,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2022-12-06 01:55:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:55:32,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 52 conjunts are in the unsatisfiable core
[2022-12-06 01:55:32,256 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:55:32,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:55:32,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:55:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-12-06 01:55:32,542 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:55:32,908 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:55:32,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:55:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-12-06 01:55:33,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119450980] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:55:33,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:55:33,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 10] total 35
[2022-12-06 01:55:33,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232785019]
[2022-12-06 01:55:33,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:55:33,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-12-06 01:55:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:55:33,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-12-06 01:55:33,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260
[2022-12-06 01:55:33,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28
[2022-12-06 01:55:33,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 2639 transitions, 111816 flow. Second operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:55:33,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:55:33,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28
[2022-12-06 01:55:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:55:41,426 INFO L130 PetriNetUnfolder]: 8443/12473 cut-off events.
[2022-12-06 01:55:41,427 INFO L131 PetriNetUnfolder]: For 1181/1181 co-relation queries the response was YES.
[2022-12-06 01:55:41,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275136 conditions, 12473 events. 8443/12473 cut-off events. For 1181/1181 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 73121 event pairs, 20 based on Foata normal form. 1/9515 useless extension candidates. Maximal degree in co-relation 263441. Up to 12474 conditions per place.
[2022-12-06 01:55:41,530 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 1290 selfloop transitions, 539 changer transitions 1136/2965 dead transitions.
[2022-12-06 01:55:41,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 2965 transitions, 131543 flow
[2022-12-06 01:55:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2022-12-06 01:55:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2022-12-06 01:55:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 339 transitions.
[2022-12-06 01:55:41,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36688311688311687
[2022-12-06 01:55:41,532 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 230 predicate places.
[2022-12-06 01:55:41,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:55:41,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 2965 transitions, 131543 flow
[2022-12-06 01:55:41,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 2965 transitions, 131543 flow
[2022-12-06 01:55:41,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:56:00,181 INFO L203 LiptonReduction]: Total number of compositions: 3
[2022-12-06 01:56:00,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18650
[2022-12-06 01:56:00,183 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 2962 transitions, 131411 flow
[2022-12-06 01:56:00,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:56:00,183 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:56:00,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:56:00,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2022-12-06 01:56:00,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:56:00,391 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:56:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:56:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1938588809, now seen corresponding path program 1 times
[2022-12-06 01:56:00,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:56:00,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605221770]
[2022-12-06 01:56:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:56:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:56:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:56:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:01,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:56:01,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605221770]
[2022-12-06 01:56:01,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605221770] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:56:01,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494050047]
[2022-12-06 01:56:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:56:01,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:56:01,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:56:01,136 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:56:01,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2022-12-06 01:56:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:56:01,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 50 conjunts are in the unsatisfiable core
[2022-12-06 01:56:01,349 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:56:01,611 INFO L173 IndexEqualityManager]: detected equality via solver
[2022-12-06 01:56:01,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:56:01,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:56:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:01,650 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:56:02,133 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:56:02,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:56:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:02,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494050047] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:56:02,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:56:02,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 26
[2022-12-06 01:56:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686410972]
[2022-12-06 01:56:02,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:56:02,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-12-06 01:56:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:56:02,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-12-06 01:56:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702
[2022-12-06 01:56:02,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29
[2022-12-06 01:56:02,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 2962 transitions, 131411 flow. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 27 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:56:02,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:56:02,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29
[2022-12-06 01:56:02,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:56:10,681 INFO L130 PetriNetUnfolder]: 8604/12754 cut-off events.
[2022-12-06 01:56:10,681 INFO L131 PetriNetUnfolder]: For 1202/1202 co-relation queries the response was YES.
[2022-12-06 01:56:10,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294088 conditions, 12754 events. 8604/12754 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 75712 event pairs, 40 based on Foata normal form. 1/9741 useless extension candidates. Maximal degree in co-relation 281748. Up to 12755 conditions per place.
[2022-12-06 01:56:10,769 INFO L137 encePairwiseOnDemand]: 13/29 looper letters, 1310 selfloop transitions, 530 changer transitions 1214/3054 dead transitions.
[2022-12-06 01:56:10,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 3054 transitions, 141603 flow
[2022-12-06 01:56:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-12-06 01:56:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2022-12-06 01:56:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 250 transitions.
[2022-12-06 01:56:10,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39184952978056425
[2022-12-06 01:56:10,770 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 245 predicate places.
[2022-12-06 01:56:10,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:56:10,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 3054 transitions, 141603 flow
[2022-12-06 01:56:10,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 3054 transitions, 141603 flow
[2022-12-06 01:56:10,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:56:23,448 WARN L233 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 290 DAG size of output: 286 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2022-12-06 01:56:26,803 INFO L203 LiptonReduction]: Total number of compositions: 1
[2022-12-06 01:56:26,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16034
[2022-12-06 01:56:26,804 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 3053 transitions, 141557 flow
[2022-12-06 01:56:26,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 27 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:56:26,804 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:56:26,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:56:26,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0
[2022-12-06 01:56:27,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2022-12-06 01:56:27,005 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:56:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:56:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1617216971, now seen corresponding path program 1 times
[2022-12-06 01:56:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:56:27,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951750839]
[2022-12-06 01:56:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:56:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:56:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:56:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:56:27,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951750839]
[2022-12-06 01:56:27,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951750839] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:56:27,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039831321]
[2022-12-06 01:56:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:56:27,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:56:27,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:56:27,825 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:56:27,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2022-12-06 01:56:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:56:28,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 50 conjunts are in the unsatisfiable core
[2022-12-06 01:56:28,032 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:56:28,284 INFO L173 IndexEqualityManager]: detected equality via solver
[2022-12-06 01:56:28,304 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size
[2022-12-06 01:56:28,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 43
[2022-12-06 01:56:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:28,338 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:56:28,696 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:56:28,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:56:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:28,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039831321] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:56:28,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:56:28,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 29
[2022-12-06 01:56:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061721656]
[2022-12-06 01:56:28,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:56:28,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2022-12-06 01:56:28,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:56:28,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2022-12-06 01:56:28,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870
[2022-12-06 01:56:28,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27
[2022-12-06 01:56:28,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 3053 transitions, 141557 flow. Second operand has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:56:28,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:56:28,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27
[2022-12-06 01:56:28,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:56:40,774 INFO L130 PetriNetUnfolder]: 10523/15703 cut-off events.
[2022-12-06 01:56:40,775 INFO L131 PetriNetUnfolder]: For 1606/1606 co-relation queries the response was YES.
[2022-12-06 01:56:40,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377818 conditions, 15703 events. 10523/15703 cut-off events. For 1606/1606 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 97928 event pairs, 40 based on Foata normal form. 1/11906 useless extension candidates. Maximal degree in co-relation 301879. Up to 15704 conditions per place.
[2022-12-06 01:56:41,025 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 1543 selfloop transitions, 668 changer transitions 1462/3673 dead transitions.
[2022-12-06 01:56:41,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 3673 transitions, 177786 flow
[2022-12-06 01:56:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2022-12-06 01:56:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2022-12-06 01:56:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 439 transitions.
[2022-12-06 01:56:41,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39656729900632337
[2022-12-06 01:56:41,034 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 283 predicate places.
[2022-12-06 01:56:41,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:56:41,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 317 places, 3673 transitions, 177786 flow
[2022-12-06 01:56:41,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 317 places, 3673 transitions, 177786 flow
[2022-12-06 01:56:41,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:56:41,212 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:56:41,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179
[2022-12-06 01:56:41,213 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 3673 transitions, 177786 flow
[2022-12-06 01:56:41,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:56:41,213 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:56:41,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:56:41,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0
[2022-12-06 01:56:41,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:56:41,420 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:56:41,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:56:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash -284441975, now seen corresponding path program 2 times
[2022-12-06 01:56:41,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:56:41,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484159369]
[2022-12-06 01:56:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:56:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:56:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:56:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:42,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:56:42,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484159369]
[2022-12-06 01:56:42,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484159369] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:56:42,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687843591]
[2022-12-06 01:56:42,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-12-06 01:56:42,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:56:42,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:56:42,192 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:56:42,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2022-12-06 01:56:42,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-12-06 01:56:42,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 01:56:42,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 48 conjunts are in the unsatisfiable core
[2022-12-06 01:56:42,460 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:56:42,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:56:42,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 107
[2022-12-06 01:56:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:42,936 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:56:43,549 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:56:43,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:56:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:43,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687843591] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:56:43,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:56:43,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 28
[2022-12-06 01:56:43,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096718287]
[2022-12-06 01:56:43,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:56:43,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2022-12-06 01:56:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:56:43,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2022-12-06 01:56:43,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812
[2022-12-06 01:56:43,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24
[2022-12-06 01:56:43,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 3673 transitions, 177786 flow. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:56:43,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:56:43,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24
[2022-12-06 01:56:43,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:56:57,789 INFO L130 PetriNetUnfolder]: 10667/15921 cut-off events.
[2022-12-06 01:56:57,789 INFO L131 PetriNetUnfolder]: For 1633/1633 co-relation queries the response was YES.
[2022-12-06 01:56:57,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398986 conditions, 15921 events. 10667/15921 cut-off events. For 1633/1633 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 99461 event pairs, 48 based on Foata normal form. 2/12057 useless extension candidates. Maximal degree in co-relation 381216. Up to 15922 conditions per place.
[2022-12-06 01:56:57,908 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 1703 selfloop transitions, 539 changer transitions 1464/3706 dead transitions.
[2022-12-06 01:56:57,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 3706 transitions, 186803 flow
[2022-12-06 01:56:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2022-12-06 01:56:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2022-12-06 01:56:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 250 transitions.
[2022-12-06 01:56:57,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4528985507246377
[2022-12-06 01:56:57,910 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 305 predicate places.
[2022-12-06 01:56:57,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:56:57,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 3706 transitions, 186803 flow
[2022-12-06 01:56:58,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 339 places, 3706 transitions, 186803 flow
[2022-12-06 01:56:58,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:56:58,249 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:56:58,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340
[2022-12-06 01:56:58,250 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 3706 transitions, 186803 flow
[2022-12-06 01:56:58,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:56:58,250 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:56:58,250 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:56:58,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0
[2022-12-06 01:56:58,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:56:58,458 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:56:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:56:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1975649717, now seen corresponding path program 3 times
[2022-12-06 01:56:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:56:58,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945181068]
[2022-12-06 01:56:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:56:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:56:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:56:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:56:59,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:56:59,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945181068]
[2022-12-06 01:56:59,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945181068] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:56:59,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579376301]
[2022-12-06 01:56:59,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-12-06 01:56:59,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:56:59,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:56:59,409 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:56:59,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2022-12-06 01:56:59,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2022-12-06 01:56:59,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 01:56:59,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 50 conjunts are in the unsatisfiable core
[2022-12-06 01:56:59,798 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:57:00,112 INFO L173 IndexEqualityManager]: detected equality via solver
[2022-12-06 01:57:00,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:57:00,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:57:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:57:00,140 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:57:00,640 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:57:00,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:57:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:57:00,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579376301] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:57:00,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:57:00,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 28
[2022-12-06 01:57:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818669160]
[2022-12-06 01:57:00,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:57:00,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2022-12-06 01:57:00,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:57:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2022-12-06 01:57:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812
[2022-12-06 01:57:00,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24
[2022-12-06 01:57:00,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 3706 transitions, 186803 flow. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:57:00,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:57:00,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24
[2022-12-06 01:57:00,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:57:14,833 INFO L130 PetriNetUnfolder]: 10700/15981 cut-off events.
[2022-12-06 01:57:14,833 INFO L131 PetriNetUnfolder]: For 1618/1618 co-relation queries the response was YES.
[2022-12-06 01:57:14,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416473 conditions, 15981 events. 10700/15981 cut-off events. For 1618/1618 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 99891 event pairs, 34 based on Foata normal form. 1/12102 useless extension candidates. Maximal degree in co-relation 397922. Up to 15982 conditions per place.
[2022-12-06 01:57:14,989 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 1689 selfloop transitions, 571 changer transitions 1465/3725 dead transitions.
[2022-12-06 01:57:14,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 3725 transitions, 195215 flow
[2022-12-06 01:57:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2022-12-06 01:57:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2022-12-06 01:57:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 269 transitions.
[2022-12-06 01:57:14,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4483333333333333
[2022-12-06 01:57:14,995 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 329 predicate places.
[2022-12-06 01:57:14,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:57:14,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 363 places, 3725 transitions, 195215 flow
[2022-12-06 01:57:15,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 363 places, 3725 transitions, 195215 flow
[2022-12-06 01:57:15,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:57:15,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1072] L101-4-->L102-3: Formula: (and (= (+ |v_#pthreadsForks_29| 1) |v_#pthreadsForks_28|) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre21#1_15|))) (= |v_#pthreadsForks_29| |v_ULTIMATE.start_main_#t~pre21#1_15|)) InVars {#pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_95|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_7|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_17|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] and [1205] $Ultimate##0-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_Out_14| 0) (= v_~result_7~0_Out_24 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (= (ite (= (mod v_~isNull_1~0_In_1 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_thread1Thread1of1ForFork1_~stop~0#1_Out_16| v_~isNull_3~0_In_4)) InVars {~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1} OutVars{~isNull_3~0=v_~isNull_3~0_In_4, ~isNull_1~0=v_~isNull_1~0_In_1, thread1Thread1of1ForFork1_~stop~0#1=|v_thread1Thread1of1ForFork1_~stop~0#1_Out_16|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, ~result_7~0=v_~result_7~0_Out_24, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~stop~0#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_7~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1]
[2022-12-06 01:57:15,306 INFO L203 LiptonReduction]: Total number of compositions: 1
[2022-12-06 01:57:15,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312
[2022-12-06 01:57:15,308 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 3725 transitions, 195217 flow
[2022-12-06 01:57:15,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:57:15,308 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:57:15,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:57:15,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0
[2022-12-06 01:57:15,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:57:15,517 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:57:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:57:15,518 INFO L85 PathProgramCache]: Analyzing trace with hash 477642655, now seen corresponding path program 4 times
[2022-12-06 01:57:15,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:57:15,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350871473]
[2022-12-06 01:57:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:57:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:57:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:57:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:57:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:57:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350871473]
[2022-12-06 01:57:16,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350871473] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:57:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27398967]
[2022-12-06 01:57:16,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-12-06 01:57:16,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:57:16,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:57:16,695 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:57:16,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process
[2022-12-06 01:57:16,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-12-06 01:57:16,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 01:57:16,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 50 conjunts are in the unsatisfiable core
[2022-12-06 01:57:16,935 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:57:17,184 INFO L173 IndexEqualityManager]: detected equality via solver
[2022-12-06 01:57:17,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:57:17,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40
[2022-12-06 01:57:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:57:17,220 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:57:17,639 INFO L321 Elim1Store]: treesize reduction 34, result has 72.8 percent of original size
[2022-12-06 01:57:17,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 104
[2022-12-06 01:57:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:57:17,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27398967] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:57:17,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:57:17,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 25
[2022-12-06 01:57:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529316130]
[2022-12-06 01:57:17,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:57:17,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2022-12-06 01:57:17,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:57:17,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2022-12-06 01:57:17,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650
[2022-12-06 01:57:17,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25
[2022-12-06 01:57:17,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 3725 transitions, 195217 flow. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:57:17,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:57:17,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25
[2022-12-06 01:57:17,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:57:33,623 INFO L130 PetriNetUnfolder]: 10700/15980 cut-off events.
[2022-12-06 01:57:33,624 INFO L131 PetriNetUnfolder]: For 1620/1620 co-relation queries the response was YES.
[2022-12-06 01:57:33,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432429 conditions, 15980 events. 10700/15980 cut-off events. For 1620/1620 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 100220 event pairs, 20 based on Foata normal form. 1/12101 useless extension candidates. Maximal degree in co-relation 346485. Up to 15981 conditions per place.
[2022-12-06 01:57:33,768 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 1686 selfloop transitions, 570 changer transitions 1468/3724 dead transitions.
[2022-12-06 01:57:33,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 3724 transitions, 202613 flow
[2022-12-06 01:57:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-12-06 01:57:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2022-12-06 01:57:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 242 transitions.
[2022-12-06 01:57:33,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44
[2022-12-06 01:57:33,770 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 350 predicate places.
[2022-12-06 01:57:33,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:57:33,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 384 places, 3724 transitions, 202613 flow
[2022-12-06 01:57:33,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 384 places, 3724 transitions, 202613 flow
[2022-12-06 01:57:33,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:57:33,999 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:57:34,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230
[2022-12-06 01:57:34,000 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 3724 transitions, 202613 flow
[2022-12-06 01:57:34,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:57:34,000 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:57:34,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:57:34,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0
[2022-12-06 01:57:34,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2022-12-06 01:57:34,210 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:57:34,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:57:34,211 INFO L85 PathProgramCache]: Analyzing trace with hash 820179252, now seen corresponding path program 1 times
[2022-12-06 01:57:34,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:57:34,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622993738]
[2022-12-06 01:57:34,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:57:34,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:57:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:57:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:57:35,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:57:35,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622993738]
[2022-12-06 01:57:35,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622993738] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:57:35,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694489561]
[2022-12-06 01:57:35,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:57:35,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:57:35,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:57:35,119 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:57:35,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2022-12-06 01:57:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:57:35,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 58 conjunts are in the unsatisfiable core
[2022-12-06 01:57:35,373 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:57:35,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106
[2022-12-06 01:57:35,653 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-12-06 01:57:35,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25
[2022-12-06 01:57:35,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:57:35,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32
[2022-12-06 01:57:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:57:35,925 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:57:38,421 INFO L321 Elim1Store]: treesize reduction 19, result has 84.8 percent of original size
[2022-12-06 01:57:38,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 217
[2022-12-06 01:57:38,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:57:38,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 115
[2022-12-06 01:57:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:57:40,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694489561] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:57:40,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:57:40,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 35
[2022-12-06 01:57:40,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575790026]
[2022-12-06 01:57:40,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:57:40,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-12-06 01:57:40,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:57:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-12-06 01:57:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1146, Unknown=26, NotChecked=0, Total=1332
[2022-12-06 01:57:40,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25
[2022-12-06 01:57:40,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 3724 transitions, 202613 flow. Second operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:57:40,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:57:40,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25
[2022-12-06 01:57:40,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:58:16,919 WARN L233 SmtUtils]: Spent 35.92s on a formula simplification. DAG size of input: 88 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-12-06 01:58:39,667 INFO L130 PetriNetUnfolder]: 16237/24605 cut-off events.
[2022-12-06 01:58:39,667 INFO L131 PetriNetUnfolder]: For 2968/2968 co-relation queries the response was YES.
[2022-12-06 01:58:39,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690629 conditions, 24605 events. 16237/24605 cut-off events. For 2968/2968 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 169536 event pairs, 87 based on Foata normal form. 2/18575 useless extension candidates. Maximal degree in co-relation 525045. Up to 24606 conditions per place.
[2022-12-06 01:58:39,890 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 2562 selfloop transitions, 783 changer transitions 2668/6013 dead transitions.
[2022-12-06 01:58:39,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 6013 transitions, 339631 flow
[2022-12-06 01:58:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2022-12-06 01:58:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2022-12-06 01:58:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 301 transitions.
[2022-12-06 01:58:39,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43
[2022-12-06 01:58:39,892 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 377 predicate places.
[2022-12-06 01:58:39,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 01:58:39,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 411 places, 6013 transitions, 339631 flow
[2022-12-06 01:58:40,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 411 places, 6013 transitions, 339631 flow
[2022-12-06 01:58:40,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 01:58:40,477 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 01:58:40,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 585
[2022-12-06 01:58:40,477 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 6013 transitions, 339631 flow
[2022-12-06 01:58:40,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:58:40,478 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 01:58:40,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 01:58:40,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0
[2022-12-06 01:58:40,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2022-12-06 01:58:40,685 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 01:58:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 01:58:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1795289376, now seen corresponding path program 2 times
[2022-12-06 01:58:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 01:58:40,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305944091]
[2022-12-06 01:58:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 01:58:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 01:58:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 01:58:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:58:41,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 01:58:41,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305944091]
[2022-12-06 01:58:41,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305944091] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 01:58:41,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183235907]
[2022-12-06 01:58:41,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-12-06 01:58:41,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 01:58:41,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 01:58:41,748 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 01:58:41,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process
[2022-12-06 01:58:42,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-12-06 01:58:42,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 01:58:42,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 56 conjunts are in the unsatisfiable core
[2022-12-06 01:58:42,095 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 01:58:42,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 158
[2022-12-06 01:58:42,304 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-12-06 01:58:42,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25
[2022-12-06 01:58:42,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:58:42,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 83
[2022-12-06 01:58:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:58:42,768 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 01:58:43,435 INFO L321 Elim1Store]: treesize reduction 19, result has 84.8 percent of original size
[2022-12-06 01:58:43,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 217
[2022-12-06 01:58:43,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 01:58:43,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 115
[2022-12-06 01:58:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 01:58:45,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183235907] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 01:58:45,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 01:58:45,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 37
[2022-12-06 01:58:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635786570]
[2022-12-06 01:58:45,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 01:58:45,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2022-12-06 01:58:45,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 01:58:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2022-12-06 01:58:45,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1291, Unknown=22, NotChecked=0, Total=1482
[2022-12-06 01:58:45,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25
[2022-12-06 01:58:45,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 6013 transitions, 339631 flow. Second operand has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 01:58:45,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 01:58:45,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25
[2022-12-06 01:58:45,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 01:59:39,514 WARN L233 SmtUtils]: Spent 54.14s on a formula simplification. DAG size of input: 93 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-12-06 02:00:24,305 INFO L130 PetriNetUnfolder]: 16525/25041 cut-off events.
[2022-12-06 02:00:24,305 INFO L131 PetriNetUnfolder]: For 3025/3025 co-relation queries the response was YES.
[2022-12-06 02:00:24,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727907 conditions, 25041 events. 16525/25041 cut-off events. For 3025/3025 co-relation queries the response was YES. Maximal size of possible extension queue 1433. Compared 172706 event pairs, 62 based on Foata normal form. 4/18877 useless extension candidates. Maximal degree in co-relation 552832. Up to 25042 conditions per place.
[2022-12-06 02:00:24,512 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 2630 selfloop transitions, 777 changer transitions 2672/6079 dead transitions.
[2022-12-06 02:00:24,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 6079 transitions, 355527 flow
[2022-12-06 02:00:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2022-12-06 02:00:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2022-12-06 02:00:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 272 transitions.
[2022-12-06 02:00:24,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4352
[2022-12-06 02:00:24,517 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 401 predicate places.
[2022-12-06 02:00:24,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 02:00:24,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 6079 transitions, 355527 flow
[2022-12-06 02:00:24,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 435 places, 6079 transitions, 355527 flow
[2022-12-06 02:00:24,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 02:00:24,920 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 02:00:24,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 414
[2022-12-06 02:00:24,932 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 6079 transitions, 355527 flow
[2022-12-06 02:00:24,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 02:00:24,933 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 02:00:24,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 02:00:24,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0
[2022-12-06 02:00:25,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2022-12-06 02:00:25,138 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 02:00:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 02:00:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2128148780, now seen corresponding path program 3 times
[2022-12-06 02:00:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 02:00:25,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988218679]
[2022-12-06 02:00:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 02:00:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 02:00:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 02:00:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 02:00:26,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 02:00:26,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988218679]
[2022-12-06 02:00:26,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988218679] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 02:00:26,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242352188]
[2022-12-06 02:00:26,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-12-06 02:00:26,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 02:00:26,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 02:00:26,245 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 02:00:26,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process
[2022-12-06 02:00:26,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2022-12-06 02:00:26,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 02:00:26,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 58 conjunts are in the unsatisfiable core
[2022-12-06 02:00:26,604 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 02:00:26,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 158
[2022-12-06 02:00:26,810 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-12-06 02:00:26,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25
[2022-12-06 02:00:27,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 02:00:27,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32
[2022-12-06 02:00:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 02:00:27,098 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 02:00:27,736 INFO L321 Elim1Store]: treesize reduction 19, result has 84.8 percent of original size
[2022-12-06 02:00:27,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 217
[2022-12-06 02:00:27,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 02:00:27,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 115
[2022-12-06 02:00:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 02:00:40,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242352188] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 02:00:40,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 02:00:40,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 35
[2022-12-06 02:00:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006641914]
[2022-12-06 02:00:40,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 02:00:40,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2022-12-06 02:00:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 02:00:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2022-12-06 02:00:40,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1166, Unknown=5, NotChecked=0, Total=1332
[2022-12-06 02:00:40,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25
[2022-12-06 02:00:40,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 6079 transitions, 355527 flow. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 02:00:40,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 02:00:40,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25
[2022-12-06 02:00:40,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 02:01:27,463 INFO L130 PetriNetUnfolder]: 16837/25491 cut-off events.
[2022-12-06 02:01:27,463 INFO L131 PetriNetUnfolder]: For 3073/3073 co-relation queries the response was YES.
[2022-12-06 02:01:27,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766471 conditions, 25491 events. 16837/25491 cut-off events. For 3073/3073 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 176486 event pairs, 78 based on Foata normal form. 2/19193 useless extension candidates. Maximal degree in co-relation 581963. Up to 25492 conditions per place.
[2022-12-06 02:01:27,702 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 2618 selfloop transitions, 849 changer transitions 2705/6172 dead transitions.
[2022-12-06 02:01:27,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 6172 transitions, 373313 flow
[2022-12-06 02:01:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2022-12-06 02:01:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2022-12-06 02:01:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 343 transitions.
[2022-12-06 02:01:27,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42875
[2022-12-06 02:01:27,704 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 432 predicate places.
[2022-12-06 02:01:27,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 02:01:27,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 466 places, 6172 transitions, 373313 flow
[2022-12-06 02:01:28,248 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 466 places, 6172 transitions, 373313 flow
[2022-12-06 02:01:28,248 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 02:01:28,259 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 02:01:28,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 557
[2022-12-06 02:01:28,261 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 6172 transitions, 373313 flow
[2022-12-06 02:01:28,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 02:01:28,261 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 02:01:28,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 02:01:28,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0
[2022-12-06 02:01:28,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 02:01:28,470 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 02:01:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 02:01:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash 286473856, now seen corresponding path program 4 times
[2022-12-06 02:01:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 02:01:28,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572200426]
[2022-12-06 02:01:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 02:01:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 02:01:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 02:01:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 02:01:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 02:01:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572200426]
[2022-12-06 02:01:29,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572200426] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 02:01:29,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283733524]
[2022-12-06 02:01:29,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-12-06 02:01:29,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 02:01:29,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 02:01:29,987 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 02:01:29,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process
[2022-12-06 02:01:30,254 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-12-06 02:01:30,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 02:01:30,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 58 conjunts are in the unsatisfiable core
[2022-12-06 02:01:30,265 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 02:01:30,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74
[2022-12-06 02:01:30,487 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-12-06 02:01:30,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25
[2022-12-06 02:01:30,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 02:01:30,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32
[2022-12-06 02:01:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 02:01:30,786 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 02:01:31,419 INFO L321 Elim1Store]: treesize reduction 19, result has 84.8 percent of original size
[2022-12-06 02:01:31,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 217
[2022-12-06 02:01:31,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 02:01:31,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 115
[2022-12-06 02:01:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 02:01:34,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283733524] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 02:01:34,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 02:01:34,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34
[2022-12-06 02:01:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711315090]
[2022-12-06 02:01:34,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 02:01:34,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2022-12-06 02:01:34,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 02:01:34,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2022-12-06 02:01:34,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1104, Unknown=9, NotChecked=0, Total=1260
[2022-12-06 02:01:34,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25
[2022-12-06 02:01:34,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 6172 transitions, 373313 flow. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 02:01:34,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 02:01:34,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25
[2022-12-06 02:01:34,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 02:02:27,339 INFO L130 PetriNetUnfolder]: 16903/25611 cut-off events.
[2022-12-06 02:02:27,339 INFO L131 PetriNetUnfolder]: For 3093/3093 co-relation queries the response was YES.
[2022-12-06 02:02:27,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795693 conditions, 25611 events. 16903/25611 cut-off events. For 3093/3093 co-relation queries the response was YES. Maximal size of possible extension queue 1469. Compared 176929 event pairs, 78 based on Foata normal form. 2/19285 useless extension candidates. Maximal degree in co-relation 604140. Up to 25612 conditions per place.
[2022-12-06 02:02:27,689 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 2646 selfloop transitions, 851 changer transitions 2711/6208 dead transitions.
[2022-12-06 02:02:27,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 6208 transitions, 387913 flow
[2022-12-06 02:02:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2022-12-06 02:02:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2022-12-06 02:02:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 294 transitions.
[2022-12-06 02:02:27,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42
[2022-12-06 02:02:27,694 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 459 predicate places.
[2022-12-06 02:02:27,695 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2022-12-06 02:02:27,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 493 places, 6208 transitions, 387913 flow
[2022-12-06 02:02:28,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 493 places, 6208 transitions, 387913 flow
[2022-12-06 02:02:28,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 0
[2022-12-06 02:02:28,110 INFO L203 LiptonReduction]: Total number of compositions: 0
[2022-12-06 02:02:28,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 429
[2022-12-06 02:02:28,123 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 6208 transitions, 387913 flow
[2022-12-06 02:02:28,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 02:02:28,123 INFO L205 CegarLoopForPetriNet]: Found error trace
[2022-12-06 02:02:28,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 02:02:28,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0
[2022-12-06 02:02:28,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 02:02:28,329 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2022-12-06 02:02:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-12-06 02:02:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1474983050, now seen corresponding path program 5 times
[2022-12-06 02:02:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-12-06 02:02:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37559672]
[2022-12-06 02:02:28,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-12-06 02:02:28,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-12-06 02:02:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-12-06 02:02:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 02:02:29,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-12-06 02:02:29,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37559672]
[2022-12-06 02:02:29,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37559672] provided 0 perfect and 1 imperfect interpolant sequences
[2022-12-06 02:02:29,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007334686]
[2022-12-06 02:02:29,762 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2022-12-06 02:02:29,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-12-06 02:02:29,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-12-06 02:02:29,763 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-12-06 02:02:29,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process
[2022-12-06 02:02:30,071 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s)
[2022-12-06 02:02:30,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-12-06 02:02:30,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 50 conjunts are in the unsatisfiable core
[2022-12-06 02:02:30,076 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-12-06 02:02:30,271 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-12-06 02:02:30,272 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-12-06 02:02:30,274 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2022-12-06 02:02:30,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25
[2022-12-06 02:02:30,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 02:02:30,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 139
[2022-12-06 02:02:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 02:02:30,769 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-12-06 02:02:41,614 INFO L321 Elim1Store]: treesize reduction 23, result has 81.6 percent of original size
[2022-12-06 02:02:41,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 168 treesize of output 221
[2022-12-06 02:02:41,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-12-06 02:02:41,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 123
[2022-12-06 02:02:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-12-06 02:02:46,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007334686] provided 0 perfect and 2 imperfect interpolant sequences
[2022-12-06 02:02:46,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-12-06 02:02:46,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 37
[2022-12-06 02:02:46,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980872258]
[2022-12-06 02:02:46,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-12-06 02:02:46,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2022-12-06 02:02:46,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-12-06 02:02:46,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2022-12-06 02:02:46,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1320, Unknown=17, NotChecked=0, Total=1482
[2022-12-06 02:02:46,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25
[2022-12-06 02:02:46,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 6208 transitions, 387913 flow. Second operand has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 38 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-12-06 02:02:46,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-12-06 02:02:46,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25
[2022-12-06 02:02:46,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-12-06 02:05:36,786 WARN L233 SmtUtils]: Spent 2.84m on a formula simplification. DAG size of input: 115 DAG size of output: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-12-06 02:05:39,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2022-12-06 02:05:41,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2022-12-06 02:05:43,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2022-12-06 02:05:45,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
Received shutdown request...
[2022-12-06 02:07:41,667 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2022-12-06 02:07:41,667 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2022-12-06 02:07:42,303 WARN L249 SmtUtils]: Removed 8 from assertion stack
[2022-12-06 02:07:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-12-06 02:07:42,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining)
[2022-12-06 02:07:42,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0
[2022-12-06 02:07:42,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30
[2022-12-06 02:07:42,505 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 114664ms..
[2022-12-06 02:07:42,507 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining)
[2022-12-06 02:07:42,507 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining)
[2022-12-06 02:07:42,507 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining)
[2022-12-06 02:07:42,507 INFO L458 BasicCegarLoop]: Path program histogram: [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-12-06 02:07:42,518 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-12-06 02:07:42,518 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-12-06 02:07:42,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:07:42 BasicIcfg
[2022-12-06 02:07:42,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-12-06 02:07:42,520 INFO L158 Benchmark]: Toolchain (without parser) took 836710.72ms. Allocated memory was 184.5MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 160.9MB in the beginning and 852.3MB in the end (delta: -691.4MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB.
[2022-12-06 02:07:42,520 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-12-06 02:07:42,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.07ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 148.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-12-06 02:07:42,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.41ms. Allocated memory is still 184.5MB. Free memory was 148.5MB in the beginning and 145.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-12-06 02:07:42,521 INFO L158 Benchmark]: Boogie Preprocessor took 39.05ms. Allocated memory is still 184.5MB. Free memory was 145.9MB in the beginning and 143.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-12-06 02:07:42,521 INFO L158 Benchmark]: RCFGBuilder took 475.35ms. Allocated memory is still 184.5MB. Free memory was 143.9MB in the beginning and 120.2MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB.
[2022-12-06 02:07:42,521 INFO L158 Benchmark]: TraceAbstraction took 835908.32ms. Allocated memory was 184.5MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 119.1MB in the beginning and 852.3MB in the end (delta: -733.2MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB.
[2022-12-06 02:07:42,522 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 234.07ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 148.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 48.41ms. Allocated memory is still 184.5MB. Free memory was 148.5MB in the beginning and 145.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 39.05ms. Allocated memory is still 184.5MB. Free memory was 145.9MB in the beginning and 143.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 475.35ms. Allocated memory is still 184.5MB. Free memory was 143.9MB in the beginning and 120.2MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB.
* TraceAbstraction took 835908.32ms. Allocated memory was 184.5MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 119.1MB in the beginning and 852.3MB in the end (delta: -733.2MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 7.9s, 281 PlacesBefore, 34 PlacesAfterwards, 299 TransitionsBefore, 30 TransitionsAfterwards, 15390 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 123 TrivialYvCompositions, 124 ConcurrentYvCompositions, 22 ChoiceCompositions, 269 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10136, independent: 10113, independent conditional: 10113, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10136, independent: 10113, independent conditional: 0, independent unconditional: 10113, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10136, independent: 10113, independent conditional: 0, independent unconditional: 10113, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10136, independent: 10113, independent conditional: 0, independent unconditional: 10113, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8953, independent: 8934, independent conditional: 0, independent unconditional: 8934, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8953, independent: 8934, independent conditional: 0, independent unconditional: 8934, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10136, independent: 1179, independent conditional: 0, independent unconditional: 1179, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 8953, unknown conditional: 0, unknown unconditional: 8953] , Statistics on independence cache: Total cache size (in pairs): 18953, Positive cache size: 18934, Positive conditional cache size: 0, Positive unconditional cache size: 18934, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 190 TransitionsBefore, 190 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 309 TransitionsBefore, 309 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 585 TransitionsBefore, 585 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 662 TransitionsBefore, 662 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 710 TransitionsBefore, 710 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 732 TransitionsBefore, 732 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 702 TransitionsBefore, 702 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.9s, 105 PlacesBefore, 104 PlacesAfterwards, 1654 TransitionsBefore, 1653 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 1.5s, 144 PlacesBefore, 142 PlacesAfterwards, 2333 TransitionsBefore, 2331 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 1.8s, 169 PlacesBefore, 168 PlacesAfterwards, 2442 TransitionsBefore, 2441 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 1.7s, 191 PlacesBefore, 190 PlacesAfterwards, 2474 TransitionsBefore, 2473 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 3.6s, 215 PlacesBefore, 213 PlacesAfterwards, 2507 TransitionsBefore, 2505 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 7.0s, 235 PlacesBefore, 214 PlacesAfterwards, 2628 TransitionsBefore, 2623 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 3.3s, 235 PlacesBefore, 232 PlacesAfterwards, 2641 TransitionsBefore, 2639 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 18.5s, 264 PlacesBefore, 260 PlacesAfterwards, 2965 TransitionsBefore, 2962 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 15.9s, 279 PlacesBefore, 278 PlacesAfterwards, 3054 TransitionsBefore, 3053 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 317 PlacesBefore, 317 PlacesAfterwards, 3673 TransitionsBefore, 3673 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 339 PlacesBefore, 339 PlacesAfterwards, 3706 TransitionsBefore, 3706 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.1s, 363 PlacesBefore, 363 PlacesAfterwards, 3725 TransitionsBefore, 3725 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 384 PlacesBefore, 384 PlacesAfterwards, 3724 TransitionsBefore, 3724 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 411 PlacesBefore, 411 PlacesAfterwards, 6013 TransitionsBefore, 6013 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 435 PlacesBefore, 435 PlacesAfterwards, 6079 TransitionsBefore, 6079 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 466 PlacesBefore, 466 PlacesAfterwards, 6172 TransitionsBefore, 6172 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 0.0s, 493 PlacesBefore, 493 PlacesAfterwards, 6208 TransitionsBefore, 6208 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1
- TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction)
Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 114664ms..
- TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 114664ms..
- TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 114664ms..
- TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 114664ms..
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 411 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 835.8s, OverallIterations: 31, TraceHistogramMax: 5, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 677.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 8794 SdHoareTripleChecker+Valid, 33.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8794 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 29.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1316 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38641 IncrementalHoareTripleChecker+Invalid, 39979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1316 mSolverCounterUnsat, 0 mSDtfsCounter, 38641 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2273 GetRequests, 1104 SyntacticMatches, 85 SemanticMatches, 1083 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16477 ImplicationChecksByTransitivity, 304.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387913occurred in iteration=30, InterpolantAutomatonStates: 532, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 78.4s InterpolantComputationTime, 1764 NumberOfCodeBlocks, 1740 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 2390 ConstructedInterpolants, 223 QuantifiedInterpolants, 31173 SizeOfPredicates, 690 NumberOfNonLiveVariables, 11889 ConjunctsInSsa, 1014 ConjunctsInUnsatCore, 79 InterpolantComputations, 11 PerfectInterpolantSequences, 1402/1672 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Completed graceful shutdown