/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-array-int-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:44:16,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:44:16,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:44:16,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:44:16,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:44:16,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:44:16,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:44:16,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:44:16,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:44:16,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:44:16,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:44:16,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:44:16,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:44:16,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:44:16,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:44:16,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:44:16,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:44:16,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:44:16,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:44:16,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:44:16,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:44:16,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:44:16,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:44:16,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:44:16,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:44:16,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:44:16,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:44:16,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:44:16,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:44:16,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:44:16,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:44:16,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:44:16,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:44:16,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:44:16,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:44:16,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:44:16,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:44:16,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:44:16,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:44:16,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:44:16,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:44:16,568 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:44:16,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:44:16,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:44:16,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:44:16,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:44:16,592 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:44:16,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:44:16,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:44:16,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:44:16,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:44:16,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:44:16,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:44:16,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:44:16,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:44:16,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:44:16,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:44:16,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:44:16,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:44:16,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:44:16,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:44:16,595 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:44:16,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:44:16,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:44:16,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:44:16,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:44:16,898 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:44:16,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-06 01:44:17,825 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:44:18,033 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:44:18,033 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-06 01:44:18,038 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2571c113a/437d6f0c12ce4078b2d34c5414ec7b02/FLAG57de1d0cc [2022-12-06 01:44:18,048 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2571c113a/437d6f0c12ce4078b2d34c5414ec7b02 [2022-12-06 01:44:18,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:44:18,050 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:44:18,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:44:18,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:44:18,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:44:18,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451a997e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18, skipping insertion in model container [2022-12-06 01:44:18,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:44:18,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:44:18,181 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-array-int-subst.wvr.c[2781,2794] [2022-12-06 01:44:18,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:44:18,193 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:44:18,208 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-array-int-subst.wvr.c[2781,2794] [2022-12-06 01:44:18,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:44:18,220 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:44:18,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18 WrapperNode [2022-12-06 01:44:18,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:44:18,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:44:18,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:44:18,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:44:18,226 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:44:18" (1/1) ... [2022-12-06 01:44:18,231 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:44:18" (1/1) ... [2022-12-06 01:44:18,249 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 281 [2022-12-06 01:44:18,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:44:18,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:44:18,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:44:18,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:44:18,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,269 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:44:18,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:44:18,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:44:18,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:44:18,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (1/1) ... [2022-12-06 01:44:18,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:44:18,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:44:18,332 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:44:18,349 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:44:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:44:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:44:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:44:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:44:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 01:44:18,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 01:44:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 01:44:18,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 01:44:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 01:44:18,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 01:44:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:44:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 01:44:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:44:18,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:44:18,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:44:18,357 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:44:18,445 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:44:18,446 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:44:18,799 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:44:18,809 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:44:18,809 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 01:44:18,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:44:18 BoogieIcfgContainer [2022-12-06 01:44:18,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:44:18,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:44:18,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:44:18,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:44:18,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:44:18" (1/3) ... [2022-12-06 01:44:18,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f635b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:44:18, skipping insertion in model container [2022-12-06 01:44:18,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:44:18" (2/3) ... [2022-12-06 01:44:18,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f635b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:44:18, skipping insertion in model container [2022-12-06 01:44:18,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:44:18" (3/3) ... [2022-12-06 01:44:18,817 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2022-12-06 01:44:18,831 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:44:18,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:44:18,831 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:44:18,967 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 01:44:19,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 318 transitions, 660 flow [2022-12-06 01:44:19,166 INFO L130 PetriNetUnfolder]: 29/315 cut-off events. [2022-12-06 01:44:19,167 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:44:19,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 315 events. 29/315 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 510 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-06 01:44:19,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 318 transitions, 660 flow [2022-12-06 01:44:19,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 305 transitions, 628 flow [2022-12-06 01:44:19,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:19,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 305 transitions, 628 flow [2022-12-06 01:44:19,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 305 transitions, 628 flow [2022-12-06 01:44:19,281 INFO L130 PetriNetUnfolder]: 29/305 cut-off events. [2022-12-06 01:44:19,281 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:44:19,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 305 events. 29/305 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 509 event pairs, 0 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-06 01:44:19,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 305 transitions, 628 flow [2022-12-06 01:44:19,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 14784 [2022-12-06 01:44:27,490 INFO L203 LiptonReduction]: Total number of compositions: 269 [2022-12-06 01:44:27,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:44:27,529 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;@68b4be6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:44:27,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 01:44:27,539 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-06 01:44:27,539 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 01:44:27,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:27,540 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:44:27,540 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:44:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash -33773561, now seen corresponding path program 1 times [2022-12-06 01:44:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:27,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666344753] [2022-12-06 01:44:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:27,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:28,529 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:44:28,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:28,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666344753] [2022-12-06 01:44:28,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666344753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:28,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:28,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:44:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561674969] [2022-12-06 01:44:28,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:28,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:44:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:44:28,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:44:28,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 01:44:28,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 90 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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:44:28,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:28,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 01:44:28,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:29,186 INFO L130 PetriNetUnfolder]: 1997/2838 cut-off events. [2022-12-06 01:44:29,186 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-06 01:44:29,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5910 conditions, 2838 events. 1997/2838 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11942 event pairs, 166 based on Foata normal form. 1/2235 useless extension candidates. Maximal degree in co-relation 2936. Up to 1149 conditions per place. [2022-12-06 01:44:29,198 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 118 selfloop transitions, 14 changer transitions 4/136 dead transitions. [2022-12-06 01:44:29,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 136 transitions, 607 flow [2022-12-06 01:44:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:44:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:44:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-12-06 01:44:29,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2022-12-06 01:44:29,211 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-06 01:44:29,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:29,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 136 transitions, 607 flow [2022-12-06 01:44:29,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 136 transitions, 607 flow [2022-12-06 01:44:29,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:39,149 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 01:44:39,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9939 [2022-12-06 01:44:39,150 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 133 transitions, 595 flow [2022-12-06 01:44:39,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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:44:39,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:39,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:44:39,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:44:39,151 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:44:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1804249511, now seen corresponding path program 1 times [2022-12-06 01:44:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:39,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759245773] [2022-12-06 01:44:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:39,543 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:44:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:39,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759245773] [2022-12-06 01:44:39,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759245773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:39,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:39,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:44:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533745826] [2022-12-06 01:44:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:39,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:44:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:39,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:44:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:44:39,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 01:44:39,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 133 transitions, 595 flow. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:44:39,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:39,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 01:44:39,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:39,944 INFO L130 PetriNetUnfolder]: 2067/2966 cut-off events. [2022-12-06 01:44:39,944 INFO L131 PetriNetUnfolder]: For 244/244 co-relation queries the response was YES. [2022-12-06 01:44:39,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9152 conditions, 2966 events. 2067/2966 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12817 event pairs, 166 based on Foata normal form. 1/2347 useless extension candidates. Maximal degree in co-relation 4704. Up to 1149 conditions per place. [2022-12-06 01:44:39,957 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 140 selfloop transitions, 11 changer transitions 11/162 dead transitions. [2022-12-06 01:44:39,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 162 transitions, 1053 flow [2022-12-06 01:44:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:44:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:44:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-06 01:44:39,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2022-12-06 01:44:39,959 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-06 01:44:39,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:39,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 162 transitions, 1053 flow [2022-12-06 01:44:39,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 162 transitions, 1053 flow [2022-12-06 01:44:39,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:39,971 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:44:39,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 01:44:39,972 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 162 transitions, 1053 flow [2022-12-06 01:44:39,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:44:39,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:39,973 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] [2022-12-06 01:44:39,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:44:39,973 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:44:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash -254007009, now seen corresponding path program 1 times [2022-12-06 01:44:39,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:39,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170941644] [2022-12-06 01:44:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:40,488 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:44:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:40,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170941644] [2022-12-06 01:44:40,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170941644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:40,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:40,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:44:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250447131] [2022-12-06 01:44:40,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:40,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:44:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:40,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:44:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:44:40,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 01:44:40,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 162 transitions, 1053 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:44:40,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:40,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 01:44:40,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:41,066 INFO L130 PetriNetUnfolder]: 3352/4804 cut-off events. [2022-12-06 01:44:41,066 INFO L131 PetriNetUnfolder]: For 391/391 co-relation queries the response was YES. [2022-12-06 01:44:41,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19611 conditions, 4804 events. 3352/4804 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 22712 event pairs, 193 based on Foata normal form. 1/3762 useless extension candidates. Maximal degree in co-relation 6576. Up to 2966 conditions per place. [2022-12-06 01:44:41,097 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 225 selfloop transitions, 6 changer transitions 15/246 dead transitions. [2022-12-06 01:44:41,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 246 transitions, 2094 flow [2022-12-06 01:44:41,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:44:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:44:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 01:44:41,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2022-12-06 01:44:41,101 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-06 01:44:41,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:41,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 246 transitions, 2094 flow [2022-12-06 01:44:41,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 246 transitions, 2094 flow [2022-12-06 01:44:41,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:41,123 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:44:41,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 01:44:41,124 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 246 transitions, 2094 flow [2022-12-06 01:44:41,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:44:41,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:41,124 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] [2022-12-06 01:44:41,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:44:41,124 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:44:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash -900159463, now seen corresponding path program 2 times [2022-12-06 01:44:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:41,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574594065] [2022-12-06 01:44:41,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:41,511 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:44:41,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:41,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574594065] [2022-12-06 01:44:41,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574594065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:41,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:41,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:44:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105569440] [2022-12-06 01:44:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:41,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:44:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:44:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:44:41,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 01:44:41,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 246 transitions, 2094 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:44:41,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:41,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 01:44:41,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:42,438 INFO L130 PetriNetUnfolder]: 4433/6436 cut-off events. [2022-12-06 01:44:42,438 INFO L131 PetriNetUnfolder]: For 544/544 co-relation queries the response was YES. [2022-12-06 01:44:42,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32716 conditions, 6436 events. 4433/6436 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 32701 event pairs, 220 based on Foata normal form. 2/5176 useless extension candidates. Maximal degree in co-relation 7776. Up to 4465 conditions per place. [2022-12-06 01:44:42,475 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 339 selfloop transitions, 12 changer transitions 33/384 dead transitions. [2022-12-06 01:44:42,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 384 transitions, 4035 flow [2022-12-06 01:44:42,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:44:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:44:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2022-12-06 01:44:42,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5865384615384616 [2022-12-06 01:44:42,478 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-06 01:44:42,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:42,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 384 transitions, 4035 flow [2022-12-06 01:44:42,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 384 transitions, 4035 flow [2022-12-06 01:44:42,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:42,508 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:44:42,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 01:44:42,513 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 384 transitions, 4035 flow [2022-12-06 01:44:42,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:44:42,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:42,513 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] [2022-12-06 01:44:42,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:44:42,513 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:44:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash -937204889, now seen corresponding path program 1 times [2022-12-06 01:44:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:42,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649314763] [2022-12-06 01:44:42,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:42,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:42,573 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:44:42,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:42,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649314763] [2022-12-06 01:44:42,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649314763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:42,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:42,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:44:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450159802] [2022-12-06 01:44:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:42,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:44:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:44:42,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:44:42,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 01:44:42,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 384 transitions, 4035 flow. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:44:42,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:42,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 01:44:42,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:43,343 INFO L130 PetriNetUnfolder]: 5471/7914 cut-off events. [2022-12-06 01:44:43,344 INFO L131 PetriNetUnfolder]: For 711/711 co-relation queries the response was YES. [2022-12-06 01:44:43,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48165 conditions, 7914 events. 5471/7914 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 41328 event pairs, 377 based on Foata normal form. 1/6303 useless extension candidates. Maximal degree in co-relation 9312. Up to 6436 conditions per place. [2022-12-06 01:44:43,378 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 411 selfloop transitions, 5 changer transitions 42/458 dead transitions. [2022-12-06 01:44:43,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 458 transitions, 5736 flow [2022-12-06 01:44:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:44:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:44:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-06 01:44:43,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-06 01:44:43,381 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2022-12-06 01:44:43,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:43,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 458 transitions, 5736 flow [2022-12-06 01:44:43,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 458 transitions, 5736 flow [2022-12-06 01:44:43,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:43,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:44:43,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 01:44:43,412 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 458 transitions, 5736 flow [2022-12-06 01:44:43,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:44:43,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:43,413 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:44:43,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:44:43,413 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:44:43,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1021923035, now seen corresponding path program 1 times [2022-12-06 01:44:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:43,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138605402] [2022-12-06 01:44:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:43,493 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:44:43,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:43,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138605402] [2022-12-06 01:44:43,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138605402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:43,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:43,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:44:43,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92337552] [2022-12-06 01:44:43,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:43,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:44:43,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:43,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:44:43,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:44:43,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 01:44:43,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 458 transitions, 5736 flow. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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:44:43,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:43,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 01:44:43,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:44,862 INFO L130 PetriNetUnfolder]: 7546/10868 cut-off events. [2022-12-06 01:44:44,863 INFO L131 PetriNetUnfolder]: For 1041/1041 co-relation queries the response was YES. [2022-12-06 01:44:44,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77046 conditions, 10868 events. 7546/10868 cut-off events. For 1041/1041 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 58827 event pairs, 691 based on Foata normal form. 2/8559 useless extension candidates. Maximal degree in co-relation 12473. Up to 9390 conditions per place. [2022-12-06 01:44:44,911 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 531 selfloop transitions, 13 changer transitions 60/604 dead transitions. [2022-12-06 01:44:44,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 604 transitions, 8786 flow [2022-12-06 01:44:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:44:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:44:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2022-12-06 01:44:44,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5705128205128205 [2022-12-06 01:44:44,914 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2022-12-06 01:44:44,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:44,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 604 transitions, 8786 flow [2022-12-06 01:44:44,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 604 transitions, 8786 flow [2022-12-06 01:44:44,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:45,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:44:45,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 764 [2022-12-06 01:44:45,678 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 603 transitions, 8772 flow [2022-12-06 01:44:45,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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:44:45,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:45,678 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:44:45,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:44:45,678 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:44:45,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash 725382928, now seen corresponding path program 1 times [2022-12-06 01:44:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:45,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927740723] [2022-12-06 01:44:45,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:45,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:45,720 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:44:45,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:45,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927740723] [2022-12-06 01:44:45,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927740723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:45,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:45,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:44:45,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225851252] [2022-12-06 01:44:45,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:45,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:44:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:45,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:44:45,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:44:45,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:44:45,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 603 transitions, 8772 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:44:45,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:45,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:44:45,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:46,593 INFO L130 PetriNetUnfolder]: 4635/6828 cut-off events. [2022-12-06 01:44:46,593 INFO L131 PetriNetUnfolder]: For 720/720 co-relation queries the response was YES. [2022-12-06 01:44:46,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55325 conditions, 6828 events. 4635/6828 cut-off events. For 720/720 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 35760 event pairs, 579 based on Foata normal form. 0/5511 useless extension candidates. Maximal degree in co-relation 9842. Up to 6161 conditions per place. [2022-12-06 01:44:46,636 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 242 selfloop transitions, 5 changer transitions 261/508 dead transitions. [2022-12-06 01:44:46,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 508 transitions, 8419 flow [2022-12-06 01:44:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:44:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:44:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 01:44:46,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 01:44:46,637 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2022-12-06 01:44:46,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:46,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 508 transitions, 8419 flow [2022-12-06 01:44:46,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 508 transitions, 8419 flow [2022-12-06 01:44:46,672 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:46,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:44:46,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 01:44:46,674 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 508 transitions, 8419 flow [2022-12-06 01:44:46,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:44:46,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:46,675 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:44:46,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:44:46,675 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:44:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2098555375, now seen corresponding path program 1 times [2022-12-06 01:44:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:46,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156623335] [2022-12-06 01:44:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:46,751 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:44:46,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:46,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156623335] [2022-12-06 01:44:46,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156623335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:46,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:46,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:44:46,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532667839] [2022-12-06 01:44:46,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:46,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:44:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:46,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:44:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:44:46,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:44:46,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 508 transitions, 8419 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:44:46,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:46,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:44:46,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:47,993 INFO L130 PetriNetUnfolder]: 6897/9969 cut-off events. [2022-12-06 01:44:47,994 INFO L131 PetriNetUnfolder]: For 1000/1000 co-relation queries the response was YES. [2022-12-06 01:44:48,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90699 conditions, 9969 events. 6897/9969 cut-off events. For 1000/1000 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 53133 event pairs, 879 based on Foata normal form. 1/7855 useless extension candidates. Maximal degree in co-relation 19914. Up to 9302 conditions per place. [2022-12-06 01:44:48,033 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 318 selfloop transitions, 19 changer transitions 348/685 dead transitions. [2022-12-06 01:44:48,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 685 transitions, 12711 flow [2022-12-06 01:44:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:44:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:44:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-06 01:44:48,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 01:44:48,034 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2022-12-06 01:44:48,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:48,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 685 transitions, 12711 flow [2022-12-06 01:44:48,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 685 transitions, 12711 flow [2022-12-06 01:44:48,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:48,079 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:44:48,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 01:44:48,080 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 685 transitions, 12711 flow [2022-12-06 01:44:48,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 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:44:48,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:48,080 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:44:48,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:44:48,080 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:44:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash -750287580, now seen corresponding path program 1 times [2022-12-06 01:44:48,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:48,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573988021] [2022-12-06 01:44:48,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:48,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:48,121 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:44:48,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:48,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573988021] [2022-12-06 01:44:48,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573988021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:48,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:48,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:44:48,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139565266] [2022-12-06 01:44:48,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:48,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:44:48,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:48,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:44:48,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:44:48,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:44:48,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 685 transitions, 12711 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:44:48,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:48,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:44:48,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:48,858 INFO L130 PetriNetUnfolder]: 3412/5104 cut-off events. [2022-12-06 01:44:48,859 INFO L131 PetriNetUnfolder]: For 616/616 co-relation queries the response was YES. [2022-12-06 01:44:48,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51607 conditions, 5104 events. 3412/5104 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 26090 event pairs, 426 based on Foata normal form. 0/4201 useless extension candidates. Maximal degree in co-relation 20294. Up to 4468 conditions per place. [2022-12-06 01:44:48,877 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 150 selfloop transitions, 0 changer transitions 409/559 dead transitions. [2022-12-06 01:44:48,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 559 transitions, 11522 flow [2022-12-06 01:44:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:44:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:44:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 01:44:48,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.50625 [2022-12-06 01:44:48,879 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 40 predicate places. [2022-12-06 01:44:48,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:48,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 559 transitions, 11522 flow [2022-12-06 01:44:48,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 559 transitions, 11522 flow [2022-12-06 01:44:48,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:48,906 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:44:48,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 01:44:48,907 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 559 transitions, 11522 flow [2022-12-06 01:44:48,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:44:48,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:48,907 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:44:48,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:44:48,907 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:44:48,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1521690201, now seen corresponding path program 1 times [2022-12-06 01:44:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:48,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431632791] [2022-12-06 01:44:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:44:49,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431632791] [2022-12-06 01:44:49,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431632791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:49,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:49,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:44:49,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842710856] [2022-12-06 01:44:49,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:49,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:44:49,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:44:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:44:49,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:44:49,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 559 transitions, 11522 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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:44:49,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:49,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:44:49,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:50,793 INFO L130 PetriNetUnfolder]: 7351/10683 cut-off events. [2022-12-06 01:44:50,793 INFO L131 PetriNetUnfolder]: For 1093/1093 co-relation queries the response was YES. [2022-12-06 01:44:50,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118533 conditions, 10683 events. 7351/10683 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 58636 event pairs, 431 based on Foata normal form. 1/8422 useless extension candidates. Maximal degree in co-relation 51842. Up to 10047 conditions per place. [2022-12-06 01:44:50,841 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 299 selfloop transitions, 24 changer transitions 525/848 dead transitions. [2022-12-06 01:44:50,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 848 transitions, 19142 flow [2022-12-06 01:44:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:44:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:44:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2022-12-06 01:44:50,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-06 01:44:50,843 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2022-12-06 01:44:50,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:50,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 848 transitions, 19142 flow [2022-12-06 01:44:50,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 848 transitions, 19142 flow [2022-12-06 01:44:50,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:50,897 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:44:50,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 01:44:50,897 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 848 transitions, 19142 flow [2022-12-06 01:44:50,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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:44:50,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:50,898 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:44:50,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:44:50,898 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:44:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1107095953, now seen corresponding path program 2 times [2022-12-06 01:44:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:50,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283175848] [2022-12-06 01:44:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:44:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:51,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283175848] [2022-12-06 01:44:51,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283175848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:51,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:51,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:44:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886828088] [2022-12-06 01:44:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:51,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:44:51,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:51,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:44:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:44:51,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:44:51,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 848 transitions, 19142 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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:44:51,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:51,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:44:51,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:53,864 INFO L130 PetriNetUnfolder]: 8781/12804 cut-off events. [2022-12-06 01:44:53,864 INFO L131 PetriNetUnfolder]: For 1237/1237 co-relation queries the response was YES. [2022-12-06 01:44:53,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154753 conditions, 12804 events. 8781/12804 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 72687 event pairs, 515 based on Foata normal form. 1/10127 useless extension candidates. Maximal degree in co-relation 77258. Up to 12168 conditions per place. [2022-12-06 01:44:53,937 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 359 selfloop transitions, 28 changer transitions 603/990 dead transitions. [2022-12-06 01:44:53,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 990 transitions, 24300 flow [2022-12-06 01:44:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:44:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:44:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2022-12-06 01:44:53,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.509375 [2022-12-06 01:44:53,939 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2022-12-06 01:44:53,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:53,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 990 transitions, 24300 flow [2022-12-06 01:44:54,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 990 transitions, 24300 flow [2022-12-06 01:44:54,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:54,008 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:44:54,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 01:44:54,008 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 990 transitions, 24300 flow [2022-12-06 01:44:54,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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:44:54,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:54,009 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:44:54,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:44:54,009 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:44:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 620069359, now seen corresponding path program 3 times [2022-12-06 01:44:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:54,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015642513] [2022-12-06 01:44:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:44:54,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:54,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015642513] [2022-12-06 01:44:54,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015642513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:54,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:54,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:44:54,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262468372] [2022-12-06 01:44:54,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:54,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:44:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:54,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:44:54,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:44:54,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 01:44:54,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 990 transitions, 24300 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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:44:54,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:54,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 01:44:54,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:44:57,249 INFO L130 PetriNetUnfolder]: 9669/14202 cut-off events. [2022-12-06 01:44:57,250 INFO L131 PetriNetUnfolder]: For 1372/1372 co-relation queries the response was YES. [2022-12-06 01:44:57,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185826 conditions, 14202 events. 9669/14202 cut-off events. For 1372/1372 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 82540 event pairs, 445 based on Foata normal form. 3/11243 useless extension candidates. Maximal degree in co-relation 99331. Up to 13566 conditions per place. [2022-12-06 01:44:57,315 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 447 selfloop transitions, 32 changer transitions 653/1132 dead transitions. [2022-12-06 01:44:57,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 1132 transitions, 30056 flow [2022-12-06 01:44:57,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:44:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:44:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2022-12-06 01:44:57,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-06 01:44:57,316 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 61 predicate places. [2022-12-06 01:44:57,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:44:57,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 1132 transitions, 30056 flow [2022-12-06 01:44:57,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 1132 transitions, 30056 flow [2022-12-06 01:44:57,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:44:58,967 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:44:58,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1652 [2022-12-06 01:44:58,968 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 1130 transitions, 30004 flow [2022-12-06 01:44:58,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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:44:58,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:44:58,969 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:44:58,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:44:58,969 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:44:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:44:58,969 INFO L85 PathProgramCache]: Analyzing trace with hash 684551319, now seen corresponding path program 1 times [2022-12-06 01:44:58,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:44:58,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257267289] [2022-12-06 01:44:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:44:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:44:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:44:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:44:59,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:44:59,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257267289] [2022-12-06 01:44:59,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257267289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:44:59,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:44:59,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:44:59,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557545921] [2022-12-06 01:44:59,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:44:59,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:44:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:44:59,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:44:59,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:44:59,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 01:44:59,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 1130 transitions, 30004 flow. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:44:59,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:44:59,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 01:44:59,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:02,145 INFO L130 PetriNetUnfolder]: 9323/13851 cut-off events. [2022-12-06 01:45:02,145 INFO L131 PetriNetUnfolder]: For 1389/1389 co-relation queries the response was YES. [2022-12-06 01:45:02,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195115 conditions, 13851 events. 9323/13851 cut-off events. For 1389/1389 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 82856 event pairs, 397 based on Foata normal form. 3/11238 useless extension candidates. Maximal degree in co-relation 102712. Up to 13215 conditions per place. [2022-12-06 01:45:02,231 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 507 selfloop transitions, 26 changer transitions 706/1239 dead transitions. [2022-12-06 01:45:02,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 1239 transitions, 35364 flow [2022-12-06 01:45:02,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:45:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:45:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2022-12-06 01:45:02,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5481727574750831 [2022-12-06 01:45:02,233 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2022-12-06 01:45:02,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:02,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 1239 transitions, 35364 flow [2022-12-06 01:45:02,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 1239 transitions, 35364 flow [2022-12-06 01:45:02,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:02,349 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:45:02,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 01:45:02,350 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 1239 transitions, 35364 flow [2022-12-06 01:45:02,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:45:02,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:02,350 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:45:02,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:45:02,350 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:45:02,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:02,351 INFO L85 PathProgramCache]: Analyzing trace with hash 756330783, now seen corresponding path program 1 times [2022-12-06 01:45:02,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:02,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493167712] [2022-12-06 01:45:02,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:02,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 01:45:02,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:02,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493167712] [2022-12-06 01:45:02,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493167712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:02,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:02,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:45:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832693119] [2022-12-06 01:45:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:02,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:45:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:45:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:45:02,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 01:45:02,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 1239 transitions, 35364 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:45:02,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:02,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 01:45:02,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:05,941 INFO L130 PetriNetUnfolder]: 10891/16091 cut-off events. [2022-12-06 01:45:05,942 INFO L131 PetriNetUnfolder]: For 1576/1576 co-relation queries the response was YES. [2022-12-06 01:45:05,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242764 conditions, 16091 events. 10891/16091 cut-off events. For 1576/1576 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 96990 event pairs, 539 based on Foata normal form. 0/13009 useless extension candidates. Maximal degree in co-relation 110019. Up to 15455 conditions per place. [2022-12-06 01:45:06,047 INFO L137 encePairwiseOnDemand]: 37/43 looper letters, 565 selfloop transitions, 8 changer transitions 763/1336 dead transitions. [2022-12-06 01:45:06,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 1336 transitions, 40797 flow [2022-12-06 01:45:06,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:45:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:45:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2022-12-06 01:45:06,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5767441860465117 [2022-12-06 01:45:06,056 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 68 predicate places. [2022-12-06 01:45:06,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:06,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 1336 transitions, 40797 flow [2022-12-06 01:45:06,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 1336 transitions, 40797 flow [2022-12-06 01:45:06,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:06,353 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:45:06,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-06 01:45:06,353 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 1336 transitions, 40797 flow [2022-12-06 01:45:06,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:45:06,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:06,354 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:45:06,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:45:06,354 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:45:06,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash -457939194, now seen corresponding path program 1 times [2022-12-06 01:45:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:06,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776099862] [2022-12-06 01:45:06,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:06,393 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:45:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:06,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776099862] [2022-12-06 01:45:06,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776099862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:45:06,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:45:06,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:45:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891337373] [2022-12-06 01:45:06,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:45:06,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:45:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:45:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:45:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:45:06,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 01:45:06,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 1336 transitions, 40797 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:45:06,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:45:06,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 01:45:06,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:45:09,785 INFO L130 PetriNetUnfolder]: 10625/15695 cut-off events. [2022-12-06 01:45:09,785 INFO L131 PetriNetUnfolder]: For 1547/1547 co-relation queries the response was YES. [2022-12-06 01:45:09,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252475 conditions, 15695 events. 10625/15695 cut-off events. For 1547/1547 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 93968 event pairs, 510 based on Foata normal form. 0/12697 useless extension candidates. Maximal degree in co-relation 117326. Up to 15424 conditions per place. [2022-12-06 01:45:10,050 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 503 selfloop transitions, 0 changer transitions 808/1311 dead transitions. [2022-12-06 01:45:10,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 1311 transitions, 42654 flow [2022-12-06 01:45:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:45:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:45:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-06 01:45:10,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2022-12-06 01:45:10,051 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 71 predicate places. [2022-12-06 01:45:10,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:45:10,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 1311 transitions, 42654 flow [2022-12-06 01:45:10,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 1311 transitions, 42654 flow [2022-12-06 01:45:10,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:45:10,155 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:45:10,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 01:45:10,156 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 1311 transitions, 42654 flow [2022-12-06 01:45:10,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:45:10,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:45:10,156 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] [2022-12-06 01:45:10,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 01:45:10,156 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:45:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:45:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1173780369, now seen corresponding path program 1 times [2022-12-06 01:45:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:45:10,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167673301] [2022-12-06 01:45:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:45:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:45:10,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:45:10,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167673301] [2022-12-06 01:45:10,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167673301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:45:10,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190944443] [2022-12-06 01:45:10,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:45:10,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:45:10,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:45:10,986 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:45:11,031 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:45:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:45:11,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 01:45:11,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:45:11,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 01:45:11,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 01:45:11,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:45:11,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:45:11,715 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 01:45:11,715 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 18 treesize of output 23 [2022-12-06 01:45:11,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:45:11,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:45:11,786 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 01:45:11,787 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 18 treesize of output 23 [2022-12-06 01:45:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:45:12,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:45:13,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:45:13,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 202 [2022-12-06 01:45:13,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:45:13,289 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 49949 treesize of output 47263 [2022-12-06 01:45:13,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:45:13,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47229 treesize of output 43142 [2022-12-06 01:45:13,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:45:13,696 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 43133 treesize of output 42126 [2022-12-06 01:45:13,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:45:13,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42101 treesize of output 40062 [2022-12-06 01:45:14,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:45:14,179 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 40053 treesize of output 38798 [2022-12-06 01:45:14,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:45:14,397 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 38773 treesize of output 38158 [2022-12-06 01:45:14,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 01:45:14,625 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 38133 treesize of output 37830 Received shutdown request... [2022-12-06 01:58:30,249 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 01:58:30,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 01:58:30,260 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 01:58:30,260 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 01:58:30,264 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:58:30,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 01:58:30,456 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 37ms.. [2022-12-06 01:58:30,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 01:58:30,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 01:58:30,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 01:58:30,457 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:58:30,460 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:58:30,460 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:58:30,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:58:30 BasicIcfg [2022-12-06 01:58:30,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:58:30,462 INFO L158 Benchmark]: Toolchain (without parser) took 852411.53ms. Allocated memory was 212.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 189.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-06 01:58:30,462 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 212.9MB. Free memory is still 188.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:58:30,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.05ms. Allocated memory is still 212.9MB. Free memory was 188.7MB in the beginning and 176.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 01:58:30,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.14ms. Allocated memory is still 212.9MB. Free memory was 176.1MB in the beginning and 173.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:58:30,462 INFO L158 Benchmark]: Boogie Preprocessor took 22.77ms. Allocated memory is still 212.9MB. Free memory was 173.5MB in the beginning and 171.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:58:30,462 INFO L158 Benchmark]: RCFGBuilder took 537.85ms. Allocated memory is still 212.9MB. Free memory was 171.4MB in the beginning and 146.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 01:58:30,465 INFO L158 Benchmark]: TraceAbstraction took 851648.82ms. Allocated memory was 212.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 145.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-06 01:58:30,470 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.09ms. Allocated memory is still 212.9MB. Free memory is still 188.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.05ms. Allocated memory is still 212.9MB. Free memory was 188.7MB in the beginning and 176.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.14ms. Allocated memory is still 212.9MB. Free memory was 176.1MB in the beginning and 173.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.77ms. Allocated memory is still 212.9MB. Free memory was 173.5MB in the beginning and 171.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 537.85ms. Allocated memory is still 212.9MB. Free memory was 171.4MB in the beginning and 146.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 851648.82ms. Allocated memory was 212.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 145.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 286 PlacesBefore, 38 PlacesAfterwards, 305 TransitionsBefore, 36 TransitionsAfterwards, 14784 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 117 ConcurrentYvCompositions, 21 ChoiceCompositions, 269 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 10015, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10081, independent: 10015, independent conditional: 0, independent unconditional: 10015, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8536, independent: 8503, independent conditional: 0, independent unconditional: 8503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8536, independent: 8503, independent conditional: 0, independent unconditional: 8503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10081, independent: 1512, independent conditional: 0, independent unconditional: 1512, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 8536, unknown conditional: 0, unknown unconditional: 8536] , Statistics on independence cache: Total cache size (in pairs): 17022, Positive cache size: 16989, Positive conditional cache size: 0, Positive unconditional cache size: 16989, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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: 9.9s, 47 PlacesBefore, 44 PlacesAfterwards, 136 TransitionsBefore, 133 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: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 162 TransitionsBefore, 162 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, 246 TransitionsBefore, 246 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, 60 PlacesBefore, 60 PlacesAfterwards, 384 TransitionsBefore, 384 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, 63 PlacesBefore, 63 PlacesAfterwards, 458 TransitionsBefore, 458 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.7s, 70 PlacesBefore, 69 PlacesAfterwards, 604 TransitionsBefore, 603 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, 71 PlacesBefore, 71 PlacesAfterwards, 508 TransitionsBefore, 508 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, 75 PlacesBefore, 75 PlacesAfterwards, 685 TransitionsBefore, 685 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, 78 PlacesBefore, 78 PlacesAfterwards, 559 TransitionsBefore, 559 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, 85 PlacesBefore, 85 PlacesAfterwards, 848 TransitionsBefore, 848 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, 92 PlacesBefore, 92 PlacesAfterwards, 990 TransitionsBefore, 990 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: 1.6s, 99 PlacesBefore, 96 PlacesAfterwards, 1132 TransitionsBefore, 1130 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 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: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 1239 TransitionsBefore, 1239 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, 106 PlacesBefore, 106 PlacesAfterwards, 1336 TransitionsBefore, 1336 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, 109 PlacesBefore, 109 PlacesAfterwards, 1311 TransitionsBefore, 1311 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 CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 37ms.. - 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 CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 37ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 37ms.. - 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 CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 27 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 37ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 413 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: 851.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1889 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1889 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5004 IncrementalHoareTripleChecker+Invalid, 5060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 0 mSDtfsCounter, 5004 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42654occurred in iteration=15, InterpolantAutomatonStates: 94, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 2748 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 5/5 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