/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:28:34,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:28:34,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:28:34,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:28:34,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:28:34,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:28:34,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:28:34,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:28:34,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:28:34,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:28:34,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:28:34,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:28:34,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:28:34,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:28:34,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:28:34,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:28:34,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:28:34,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:28:34,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:28:34,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:28:34,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:28:34,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:28:34,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:28:34,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:28:34,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:28:34,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:28:34,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:28:34,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:28:34,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:28:34,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:28:34,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:28:34,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:28:34,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:28:34,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:28:34,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:28:34,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:28:34,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:28:34,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:28:34,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:28:34,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:28:34,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:28:34,589 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-13 06:28:34,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:28:34,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:28:34,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:28:34,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:28:34,611 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:28:34,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:28:34,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:28:34,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:28:34,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:28:34,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:28:34,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:28:34,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:28:34,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:28:34,612 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:28:34,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:28:34,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:28:34,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:28:34,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:28:34,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:28:34,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:28:34,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:28:34,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:28:34,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:28:34,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:28:34,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:28:34,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:28:34,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:28:34,613 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:28:34,614 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:28:34,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:28:34,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:28:34,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:28:34,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:28:34,877 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:28:34,878 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-13 06:28:35,885 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:28:36,195 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:28:36,196 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-13 06:28:36,232 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190e07dcb/a15974ed925e4ca4ac139a1fed4a2da9/FLAG8fa4e3f6f [2022-12-13 06:28:36,249 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190e07dcb/a15974ed925e4ca4ac139a1fed4a2da9 [2022-12-13 06:28:36,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:28:36,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:28:36,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:28:36,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:28:36,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:28:36,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:28:36" (1/1) ... [2022-12-13 06:28:36,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab6145a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:36, skipping insertion in model container [2022-12-13 06:28:36,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:28:36" (1/1) ... [2022-12-13 06:28:36,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:28:36,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:28:36,985 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-13 06:28:37,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:28:37,050 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:28:37,107 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-13 06:28:37,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:28:37,279 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:28:37,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37 WrapperNode [2022-12-13 06:28:37,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:28:37,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:28:37,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:28:37,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:28:37,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,368 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 133 [2022-12-13 06:28:37,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:28:37,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:28:37,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:28:37,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:28:37,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,398 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:28:37,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:28:37,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:28:37,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:28:37,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (1/1) ... [2022-12-13 06:28:37,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:28:37,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:28:37,427 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-13 06:28:37,445 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-13 06:28:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:28:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 06:28:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 06:28:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:28:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 06:28:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:28:37,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:28:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-13 06:28:37,465 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-13 06:28:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:28:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:28:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:28:37,466 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:28:37,901 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:28:37,903 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:28:38,069 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:28:38,075 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:28:38,075 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:28:38,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:28:38 BoogieIcfgContainer [2022-12-13 06:28:38,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:28:38,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:28:38,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:28:38,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:28:38,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:28:36" (1/3) ... [2022-12-13 06:28:38,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0016da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:28:38, skipping insertion in model container [2022-12-13 06:28:38,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:37" (2/3) ... [2022-12-13 06:28:38,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0016da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:28:38, skipping insertion in model container [2022-12-13 06:28:38,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:28:38" (3/3) ... [2022-12-13 06:28:38,082 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2022-12-13 06:28:38,113 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:28:38,113 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 06:28:38,114 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:28:38,192 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 06:28:38,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 174 transitions, 364 flow [2022-12-13 06:28:38,300 INFO L130 PetriNetUnfolder]: 10/212 cut-off events. [2022-12-13 06:28:38,300 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 06:28:38,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 212 events. 10/212 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 124. Up to 4 conditions per place. [2022-12-13 06:28:38,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 174 transitions, 364 flow [2022-12-13 06:28:38,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 162 transitions, 336 flow [2022-12-13 06:28:38,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:28:38,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-13 06:28:38,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 162 transitions, 336 flow [2022-12-13 06:28:38,394 INFO L130 PetriNetUnfolder]: 7/193 cut-off events. [2022-12-13 06:28:38,394 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 06:28:38,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 7/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 315 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2022-12-13 06:28:38,399 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-13 06:28:38,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 2604 [2022-12-13 06:29:11,538 INFO L241 LiptonReduction]: Total number of compositions: 134 [2022-12-13 06:29:11,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:29:11,560 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;@1cf98a0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:29:11,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 06:29:11,561 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 06:29:11,561 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:29:11,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:11,562 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 06:29:11,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash 594, now seen corresponding path program 1 times [2022-12-13 06:29:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:11,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838881512] [2022-12-13 06:29:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:11,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:11,748 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-13 06:29:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:11,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838881512] [2022-12-13 06:29:11,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838881512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:11,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:11,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 06:29:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659263646] [2022-12-13 06:29:11,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:11,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 06:29:11,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 06:29:11,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 06:29:11,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2022-12-13 06:29:11,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 114 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 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-13 06:29:11,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:11,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2022-12-13 06:29:11,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:12,057 INFO L130 PetriNetUnfolder]: 1251/2241 cut-off events. [2022-12-13 06:29:12,057 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 06:29:12,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 2241 events. 1251/2241 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14530 event pairs, 1250 based on Foata normal form. 122/1259 useless extension candidates. Maximal degree in co-relation 4153. Up to 2042 conditions per place. [2022-12-13 06:29:12,070 INFO L137 encePairwiseOnDemand]: 48/51 looper letters, 37 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-12-13 06:29:12,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 182 flow [2022-12-13 06:29:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:29:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 06:29:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-12-13 06:29:12,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2022-12-13 06:29:12,083 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2022-12-13 06:29:12,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 48 transitions, 182 flow [2022-12-13 06:29:12,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 48 transitions, 182 flow [2022-12-13 06:29:12,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:12,099 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 182 flow [2022-12-13 06:29:12,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:12,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:12,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 182 flow [2022-12-13 06:29:12,107 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 182 flow [2022-12-13 06:29:12,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-13 06:29:14,382 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:14,383 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:14,386 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:14,387 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:16,706 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:16,707 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4609 [2022-12-13 06:29:16,708 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 180 flow [2022-12-13 06:29:16,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 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-13 06:29:16,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:16,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 06:29:16,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:29:16,708 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:16,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash 19041436, now seen corresponding path program 1 times [2022-12-13 06:29:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:16,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136525222] [2022-12-13 06:29:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:17,127 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-13 06:29:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:17,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136525222] [2022-12-13 06:29:17,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136525222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:17,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:17,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:29:17,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063171778] [2022-12-13 06:29:17,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:17,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:29:17,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:17,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:29:17,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:29:17,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 47 [2022-12-13 06:29:17,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 06:29:17,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:17,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 47 [2022-12-13 06:29:17,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:17,631 INFO L130 PetriNetUnfolder]: 3304/5385 cut-off events. [2022-12-13 06:29:17,631 INFO L131 PetriNetUnfolder]: For 516/516 co-relation queries the response was YES. [2022-12-13 06:29:17,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14661 conditions, 5385 events. 3304/5385 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 33664 event pairs, 1566 based on Foata normal form. 183/3599 useless extension candidates. Maximal degree in co-relation 14371. Up to 3908 conditions per place. [2022-12-13 06:29:17,653 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 64 selfloop transitions, 8 changer transitions 0/75 dead transitions. [2022-12-13 06:29:17,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 422 flow [2022-12-13 06:29:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:29:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:29:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-13 06:29:17,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2022-12-13 06:29:17,658 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2022-12-13 06:29:17,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 75 transitions, 422 flow [2022-12-13 06:29:17,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 75 transitions, 422 flow [2022-12-13 06:29:17,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:17,694 INFO L89 Accepts]: Start accepts. Operand has 55 places, 75 transitions, 422 flow [2022-12-13 06:29:17,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:17,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:17,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 75 transitions, 422 flow [2022-12-13 06:29:17,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 75 transitions, 422 flow [2022-12-13 06:29:17,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-13 06:29:17,701 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:17,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 06:29:17,702 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 75 transitions, 422 flow [2022-12-13 06:29:17,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-13 06:29:17,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:17,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 06:29:17,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:29:17,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:17,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:17,704 INFO L85 PathProgramCache]: Analyzing trace with hash 590279223, now seen corresponding path program 1 times [2022-12-13 06:29:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:17,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956130926] [2022-12-13 06:29:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:17,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:17,878 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-13 06:29:17,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:17,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956130926] [2022-12-13 06:29:17,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956130926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:17,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:17,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:29:17,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260082015] [2022-12-13 06:29:17,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:17,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:29:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:17,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:29:17,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:29:17,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 47 [2022-12-13 06:29:17,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 75 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 06:29:17,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:17,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 47 [2022-12-13 06:29:17,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:18,443 INFO L130 PetriNetUnfolder]: 3551/5839 cut-off events. [2022-12-13 06:29:18,443 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2022-12-13 06:29:18,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21580 conditions, 5839 events. 3551/5839 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37183 event pairs, 1639 based on Foata normal form. 316/4046 useless extension candidates. Maximal degree in co-relation 21200. Up to 4467 conditions per place. [2022-12-13 06:29:18,466 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 107 selfloop transitions, 14 changer transitions 2/126 dead transitions. [2022-12-13 06:29:18,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 952 flow [2022-12-13 06:29:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:29:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:29:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 06:29:18,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2022-12-13 06:29:18,469 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2022-12-13 06:29:18,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 126 transitions, 952 flow [2022-12-13 06:29:18,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 124 transitions, 936 flow [2022-12-13 06:29:18,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:18,498 INFO L89 Accepts]: Start accepts. Operand has 57 places, 124 transitions, 936 flow [2022-12-13 06:29:18,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:18,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:18,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 124 transitions, 936 flow [2022-12-13 06:29:18,503 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 124 transitions, 936 flow [2022-12-13 06:29:18,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-13 06:29:18,556 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:18,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 06:29:18,557 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 124 transitions, 938 flow [2022-12-13 06:29:18,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 06:29:18,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:18,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:18,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:29:18,558 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:18,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:18,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2143229715, now seen corresponding path program 1 times [2022-12-13 06:29:18,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:18,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446030584] [2022-12-13 06:29:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:18,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:18,631 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-13 06:29:18,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:18,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446030584] [2022-12-13 06:29:18,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446030584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:18,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:18,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:29:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962314871] [2022-12-13 06:29:18,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:18,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:29:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:29:18,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:29:18,633 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2022-12-13 06:29:18,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 124 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-13 06:29:18,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:18,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2022-12-13 06:29:18,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:18,854 INFO L130 PetriNetUnfolder]: 893/1529 cut-off events. [2022-12-13 06:29:18,854 INFO L131 PetriNetUnfolder]: For 533/533 co-relation queries the response was YES. [2022-12-13 06:29:18,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7195 conditions, 1529 events. 893/1529 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7811 event pairs, 323 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 6759. Up to 1512 conditions per place. [2022-12-13 06:29:18,858 INFO L137 encePairwiseOnDemand]: 44/46 looper letters, 23 selfloop transitions, 1 changer transitions 29/60 dead transitions. [2022-12-13 06:29:18,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 568 flow [2022-12-13 06:29:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:29:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:29:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 06:29:18,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2022-12-13 06:29:18,861 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2022-12-13 06:29:18,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 60 transitions, 568 flow [2022-12-13 06:29:18,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 282 flow [2022-12-13 06:29:18,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:18,867 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 282 flow [2022-12-13 06:29:18,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:18,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:18,869 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 282 flow [2022-12-13 06:29:18,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 282 flow [2022-12-13 06:29:18,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 06:29:18,876 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:18,877 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:18,882 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:18,882 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:19,017 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:29:19,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 06:29:19,018 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 282 flow [2022-12-13 06:29:19,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-13 06:29:19,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:19,018 INFO L214 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-13 06:29:19,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:29:19,018 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash -517285646, now seen corresponding path program 1 times [2022-12-13 06:29:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:19,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360199065] [2022-12-13 06:29:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:19,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:19,494 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-13 06:29:19,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:19,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360199065] [2022-12-13 06:29:19,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360199065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:19,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:19,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:29:19,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707659126] [2022-12-13 06:29:19,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:19,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:29:19,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:19,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:29:19,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:29:19,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 06:29:19,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-13 06:29:19,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:19,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 06:29:19,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:19,683 INFO L130 PetriNetUnfolder]: 301/546 cut-off events. [2022-12-13 06:29:19,683 INFO L131 PetriNetUnfolder]: For 817/817 co-relation queries the response was YES. [2022-12-13 06:29:19,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 546 events. 301/546 cut-off events. For 817/817 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2288 event pairs, 122 based on Foata normal form. 12/557 useless extension candidates. Maximal degree in co-relation 2431. Up to 464 conditions per place. [2022-12-13 06:29:19,686 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 40 selfloop transitions, 12 changer transitions 4/59 dead transitions. [2022-12-13 06:29:19,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 637 flow [2022-12-13 06:29:19,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:29:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:29:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 06:29:19,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-12-13 06:29:19,687 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -14 predicate places. [2022-12-13 06:29:19,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 59 transitions, 637 flow [2022-12-13 06:29:19,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 55 transitions, 621 flow [2022-12-13 06:29:19,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:19,691 INFO L89 Accepts]: Start accepts. Operand has 40 places, 55 transitions, 621 flow [2022-12-13 06:29:19,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:19,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:19,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 55 transitions, 621 flow [2022-12-13 06:29:19,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 55 transitions, 621 flow [2022-12-13 06:29:19,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 06:29:19,697 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:19,697 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:19,698 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:19,699 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:19,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:19,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 06:29:19,799 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 55 transitions, 621 flow [2022-12-13 06:29:19,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-13 06:29:19,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:19,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:19,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:29:19,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1387944236, now seen corresponding path program 1 times [2022-12-13 06:29:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:19,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855879944] [2022-12-13 06:29:19,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:20,362 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-13 06:29:20,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:20,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855879944] [2022-12-13 06:29:20,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855879944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:20,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:20,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:29:20,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513972622] [2022-12-13 06:29:20,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:20,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:29:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:20,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:29:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:29:20,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 06:29:20,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 55 transitions, 621 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-13 06:29:20,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:20,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 06:29:20,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:20,577 INFO L130 PetriNetUnfolder]: 263/516 cut-off events. [2022-12-13 06:29:20,577 INFO L131 PetriNetUnfolder]: For 622/622 co-relation queries the response was YES. [2022-12-13 06:29:20,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 516 events. 263/516 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2327 event pairs, 37 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 2686. Up to 477 conditions per place. [2022-12-13 06:29:20,580 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 82 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2022-12-13 06:29:20,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 98 transitions, 1279 flow [2022-12-13 06:29:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:29:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:29:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 06:29:20,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2022-12-13 06:29:20,581 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2022-12-13 06:29:20,581 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 98 transitions, 1279 flow [2022-12-13 06:29:20,583 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 98 transitions, 1279 flow [2022-12-13 06:29:20,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:20,584 INFO L89 Accepts]: Start accepts. Operand has 45 places, 98 transitions, 1279 flow [2022-12-13 06:29:20,585 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:20,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:20,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 98 transitions, 1279 flow [2022-12-13 06:29:20,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 98 transitions, 1279 flow [2022-12-13 06:29:20,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-13 06:29:20,587 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:20,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 06:29:20,588 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 98 transitions, 1279 flow [2022-12-13 06:29:20,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-13 06:29:20,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:20,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:20,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:29:20,588 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1603381106, now seen corresponding path program 1 times [2022-12-13 06:29:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:20,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263347639] [2022-12-13 06:29:20,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:21,982 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-13 06:29:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:21,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263347639] [2022-12-13 06:29:21,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263347639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:21,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:21,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048710300] [2022-12-13 06:29:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:21,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:21,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:21,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 06:29:21,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 98 transitions, 1279 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:21,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:21,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 06:29:21,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:22,887 INFO L130 PetriNetUnfolder]: 309/618 cut-off events. [2022-12-13 06:29:22,887 INFO L131 PetriNetUnfolder]: For 888/888 co-relation queries the response was YES. [2022-12-13 06:29:22,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4271 conditions, 618 events. 309/618 cut-off events. For 888/888 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2961 event pairs, 23 based on Foata normal form. 1/618 useless extension candidates. Maximal degree in co-relation 3443. Up to 566 conditions per place. [2022-12-13 06:29:22,890 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 114 selfloop transitions, 33 changer transitions 25/172 dead transitions. [2022-12-13 06:29:22,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 172 transitions, 2579 flow [2022-12-13 06:29:22,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:29:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:29:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2022-12-13 06:29:22,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25071225071225073 [2022-12-13 06:29:22,891 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2022-12-13 06:29:22,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 172 transitions, 2579 flow [2022-12-13 06:29:22,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 147 transitions, 2236 flow [2022-12-13 06:29:22,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:22,896 INFO L89 Accepts]: Start accepts. Operand has 51 places, 147 transitions, 2236 flow [2022-12-13 06:29:22,897 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:22,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:22,897 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 147 transitions, 2236 flow [2022-12-13 06:29:22,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 147 transitions, 2236 flow [2022-12-13 06:29:22,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:22,899 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:22,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 06:29:22,900 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 147 transitions, 2236 flow [2022-12-13 06:29:22,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:22,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:22,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:22,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:29:22,900 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:22,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash -317164640, now seen corresponding path program 2 times [2022-12-13 06:29:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:22,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828633148] [2022-12-13 06:29:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:24,345 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-13 06:29:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:24,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828633148] [2022-12-13 06:29:24,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828633148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:24,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:24,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:24,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775331708] [2022-12-13 06:29:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:24,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:24,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:24,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:24,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:29:24,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 147 transitions, 2236 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:24,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:24,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:29:24,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:25,008 INFO L130 PetriNetUnfolder]: 236/489 cut-off events. [2022-12-13 06:29:25,008 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-13 06:29:25,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4081 conditions, 489 events. 236/489 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2257 event pairs, 14 based on Foata normal form. 1/489 useless extension candidates. Maximal degree in co-relation 3114. Up to 490 conditions per place. [2022-12-13 06:29:25,011 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 119 selfloop transitions, 27 changer transitions 26/172 dead transitions. [2022-12-13 06:29:25,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 172 transitions, 2974 flow [2022-12-13 06:29:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:29:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:29:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-12-13 06:29:25,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-13 06:29:25,015 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2022-12-13 06:29:25,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 172 transitions, 2974 flow [2022-12-13 06:29:25,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 146 transitions, 2512 flow [2022-12-13 06:29:25,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:25,020 INFO L89 Accepts]: Start accepts. Operand has 57 places, 146 transitions, 2512 flow [2022-12-13 06:29:25,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:25,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:25,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 146 transitions, 2512 flow [2022-12-13 06:29:25,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 146 transitions, 2512 flow [2022-12-13 06:29:25,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:25,024 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:25,026 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:29:25,026 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 146 transitions, 2512 flow [2022-12-13 06:29:25,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:25,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:25,027 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:25,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:29:25,027 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash 464803570, now seen corresponding path program 3 times [2022-12-13 06:29:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:25,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325970561] [2022-12-13 06:29:25,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:26,249 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-13 06:29:26,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:26,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325970561] [2022-12-13 06:29:26,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325970561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:26,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:26,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:26,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813713512] [2022-12-13 06:29:26,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:26,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:26,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:26,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:26,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:26,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:29:26,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 146 transitions, 2512 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:26,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:26,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:29:26,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:27,042 INFO L130 PetriNetUnfolder]: 238/506 cut-off events. [2022-12-13 06:29:27,042 INFO L131 PetriNetUnfolder]: For 482/482 co-relation queries the response was YES. [2022-12-13 06:29:27,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4756 conditions, 506 events. 238/506 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2346 event pairs, 25 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 3486. Up to 507 conditions per place. [2022-12-13 06:29:27,045 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 133 selfloop transitions, 58 changer transitions 3/194 dead transitions. [2022-12-13 06:29:27,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 194 transitions, 3776 flow [2022-12-13 06:29:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:29:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:29:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-12-13 06:29:27,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23733333333333334 [2022-12-13 06:29:27,046 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2022-12-13 06:29:27,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 194 transitions, 3776 flow [2022-12-13 06:29:27,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 191 transitions, 3713 flow [2022-12-13 06:29:27,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:27,051 INFO L89 Accepts]: Start accepts. Operand has 71 places, 191 transitions, 3713 flow [2022-12-13 06:29:27,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:27,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:27,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 191 transitions, 3713 flow [2022-12-13 06:29:27,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 191 transitions, 3713 flow [2022-12-13 06:29:27,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:27,055 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:27,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 06:29:27,055 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 191 transitions, 3713 flow [2022-12-13 06:29:27,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:27,056 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:27,056 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:27,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:29:27,056 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:27,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash -372390184, now seen corresponding path program 4 times [2022-12-13 06:29:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:27,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910957074] [2022-12-13 06:29:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:27,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:28,289 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-13 06:29:28,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910957074] [2022-12-13 06:29:28,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910957074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:28,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:28,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853837431] [2022-12-13 06:29:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:28,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:28,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:28,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:29:28,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 191 transitions, 3713 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:28,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:28,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:29:28,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:29,005 INFO L130 PetriNetUnfolder]: 240/515 cut-off events. [2022-12-13 06:29:29,006 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2022-12-13 06:29:29,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5350 conditions, 515 events. 240/515 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2441 event pairs, 16 based on Foata normal form. 2/515 useless extension candidates. Maximal degree in co-relation 3850. Up to 516 conditions per place. [2022-12-13 06:29:29,008 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 142 selfloop transitions, 25 changer transitions 34/201 dead transitions. [2022-12-13 06:29:29,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 201 transitions, 4306 flow [2022-12-13 06:29:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:29:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:29:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2022-12-13 06:29:29,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23384615384615384 [2022-12-13 06:29:29,010 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 28 predicate places. [2022-12-13 06:29:29,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 201 transitions, 4306 flow [2022-12-13 06:29:29,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 167 transitions, 3567 flow [2022-12-13 06:29:29,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:29,015 INFO L89 Accepts]: Start accepts. Operand has 77 places, 167 transitions, 3567 flow [2022-12-13 06:29:29,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:29,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:29,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 167 transitions, 3567 flow [2022-12-13 06:29:29,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 167 transitions, 3567 flow [2022-12-13 06:29:29,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:29,021 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:29,022 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:29,023 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:29,024 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:29,091 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:29,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 06:29:29,092 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 166 transitions, 3545 flow [2022-12-13 06:29:29,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:29,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:29,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:29,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:29:29,093 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1832686755, now seen corresponding path program 1 times [2022-12-13 06:29:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:29,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049806716] [2022-12-13 06:29:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:30,109 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-13 06:29:30,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:30,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049806716] [2022-12-13 06:29:30,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049806716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:30,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:30,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 06:29:30,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085273752] [2022-12-13 06:29:30,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:30,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 06:29:30,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 06:29:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 06:29:30,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 06:29:30,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 166 transitions, 3545 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:29:30,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:30,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 06:29:30,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:30,848 INFO L130 PetriNetUnfolder]: 233/493 cut-off events. [2022-12-13 06:29:30,849 INFO L131 PetriNetUnfolder]: For 517/517 co-relation queries the response was YES. [2022-12-13 06:29:30,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 493 events. 233/493 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2307 event pairs, 15 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 4155. Up to 494 conditions per place. [2022-12-13 06:29:30,852 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 142 selfloop transitions, 43 changer transitions 0/185 dead transitions. [2022-12-13 06:29:30,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 185 transitions, 4336 flow [2022-12-13 06:29:30,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:29:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:29:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2022-12-13 06:29:30,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-13 06:29:30,864 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2022-12-13 06:29:30,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 185 transitions, 4336 flow [2022-12-13 06:29:30,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 185 transitions, 4336 flow [2022-12-13 06:29:30,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:30,870 INFO L89 Accepts]: Start accepts. Operand has 87 places, 185 transitions, 4336 flow [2022-12-13 06:29:30,873 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:30,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:30,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 185 transitions, 4336 flow [2022-12-13 06:29:30,876 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 185 transitions, 4336 flow [2022-12-13 06:29:30,876 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:30,876 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:30,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 06:29:30,877 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 185 transitions, 4336 flow [2022-12-13 06:29:30,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:29:30,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:30,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:30,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:29:30,877 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:30,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash -498145789, now seen corresponding path program 2 times [2022-12-13 06:29:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:30,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181477310] [2022-12-13 06:29:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:31,950 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-13 06:29:31,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:31,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181477310] [2022-12-13 06:29:31,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181477310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:31,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:31,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 06:29:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325405339] [2022-12-13 06:29:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:31,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 06:29:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 06:29:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 06:29:31,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 06:29:31,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 185 transitions, 4336 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:29:31,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:31,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 06:29:31,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:32,571 INFO L130 PetriNetUnfolder]: 233/498 cut-off events. [2022-12-13 06:29:32,571 INFO L131 PetriNetUnfolder]: For 530/530 co-relation queries the response was YES. [2022-12-13 06:29:32,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6178 conditions, 498 events. 233/498 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2347 event pairs, 8 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 4523. Up to 499 conditions per place. [2022-12-13 06:29:32,589 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 150 selfloop transitions, 40 changer transitions 0/190 dead transitions. [2022-12-13 06:29:32,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 190 transitions, 4839 flow [2022-12-13 06:29:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 06:29:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 06:29:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2022-12-13 06:29:32,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23717948717948717 [2022-12-13 06:29:32,591 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2022-12-13 06:29:32,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 190 transitions, 4839 flow [2022-12-13 06:29:32,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 190 transitions, 4839 flow [2022-12-13 06:29:32,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:32,597 INFO L89 Accepts]: Start accepts. Operand has 98 places, 190 transitions, 4839 flow [2022-12-13 06:29:32,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:32,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:32,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 190 transitions, 4839 flow [2022-12-13 06:29:32,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 190 transitions, 4839 flow [2022-12-13 06:29:32,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:32,601 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:32,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 06:29:32,602 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 190 transitions, 4839 flow [2022-12-13 06:29:32,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:29:32,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:32,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:32,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 06:29:32,602 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:32,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1832686747, now seen corresponding path program 1 times [2022-12-13 06:29:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:32,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608730315] [2022-12-13 06:29:32,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:32,918 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-13 06:29:32,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:32,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608730315] [2022-12-13 06:29:32,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608730315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:32,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:32,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:29:32,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588585569] [2022-12-13 06:29:32,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:32,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:29:32,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:32,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:29:32,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:29:32,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 06:29:32,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 190 transitions, 4839 flow. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-13 06:29:32,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:32,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 06:29:32,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:33,166 INFO L130 PetriNetUnfolder]: 326/685 cut-off events. [2022-12-13 06:29:33,166 INFO L131 PetriNetUnfolder]: For 773/773 co-relation queries the response was YES. [2022-12-13 06:29:33,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9145 conditions, 685 events. 326/685 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3507 event pairs, 15 based on Foata normal form. 5/689 useless extension candidates. Maximal degree in co-relation 7268. Up to 686 conditions per place. [2022-12-13 06:29:33,170 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 142 selfloop transitions, 31 changer transitions 61/234 dead transitions. [2022-12-13 06:29:33,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 234 transitions, 6408 flow [2022-12-13 06:29:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:29:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:29:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-13 06:29:33,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2022-12-13 06:29:33,172 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2022-12-13 06:29:33,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 234 transitions, 6408 flow [2022-12-13 06:29:33,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 173 transitions, 4712 flow [2022-12-13 06:29:33,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:33,178 INFO L89 Accepts]: Start accepts. Operand has 79 places, 173 transitions, 4712 flow [2022-12-13 06:29:33,180 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:33,180 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:33,180 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 173 transitions, 4712 flow [2022-12-13 06:29:33,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 173 transitions, 4712 flow [2022-12-13 06:29:33,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:33,182 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:33,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 06:29:33,183 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 173 transitions, 4712 flow [2022-12-13 06:29:33,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-13 06:29:33,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:33,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:33,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 06:29:33,183 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash 751362050, now seen corresponding path program 5 times [2022-12-13 06:29:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:33,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663748737] [2022-12-13 06:29:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:33,471 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-13 06:29:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:33,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663748737] [2022-12-13 06:29:33,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663748737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:33,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:33,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:29:33,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682243779] [2022-12-13 06:29:33,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:33,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:29:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:29:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:29:33,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-13 06:29:33,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 173 transitions, 4712 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-13 06:29:33,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:33,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-13 06:29:33,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:33,620 INFO L130 PetriNetUnfolder]: 236/492 cut-off events. [2022-12-13 06:29:33,620 INFO L131 PetriNetUnfolder]: For 1013/1013 co-relation queries the response was YES. [2022-12-13 06:29:33,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6965 conditions, 492 events. 236/492 cut-off events. For 1013/1013 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2220 event pairs, 10 based on Foata normal form. 12/503 useless extension candidates. Maximal degree in co-relation 6022. Up to 493 conditions per place. [2022-12-13 06:29:33,622 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 104 selfloop transitions, 23 changer transitions 0/145 dead transitions. [2022-12-13 06:29:33,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 145 transitions, 4206 flow [2022-12-13 06:29:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:29:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:29:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-13 06:29:33,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.408 [2022-12-13 06:29:33,624 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 28 predicate places. [2022-12-13 06:29:33,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 145 transitions, 4206 flow [2022-12-13 06:29:33,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 145 transitions, 4206 flow [2022-12-13 06:29:33,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:33,629 INFO L89 Accepts]: Start accepts. Operand has 83 places, 145 transitions, 4206 flow [2022-12-13 06:29:33,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:33,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:33,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 145 transitions, 4206 flow [2022-12-13 06:29:33,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 145 transitions, 4206 flow [2022-12-13 06:29:33,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:33,633 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:33,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 06:29:33,633 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 145 transitions, 4206 flow [2022-12-13 06:29:33,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-13 06:29:33,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:33,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:33,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 06:29:33,634 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:33,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:33,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1132126222, now seen corresponding path program 6 times [2022-12-13 06:29:33,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:33,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816649072] [2022-12-13 06:29:33,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:33,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:34,678 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-13 06:29:34,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:34,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816649072] [2022-12-13 06:29:34,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816649072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:34,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:34,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871493883] [2022-12-13 06:29:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:34,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:34,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:34,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:34,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:34,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 145 transitions, 4206 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:34,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:34,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:34,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:35,397 INFO L130 PetriNetUnfolder]: 269/581 cut-off events. [2022-12-13 06:29:35,397 INFO L131 PetriNetUnfolder]: For 1061/1061 co-relation queries the response was YES. [2022-12-13 06:29:35,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8752 conditions, 581 events. 269/581 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2845 event pairs, 9 based on Foata normal form. 2/582 useless extension candidates. Maximal degree in co-relation 7712. Up to 582 conditions per place. [2022-12-13 06:29:35,423 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 150 selfloop transitions, 40 changer transitions 27/217 dead transitions. [2022-12-13 06:29:35,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 217 transitions, 6608 flow [2022-12-13 06:29:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:29:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:29:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-12-13 06:29:35,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 06:29:35,424 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 41 predicate places. [2022-12-13 06:29:35,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 217 transitions, 6608 flow [2022-12-13 06:29:35,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 190 transitions, 5758 flow [2022-12-13 06:29:35,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:35,432 INFO L89 Accepts]: Start accepts. Operand has 92 places, 190 transitions, 5758 flow [2022-12-13 06:29:35,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:35,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:35,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 190 transitions, 5758 flow [2022-12-13 06:29:35,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 190 transitions, 5758 flow [2022-12-13 06:29:35,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:35,442 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:35,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 06:29:35,442 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 190 transitions, 5758 flow [2022-12-13 06:29:35,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:35,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:35,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:35,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 06:29:35,444 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash 472772914, now seen corresponding path program 7 times [2022-12-13 06:29:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:35,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399090593] [2022-12-13 06:29:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:36,436 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-13 06:29:36,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:36,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399090593] [2022-12-13 06:29:36,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399090593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:36,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:36,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57460940] [2022-12-13 06:29:36,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:36,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:36,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:36,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:36,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:36,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 190 transitions, 5758 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:36,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:36,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:36,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:37,310 INFO L130 PetriNetUnfolder]: 314/683 cut-off events. [2022-12-13 06:29:37,310 INFO L131 PetriNetUnfolder]: For 1285/1285 co-relation queries the response was YES. [2022-12-13 06:29:37,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10971 conditions, 683 events. 314/683 cut-off events. For 1285/1285 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3578 event pairs, 12 based on Foata normal form. 2/683 useless extension candidates. Maximal degree in co-relation 9848. Up to 684 conditions per place. [2022-12-13 06:29:37,314 INFO L137 encePairwiseOnDemand]: 8/24 looper letters, 179 selfloop transitions, 80 changer transitions 25/284 dead transitions. [2022-12-13 06:29:37,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 284 transitions, 9150 flow [2022-12-13 06:29:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:29:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:29:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 94 transitions. [2022-12-13 06:29:37,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2611111111111111 [2022-12-13 06:29:37,317 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 51 predicate places. [2022-12-13 06:29:37,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 284 transitions, 9150 flow [2022-12-13 06:29:37,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 259 transitions, 8314 flow [2022-12-13 06:29:37,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:37,327 INFO L89 Accepts]: Start accepts. Operand has 102 places, 259 transitions, 8314 flow [2022-12-13 06:29:37,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:37,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:37,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 259 transitions, 8314 flow [2022-12-13 06:29:37,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 259 transitions, 8314 flow [2022-12-13 06:29:37,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:37,334 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:37,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 06:29:37,335 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 259 transitions, 8314 flow [2022-12-13 06:29:37,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:37,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:37,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:37,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 06:29:37,335 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1357390062, now seen corresponding path program 8 times [2022-12-13 06:29:37,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:37,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867421488] [2022-12-13 06:29:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:38,228 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-13 06:29:38,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:38,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867421488] [2022-12-13 06:29:38,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867421488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:38,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:38,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:38,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068034995] [2022-12-13 06:29:38,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:38,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:38,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:38,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:38,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:38,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 259 transitions, 8314 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:38,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:38,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:38,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:39,113 INFO L130 PetriNetUnfolder]: 328/721 cut-off events. [2022-12-13 06:29:39,114 INFO L131 PetriNetUnfolder]: For 1253/1253 co-relation queries the response was YES. [2022-12-13 06:29:39,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12271 conditions, 721 events. 328/721 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3897 event pairs, 11 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 11082. Up to 722 conditions per place. [2022-12-13 06:29:39,118 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 214 selfloop transitions, 57 changer transitions 25/296 dead transitions. [2022-12-13 06:29:39,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 296 transitions, 10105 flow [2022-12-13 06:29:39,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:29:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:29:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2022-12-13 06:29:39,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 06:29:39,120 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 60 predicate places. [2022-12-13 06:29:39,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 296 transitions, 10105 flow [2022-12-13 06:29:39,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 271 transitions, 9219 flow [2022-12-13 06:29:39,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:39,132 INFO L89 Accepts]: Start accepts. Operand has 111 places, 271 transitions, 9219 flow [2022-12-13 06:29:39,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:39,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:39,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 271 transitions, 9219 flow [2022-12-13 06:29:39,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 271 transitions, 9219 flow [2022-12-13 06:29:39,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:39,140 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:39,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 06:29:39,141 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 271 transitions, 9219 flow [2022-12-13 06:29:39,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:39,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:39,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:39,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 06:29:39,141 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:39,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1207417784, now seen corresponding path program 9 times [2022-12-13 06:29:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:39,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458060763] [2022-12-13 06:29:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:39,400 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-13 06:29:39,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:39,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458060763] [2022-12-13 06:29:39,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458060763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:39,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:39,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:29:39,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780256200] [2022-12-13 06:29:39,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:39,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:29:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:29:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:29:39,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 06:29:39,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 271 transitions, 9219 flow. Second operand has 5 states, 5 states have (on average 4.8) 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-13 06:29:39,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:39,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 06:29:39,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:39,543 INFO L130 PetriNetUnfolder]: 98/287 cut-off events. [2022-12-13 06:29:39,543 INFO L131 PetriNetUnfolder]: For 494/494 co-relation queries the response was YES. [2022-12-13 06:29:39,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5256 conditions, 287 events. 98/287 cut-off events. For 494/494 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1323 event pairs, 3 based on Foata normal form. 21/307 useless extension candidates. Maximal degree in co-relation 3476. Up to 288 conditions per place. [2022-12-13 06:29:39,545 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 118 selfloop transitions, 19 changer transitions 20/164 dead transitions. [2022-12-13 06:29:39,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 164 transitions, 6071 flow [2022-12-13 06:29:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:29:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:29:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 06:29:39,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2022-12-13 06:29:39,546 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2022-12-13 06:29:39,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 164 transitions, 6071 flow [2022-12-13 06:29:39,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 144 transitions, 5302 flow [2022-12-13 06:29:39,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:39,550 INFO L89 Accepts]: Start accepts. Operand has 104 places, 144 transitions, 5302 flow [2022-12-13 06:29:39,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:39,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:39,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 144 transitions, 5302 flow [2022-12-13 06:29:39,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 144 transitions, 5302 flow [2022-12-13 06:29:39,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:39,566 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:39,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 06:29:39,567 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 144 transitions, 5302 flow [2022-12-13 06:29:39,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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-13 06:29:39,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:39,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:39,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 06:29:39,567 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:39,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash -299414676, now seen corresponding path program 10 times [2022-12-13 06:29:39,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:39,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787312163] [2022-12-13 06:29:39,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:39,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:40,583 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-13 06:29:40,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:40,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787312163] [2022-12-13 06:29:40,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787312163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:40,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:40,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619350620] [2022-12-13 06:29:40,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:40,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:40,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:40,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:40,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 144 transitions, 5302 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:40,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:40,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:40,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:41,226 INFO L130 PetriNetUnfolder]: 121/334 cut-off events. [2022-12-13 06:29:41,226 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2022-12-13 06:29:41,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6402 conditions, 334 events. 121/334 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1610 event pairs, 3 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 3575. Up to 335 conditions per place. [2022-12-13 06:29:41,228 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 134 selfloop transitions, 21 changer transitions 31/186 dead transitions. [2022-12-13 06:29:41,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 186 transitions, 7230 flow [2022-12-13 06:29:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:29:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:29:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-12-13 06:29:41,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23397435897435898 [2022-12-13 06:29:41,230 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 61 predicate places. [2022-12-13 06:29:41,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 186 transitions, 7230 flow [2022-12-13 06:29:41,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 155 transitions, 6001 flow [2022-12-13 06:29:41,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:41,235 INFO L89 Accepts]: Start accepts. Operand has 112 places, 155 transitions, 6001 flow [2022-12-13 06:29:41,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:41,238 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:41,238 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 155 transitions, 6001 flow [2022-12-13 06:29:41,240 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 155 transitions, 6001 flow [2022-12-13 06:29:41,240 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:41,244 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:41,244 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:41,245 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:41,246 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:41,315 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:41,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 06:29:41,316 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 154 transitions, 5961 flow [2022-12-13 06:29:41,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:41,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:41,316 INFO L214 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-13 06:29:41,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 06:29:41,316 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1704282071, now seen corresponding path program 1 times [2022-12-13 06:29:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:41,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901612317] [2022-12-13 06:29:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:42,361 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-13 06:29:42,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:42,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901612317] [2022-12-13 06:29:42,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901612317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:42,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:42,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:29:42,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903479702] [2022-12-13 06:29:42,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:42,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:29:42,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:42,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:29:42,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:29:42,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:29:42,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 154 transitions, 5961 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:42,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:42,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:29:42,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:43,104 INFO L130 PetriNetUnfolder]: 121/336 cut-off events. [2022-12-13 06:29:43,105 INFO L131 PetriNetUnfolder]: For 531/531 co-relation queries the response was YES. [2022-12-13 06:29:43,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6779 conditions, 336 events. 121/336 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1608 event pairs, 3 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 3804. Up to 337 conditions per place. [2022-12-13 06:29:43,107 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 133 selfloop transitions, 28 changer transitions 31/192 dead transitions. [2022-12-13 06:29:43,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 192 transitions, 7857 flow [2022-12-13 06:29:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:29:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:29:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-12-13 06:29:43,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20857142857142857 [2022-12-13 06:29:43,108 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 69 predicate places. [2022-12-13 06:29:43,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 192 transitions, 7857 flow [2022-12-13 06:29:43,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 161 transitions, 6566 flow [2022-12-13 06:29:43,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:43,113 INFO L89 Accepts]: Start accepts. Operand has 118 places, 161 transitions, 6566 flow [2022-12-13 06:29:43,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:43,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:43,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 161 transitions, 6566 flow [2022-12-13 06:29:43,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 161 transitions, 6566 flow [2022-12-13 06:29:43,118 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:43,118 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:43,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:29:43,119 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 161 transitions, 6566 flow [2022-12-13 06:29:43,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:43,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:43,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:43,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 06:29:43,120 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:43,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1718366214, now seen corresponding path program 1 times [2022-12-13 06:29:43,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:43,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444911525] [2022-12-13 06:29:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:43,961 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-13 06:29:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:43,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444911525] [2022-12-13 06:29:43,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444911525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:43,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:43,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 06:29:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997606169] [2022-12-13 06:29:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 06:29:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 06:29:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 06:29:43,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:29:43,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 161 transitions, 6566 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:29:43,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:43,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:29:43,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:44,522 INFO L130 PetriNetUnfolder]: 115/322 cut-off events. [2022-12-13 06:29:44,523 INFO L131 PetriNetUnfolder]: For 564/564 co-relation queries the response was YES. [2022-12-13 06:29:44,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6847 conditions, 322 events. 115/322 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1529 event pairs, 4 based on Foata normal form. 1/322 useless extension candidates. Maximal degree in co-relation 3957. Up to 323 conditions per place. [2022-12-13 06:29:44,525 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 149 selfloop transitions, 29 changer transitions 12/190 dead transitions. [2022-12-13 06:29:44,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 190 transitions, 8161 flow [2022-12-13 06:29:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:29:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:29:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2022-12-13 06:29:44,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21714285714285714 [2022-12-13 06:29:44,526 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 76 predicate places. [2022-12-13 06:29:44,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 190 transitions, 8161 flow [2022-12-13 06:29:44,529 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 178 transitions, 7632 flow [2022-12-13 06:29:44,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:44,531 INFO L89 Accepts]: Start accepts. Operand has 129 places, 178 transitions, 7632 flow [2022-12-13 06:29:44,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:44,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:44,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 178 transitions, 7632 flow [2022-12-13 06:29:44,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 178 transitions, 7632 flow [2022-12-13 06:29:44,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:44,536 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:44,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:29:44,537 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 178 transitions, 7632 flow [2022-12-13 06:29:44,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:29:44,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:44,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:44,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 06:29:44,537 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash -744817176, now seen corresponding path program 2 times [2022-12-13 06:29:44,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:44,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100842569] [2022-12-13 06:29:44,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:45,360 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-13 06:29:45,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:45,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100842569] [2022-12-13 06:29:45,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100842569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:45,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:45,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 06:29:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039889514] [2022-12-13 06:29:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:45,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 06:29:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 06:29:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 06:29:45,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:29:45,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 178 transitions, 7632 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:29:45,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:45,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:29:45,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:45,976 INFO L130 PetriNetUnfolder]: 117/333 cut-off events. [2022-12-13 06:29:45,977 INFO L131 PetriNetUnfolder]: For 618/618 co-relation queries the response was YES. [2022-12-13 06:29:45,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 333 events. 117/333 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1626 event pairs, 3 based on Foata normal form. 2/334 useless extension candidates. Maximal degree in co-relation 4075. Up to 334 conditions per place. [2022-12-13 06:29:45,979 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 150 selfloop transitions, 21 changer transitions 27/198 dead transitions. [2022-12-13 06:29:45,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 198 transitions, 8907 flow [2022-12-13 06:29:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 06:29:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 06:29:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-12-13 06:29:45,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21666666666666667 [2022-12-13 06:29:45,981 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 85 predicate places. [2022-12-13 06:29:45,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 198 transitions, 8907 flow [2022-12-13 06:29:45,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 171 transitions, 7687 flow [2022-12-13 06:29:45,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:45,986 INFO L89 Accepts]: Start accepts. Operand has 137 places, 171 transitions, 7687 flow [2022-12-13 06:29:45,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:45,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:45,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 171 transitions, 7687 flow [2022-12-13 06:29:45,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 171 transitions, 7687 flow [2022-12-13 06:29:45,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:46,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] $Ultimate##0-->L1712: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_161 24)) (.cse0 (select |v_#pthreadsMutex_304| v_my_callbackThread1of1ForFork0_~data~0.base_161))) (and (= |v_#pthreadsMutex_303| (store |v_#pthreadsMutex_304| v_my_callbackThread1of1ForFork0_~data~0.base_161 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_161 1))) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_33| v_my_callbackThread1of1ForFork0_~arg.base_41) (= v_my_callbackThread1of1ForFork0_~dev~0.base_41 v_my_callbackThread1of1ForFork0_~__mptr~0.base_35) (= v_my_callbackThread1of1ForFork0_~arg.offset_41 |v_my_callbackThread1of1ForFork0_#in~arg.offset_33|) (= (store |v_#memory_$Pointer$.offset_447| v_my_callbackThread1of1ForFork0_~data~0.base_161 (store (select |v_#memory_$Pointer$.offset_447| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1 (select (select |v_#memory_$Pointer$.offset_446| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1))) |v_#memory_$Pointer$.offset_446|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_41 v_my_callbackThread1of1ForFork0_~arg.base_41) (= (store |v_#memory_int_461| v_my_callbackThread1of1ForFork0_~data~0.base_161 (store (select |v_#memory_int_461| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1 1)) |v_#memory_int_460|) (= .cse1 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_35) (= v_my_callbackThread1of1ForFork0_~arg.offset_41 v_my_callbackThread1of1ForFork0_~dev~0.offset_41) (= v_my_callbackThread1of1ForFork0_~data~0.base_161 v_my_callbackThread1of1ForFork0_~__mptr~0.base_35) (= (store |v_#memory_$Pointer$.base_447| v_my_callbackThread1of1ForFork0_~data~0.base_161 (store (select |v_#memory_$Pointer$.base_447| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1 (select (select |v_#memory_$Pointer$.base_446| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1))) |v_#memory_$Pointer$.base_446|) (= (select (select |v_#memory_int_460| v_my_callbackThread1of1ForFork0_~data~0.base_161) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_161 28)) |v_my_callbackThread1of1ForFork0_#t~mem32_75|) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_161) 0) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_41 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_35))) InVars {#pthreadsMutex=|v_#pthreadsMutex_304|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_447|, #memory_int=|v_#memory_int_461|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_447|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_303|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_75|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_446|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_41, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_33|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_39|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_35, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_161, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_161, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_33|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_41, #memory_int=|v_#memory_int_460|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_35, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_41, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_41, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_446|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] [2022-12-13 06:29:46,323 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:29:46,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 337 [2022-12-13 06:29:46,323 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 169 transitions, 7605 flow [2022-12-13 06:29:46,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:29:46,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:46,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:46,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 06:29:46,324 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash 28646978, now seen corresponding path program 1 times [2022-12-13 06:29:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:46,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044760120] [2022-12-13 06:29:46,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:46,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:47,126 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-13 06:29:47,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:47,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044760120] [2022-12-13 06:29:47,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044760120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:47,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:47,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 06:29:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420921416] [2022-12-13 06:29:47,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:47,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 06:29:47,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:47,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 06:29:47,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 06:29:47,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 06:29:47,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 169 transitions, 7605 flow. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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-13 06:29:47,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:47,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 06:29:47,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:47,493 INFO L130 PetriNetUnfolder]: 104/295 cut-off events. [2022-12-13 06:29:47,493 INFO L131 PetriNetUnfolder]: For 474/474 co-relation queries the response was YES. [2022-12-13 06:29:47,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6875 conditions, 295 events. 104/295 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1339 event pairs, 3 based on Foata normal form. 2/296 useless extension candidates. Maximal degree in co-relation 4128. Up to 296 conditions per place. [2022-12-13 06:29:47,495 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 133 selfloop transitions, 15 changer transitions 22/170 dead transitions. [2022-12-13 06:29:47,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 170 transitions, 7994 flow [2022-12-13 06:29:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 06:29:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 06:29:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-12-13 06:29:47,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2230769230769231 [2022-12-13 06:29:47,505 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 89 predicate places. [2022-12-13 06:29:47,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 170 transitions, 7994 flow [2022-12-13 06:29:47,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 148 transitions, 6937 flow [2022-12-13 06:29:47,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:47,512 INFO L89 Accepts]: Start accepts. Operand has 131 places, 148 transitions, 6937 flow [2022-12-13 06:29:47,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:47,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:47,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 148 transitions, 6937 flow [2022-12-13 06:29:47,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 148 transitions, 6937 flow [2022-12-13 06:29:47,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:47,518 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:47,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 06:29:47,520 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 148 transitions, 6937 flow [2022-12-13 06:29:47,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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-13 06:29:47,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:47,520 INFO L214 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-13 06:29:47,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 06:29:47,520 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 176033489, now seen corresponding path program 2 times [2022-12-13 06:29:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:47,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501058764] [2022-12-13 06:29:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:48,535 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-13 06:29:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501058764] [2022-12-13 06:29:48,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501058764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:48,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:48,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493822083] [2022-12-13 06:29:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:48,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:48,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:48,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:48,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:48,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 148 transitions, 6937 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:29:48,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:48,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:48,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:49,292 INFO L130 PetriNetUnfolder]: 166/430 cut-off events. [2022-12-13 06:29:49,292 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2022-12-13 06:29:49,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10332 conditions, 430 events. 166/430 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2158 event pairs, 8 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 5768. Up to 431 conditions per place. [2022-12-13 06:29:49,295 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 173 selfloop transitions, 41 changer transitions 31/245 dead transitions. [2022-12-13 06:29:49,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 245 transitions, 11920 flow [2022-12-13 06:29:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:29:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:29:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2022-12-13 06:29:49,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27884615384615385 [2022-12-13 06:29:49,297 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 88 predicate places. [2022-12-13 06:29:49,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 245 transitions, 11920 flow [2022-12-13 06:29:49,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 214 transitions, 10381 flow [2022-12-13 06:29:49,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:49,304 INFO L89 Accepts]: Start accepts. Operand has 139 places, 214 transitions, 10381 flow [2022-12-13 06:29:49,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:49,308 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:49,308 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 214 transitions, 10381 flow [2022-12-13 06:29:49,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 214 transitions, 10381 flow [2022-12-13 06:29:49,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:49,312 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:49,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 06:29:49,313 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 214 transitions, 10381 flow [2022-12-13 06:29:49,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:29:49,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:49,313 INFO L214 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-13 06:29:49,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 06:29:49,313 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:49,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2114520859, now seen corresponding path program 3 times [2022-12-13 06:29:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:49,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397846714] [2022-12-13 06:29:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:50,397 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-13 06:29:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:50,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397846714] [2022-12-13 06:29:50,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397846714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:50,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:50,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:29:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209457045] [2022-12-13 06:29:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:50,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:29:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:50,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:29:50,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:29:50,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:50,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 214 transitions, 10381 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:50,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:50,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:50,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:51,163 INFO L130 PetriNetUnfolder]: 191/487 cut-off events. [2022-12-13 06:29:51,164 INFO L131 PetriNetUnfolder]: For 726/726 co-relation queries the response was YES. [2022-12-13 06:29:51,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12138 conditions, 487 events. 191/487 cut-off events. For 726/726 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2549 event pairs, 10 based on Foata normal form. 2/488 useless extension candidates. Maximal degree in co-relation 6659. Up to 488 conditions per place. [2022-12-13 06:29:51,167 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 210 selfloop transitions, 34 changer transitions 34/278 dead transitions. [2022-12-13 06:29:51,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 278 transitions, 13996 flow [2022-12-13 06:29:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:29:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:29:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-12-13 06:29:51,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 06:29:51,169 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 97 predicate places. [2022-12-13 06:29:51,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 278 transitions, 13996 flow [2022-12-13 06:29:51,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 244 transitions, 12255 flow [2022-12-13 06:29:51,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:51,178 INFO L89 Accepts]: Start accepts. Operand has 148 places, 244 transitions, 12255 flow [2022-12-13 06:29:51,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:51,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:51,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 244 transitions, 12255 flow [2022-12-13 06:29:51,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 244 transitions, 12255 flow [2022-12-13 06:29:51,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:51,187 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:51,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 06:29:51,188 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 244 transitions, 12255 flow [2022-12-13 06:29:51,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:51,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:51,188 INFO L214 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-13 06:29:51,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 06:29:51,188 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:51,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1558321045, now seen corresponding path program 4 times [2022-12-13 06:29:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:51,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569992735] [2022-12-13 06:29:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:52,159 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-13 06:29:52,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:52,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569992735] [2022-12-13 06:29:52,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569992735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:52,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:52,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:29:52,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665083135] [2022-12-13 06:29:52,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:52,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:29:52,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:52,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:29:52,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:29:52,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:52,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 244 transitions, 12255 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:52,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:52,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:52,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:52,925 INFO L130 PetriNetUnfolder]: 193/496 cut-off events. [2022-12-13 06:29:52,925 INFO L131 PetriNetUnfolder]: For 737/737 co-relation queries the response was YES. [2022-12-13 06:29:52,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12860 conditions, 496 events. 193/496 cut-off events. For 737/737 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2614 event pairs, 10 based on Foata normal form. 2/497 useless extension candidates. Maximal degree in co-relation 7161. Up to 497 conditions per place. [2022-12-13 06:29:52,929 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 225 selfloop transitions, 27 changer transitions 34/286 dead transitions. [2022-12-13 06:29:52,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 286 transitions, 14972 flow [2022-12-13 06:29:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:29:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:29:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-12-13 06:29:52,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2113095238095238 [2022-12-13 06:29:52,931 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 106 predicate places. [2022-12-13 06:29:52,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 286 transitions, 14972 flow [2022-12-13 06:29:52,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 252 transitions, 13163 flow [2022-12-13 06:29:52,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:52,941 INFO L89 Accepts]: Start accepts. Operand has 155 places, 252 transitions, 13163 flow [2022-12-13 06:29:52,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:52,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:52,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 252 transitions, 13163 flow [2022-12-13 06:29:52,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 252 transitions, 13163 flow [2022-12-13 06:29:52,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:52,951 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:52,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 06:29:52,952 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 252 transitions, 13163 flow [2022-12-13 06:29:52,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:52,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:52,953 INFO L214 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-13 06:29:52,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 06:29:52,953 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 460537231, now seen corresponding path program 5 times [2022-12-13 06:29:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:52,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566471350] [2022-12-13 06:29:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:53,877 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-13 06:29:53,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:53,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566471350] [2022-12-13 06:29:53,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566471350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:53,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:53,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:29:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745028394] [2022-12-13 06:29:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:53,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:29:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:53,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:29:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:29:53,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:53,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 252 transitions, 13163 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:53,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:53,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:53,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:54,713 INFO L130 PetriNetUnfolder]: 225/566 cut-off events. [2022-12-13 06:29:54,714 INFO L131 PetriNetUnfolder]: For 799/799 co-relation queries the response was YES. [2022-12-13 06:29:54,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15197 conditions, 566 events. 225/566 cut-off events. For 799/799 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3097 event pairs, 12 based on Foata normal form. 2/567 useless extension candidates. Maximal degree in co-relation 8246. Up to 567 conditions per place. [2022-12-13 06:29:54,733 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 252 selfloop transitions, 38 changer transitions 34/324 dead transitions. [2022-12-13 06:29:54,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 324 transitions, 17548 flow [2022-12-13 06:29:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:29:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:29:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2022-12-13 06:29:54,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24404761904761904 [2022-12-13 06:29:54,734 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 113 predicate places. [2022-12-13 06:29:54,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 324 transitions, 17548 flow [2022-12-13 06:29:54,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 290 transitions, 15671 flow [2022-12-13 06:29:54,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:54,746 INFO L89 Accepts]: Start accepts. Operand has 164 places, 290 transitions, 15671 flow [2022-12-13 06:29:54,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:54,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:54,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 290 transitions, 15671 flow [2022-12-13 06:29:54,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 290 transitions, 15671 flow [2022-12-13 06:29:54,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:54,757 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:54,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 06:29:54,757 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 290 transitions, 15671 flow [2022-12-13 06:29:54,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:54,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:54,757 INFO L214 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-13 06:29:54,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 06:29:54,758 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash 285387337, now seen corresponding path program 6 times [2022-12-13 06:29:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:54,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554870722] [2022-12-13 06:29:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:55,755 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-13 06:29:55,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:55,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554870722] [2022-12-13 06:29:55,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554870722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:55,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:55,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:55,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361904609] [2022-12-13 06:29:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:55,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:55,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:55,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:55,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:55,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:55,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 290 transitions, 15671 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:29:55,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:55,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:55,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:56,402 INFO L130 PetriNetUnfolder]: 223/565 cut-off events. [2022-12-13 06:29:56,402 INFO L131 PetriNetUnfolder]: For 824/824 co-relation queries the response was YES. [2022-12-13 06:29:56,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15735 conditions, 565 events. 223/565 cut-off events. For 824/824 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3119 event pairs, 12 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 8525. Up to 566 conditions per place. [2022-12-13 06:29:56,406 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 254 selfloop transitions, 23 changer transitions 48/325 dead transitions. [2022-12-13 06:29:56,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 325 transitions, 18257 flow [2022-12-13 06:29:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:29:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:29:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-12-13 06:29:56,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22115384615384615 [2022-12-13 06:29:56,414 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 121 predicate places. [2022-12-13 06:29:56,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 325 transitions, 18257 flow [2022-12-13 06:29:56,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 277 transitions, 15519 flow [2022-12-13 06:29:56,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:56,455 INFO L89 Accepts]: Start accepts. Operand has 170 places, 277 transitions, 15519 flow [2022-12-13 06:29:56,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:56,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:56,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 277 transitions, 15519 flow [2022-12-13 06:29:56,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 277 transitions, 15519 flow [2022-12-13 06:29:56,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:56,485 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:56,486 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:56,487 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:56,488 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:56,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [533] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_55 28))) (and (= (store |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.base_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.base_113|) (= |v_#memory_int_158| (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1)))) (= (store |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.offset_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.offset_113|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_114|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_114|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_113|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_113|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 06:29:56,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:56,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 06:29:56,585 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 276 transitions, 15463 flow [2022-12-13 06:29:56,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:29:56,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:56,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:29:56,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 06:29:56,585 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:56,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2118771606, now seen corresponding path program 1 times [2022-12-13 06:29:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:56,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516871160] [2022-12-13 06:29:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:57,447 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-13 06:29:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:57,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516871160] [2022-12-13 06:29:57,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516871160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:57,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:57,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:29:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240819054] [2022-12-13 06:29:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:57,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:29:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:29:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:29:57,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:29:57,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 276 transitions, 15463 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:57,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:57,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:29:57,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:58,115 INFO L130 PetriNetUnfolder]: 215/545 cut-off events. [2022-12-13 06:29:58,115 INFO L131 PetriNetUnfolder]: For 791/791 co-relation queries the response was YES. [2022-12-13 06:29:58,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15721 conditions, 545 events. 215/545 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 12 based on Foata normal form. 2/546 useless extension candidates. Maximal degree in co-relation 8517. Up to 546 conditions per place. [2022-12-13 06:29:58,120 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 252 selfloop transitions, 23 changer transitions 33/308 dead transitions. [2022-12-13 06:29:58,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 308 transitions, 17908 flow [2022-12-13 06:29:58,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:29:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:29:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2022-12-13 06:29:58,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2153846153846154 [2022-12-13 06:29:58,121 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 125 predicate places. [2022-12-13 06:29:58,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 308 transitions, 17908 flow [2022-12-13 06:29:58,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 275 transitions, 15953 flow [2022-12-13 06:29:58,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:58,133 INFO L89 Accepts]: Start accepts. Operand has 175 places, 275 transitions, 15953 flow [2022-12-13 06:29:58,137 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:58,137 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:58,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 275 transitions, 15953 flow [2022-12-13 06:29:58,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 275 transitions, 15953 flow [2022-12-13 06:29:58,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:58,143 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:58,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 06:29:58,144 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 275 transitions, 15953 flow [2022-12-13 06:29:58,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:29:58,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:58,144 INFO L214 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-13 06:29:58,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 06:29:58,144 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:58,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:58,145 INFO L85 PathProgramCache]: Analyzing trace with hash -507843165, now seen corresponding path program 7 times [2022-12-13 06:29:58,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:58,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925565243] [2022-12-13 06:29:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:59,054 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-13 06:29:59,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:59,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925565243] [2022-12-13 06:29:59,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925565243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:59,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:59,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:29:59,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771161074] [2022-12-13 06:29:59,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:59,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:29:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:59,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:29:59,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:29:59,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:29:59,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 275 transitions, 15953 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:59,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:59,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:29:59,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:59,825 INFO L130 PetriNetUnfolder]: 239/598 cut-off events. [2022-12-13 06:29:59,826 INFO L131 PetriNetUnfolder]: For 829/829 co-relation queries the response was YES. [2022-12-13 06:29:59,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17802 conditions, 598 events. 239/598 cut-off events. For 829/829 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3331 event pairs, 14 based on Foata normal form. 2/599 useless extension candidates. Maximal degree in co-relation 9473. Up to 599 conditions per place. [2022-12-13 06:29:59,831 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 269 selfloop transitions, 31 changer transitions 34/334 dead transitions. [2022-12-13 06:29:59,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 334 transitions, 20020 flow [2022-12-13 06:29:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:29:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:29:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-12-13 06:29:59,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 06:29:59,833 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 133 predicate places. [2022-12-13 06:29:59,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 334 transitions, 20020 flow [2022-12-13 06:29:59,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 300 transitions, 17939 flow [2022-12-13 06:29:59,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:59,854 INFO L89 Accepts]: Start accepts. Operand has 184 places, 300 transitions, 17939 flow [2022-12-13 06:29:59,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:59,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:59,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 300 transitions, 17939 flow [2022-12-13 06:29:59,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 300 transitions, 17939 flow [2022-12-13 06:29:59,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:29:59,884 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:29:59,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 06:29:59,885 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 300 transitions, 17939 flow [2022-12-13 06:29:59,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:29:59,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:59,885 INFO L214 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-13 06:29:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 06:29:59,885 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1155882391, now seen corresponding path program 8 times [2022-12-13 06:29:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239963020] [2022-12-13 06:29:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:00,977 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-13 06:30:00,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:00,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239963020] [2022-12-13 06:30:00,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239963020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:00,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:00,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:30:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221492839] [2022-12-13 06:30:00,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:00,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:30:00,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:00,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:30:00,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:30:00,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:30:00,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 300 transitions, 17939 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:30:00,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:00,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:30:00,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:01,785 INFO L130 PetriNetUnfolder]: 242/611 cut-off events. [2022-12-13 06:30:01,786 INFO L131 PetriNetUnfolder]: For 807/807 co-relation queries the response was YES. [2022-12-13 06:30:01,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18777 conditions, 611 events. 242/611 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3462 event pairs, 12 based on Foata normal form. 2/612 useless extension candidates. Maximal degree in co-relation 9728. Up to 612 conditions per place. [2022-12-13 06:30:01,790 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 276 selfloop transitions, 29 changer transitions 34/339 dead transitions. [2022-12-13 06:30:01,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 339 transitions, 20968 flow [2022-12-13 06:30:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:30:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:30:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-12-13 06:30:01,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23214285714285715 [2022-12-13 06:30:01,792 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 142 predicate places. [2022-12-13 06:30:01,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 339 transitions, 20968 flow [2022-12-13 06:30:01,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 305 transitions, 18819 flow [2022-12-13 06:30:01,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:01,805 INFO L89 Accepts]: Start accepts. Operand has 193 places, 305 transitions, 18819 flow [2022-12-13 06:30:01,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:01,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:01,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 305 transitions, 18819 flow [2022-12-13 06:30:01,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 305 transitions, 18819 flow [2022-12-13 06:30:01,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:01,820 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:01,821 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:01,822 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:01,823 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:01,918 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:30:01,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 06:30:01,918 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 304 transitions, 18755 flow [2022-12-13 06:30:01,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:30:01,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:01,919 INFO L214 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-13 06:30:01,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 06:30:01,919 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash 364172323, now seen corresponding path program 9 times [2022-12-13 06:30:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:01,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324826922] [2022-12-13 06:30:01,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:03,290 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-13 06:30:03,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:03,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324826922] [2022-12-13 06:30:03,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324826922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:03,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:03,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:30:03,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829845149] [2022-12-13 06:30:03,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:03,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:30:03,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:03,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:30:03,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:30:03,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:30:03,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 304 transitions, 18755 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:30:03,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:03,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:30:03,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:04,215 INFO L130 PetriNetUnfolder]: 234/595 cut-off events. [2022-12-13 06:30:04,215 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2022-12-13 06:30:04,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18874 conditions, 595 events. 234/595 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3357 event pairs, 13 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 9822. Up to 596 conditions per place. [2022-12-13 06:30:04,223 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 248 selfloop transitions, 68 changer transitions 31/347 dead transitions. [2022-12-13 06:30:04,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 347 transitions, 22164 flow [2022-12-13 06:30:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:30:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:30:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2022-12-13 06:30:04,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24857142857142858 [2022-12-13 06:30:04,226 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2022-12-13 06:30:04,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 347 transitions, 22164 flow [2022-12-13 06:30:04,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 316 transitions, 20129 flow [2022-12-13 06:30:04,254 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:04,254 INFO L89 Accepts]: Start accepts. Operand has 201 places, 316 transitions, 20129 flow [2022-12-13 06:30:04,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:04,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:04,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 316 transitions, 20129 flow [2022-12-13 06:30:04,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 316 transitions, 20129 flow [2022-12-13 06:30:04,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:04,285 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:04,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 06:30:04,285 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 316 transitions, 20129 flow [2022-12-13 06:30:04,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:30:04,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:04,286 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:04,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 06:30:04,286 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -892966023, now seen corresponding path program 1 times [2022-12-13 06:30:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:04,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498943700] [2022-12-13 06:30:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:05,352 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-13 06:30:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:05,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498943700] [2022-12-13 06:30:05,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498943700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:05,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:05,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466582269] [2022-12-13 06:30:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:05,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:05,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:05,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:05,353 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:30:05,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 316 transitions, 20129 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:05,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:05,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:30:05,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:06,131 INFO L130 PetriNetUnfolder]: 217/547 cut-off events. [2022-12-13 06:30:06,131 INFO L131 PetriNetUnfolder]: For 627/627 co-relation queries the response was YES. [2022-12-13 06:30:06,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17879 conditions, 547 events. 217/547 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2975 event pairs, 12 based on Foata normal form. 2/548 useless extension candidates. Maximal degree in co-relation 9902. Up to 548 conditions per place. [2022-12-13 06:30:06,136 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 273 selfloop transitions, 14 changer transitions 35/322 dead transitions. [2022-12-13 06:30:06,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 322 transitions, 21172 flow [2022-12-13 06:30:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:30:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:30:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-12-13 06:30:06,138 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-13 06:30:06,138 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 158 predicate places. [2022-12-13 06:30:06,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 322 transitions, 21172 flow [2022-12-13 06:30:06,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 287 transitions, 18825 flow [2022-12-13 06:30:06,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:06,153 INFO L89 Accepts]: Start accepts. Operand has 205 places, 287 transitions, 18825 flow [2022-12-13 06:30:06,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:06,159 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:06,159 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 287 transitions, 18825 flow [2022-12-13 06:30:06,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 287 transitions, 18825 flow [2022-12-13 06:30:06,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:06,167 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:06,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 06:30:06,168 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 287 transitions, 18825 flow [2022-12-13 06:30:06,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:06,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:06,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:06,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 06:30:06,168 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1831459224, now seen corresponding path program 2 times [2022-12-13 06:30:06,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:06,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517764698] [2022-12-13 06:30:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:06,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:06,521 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-13 06:30:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:06,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517764698] [2022-12-13 06:30:06,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517764698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:06,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:06,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:30:06,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577087430] [2022-12-13 06:30:06,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:06,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:30:06,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:30:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:30:06,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:30:06,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 287 transitions, 18825 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-13 06:30:06,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:06,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:30:06,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:06,902 INFO L130 PetriNetUnfolder]: 203/510 cut-off events. [2022-12-13 06:30:06,902 INFO L131 PetriNetUnfolder]: For 531/531 co-relation queries the response was YES. [2022-12-13 06:30:06,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17178 conditions, 510 events. 203/510 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2721 event pairs, 12 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 10111. Up to 511 conditions per place. [2022-12-13 06:30:06,907 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 264 selfloop transitions, 33 changer transitions 0/297 dead transitions. [2022-12-13 06:30:06,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 297 transitions, 20105 flow [2022-12-13 06:30:06,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:30:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:30:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-12-13 06:30:06,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25142857142857145 [2022-12-13 06:30:06,915 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 156 predicate places. [2022-12-13 06:30:06,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 297 transitions, 20105 flow [2022-12-13 06:30:06,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 297 transitions, 20105 flow [2022-12-13 06:30:06,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:06,928 INFO L89 Accepts]: Start accepts. Operand has 211 places, 297 transitions, 20105 flow [2022-12-13 06:30:06,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:06,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:06,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 297 transitions, 20105 flow [2022-12-13 06:30:06,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 297 transitions, 20105 flow [2022-12-13 06:30:06,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:06,940 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:06,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 06:30:06,941 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 297 transitions, 20105 flow [2022-12-13 06:30:06,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-13 06:30:06,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:06,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:06,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 06:30:06,941 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -691956230, now seen corresponding path program 11 times [2022-12-13 06:30:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:06,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351080938] [2022-12-13 06:30:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:07,933 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-13 06:30:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:07,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351080938] [2022-12-13 06:30:07,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351080938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:07,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:07,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548197661] [2022-12-13 06:30:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:07,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:07,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:30:07,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 297 transitions, 20105 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:07,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:07,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:30:07,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:08,692 INFO L130 PetriNetUnfolder]: 203/517 cut-off events. [2022-12-13 06:30:08,692 INFO L131 PetriNetUnfolder]: For 557/557 co-relation queries the response was YES. [2022-12-13 06:30:08,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17943 conditions, 517 events. 203/517 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2788 event pairs, 12 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 10483. Up to 518 conditions per place. [2022-12-13 06:30:08,699 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 275 selfloop transitions, 35 changer transitions 0/310 dead transitions. [2022-12-13 06:30:08,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 310 transitions, 21641 flow [2022-12-13 06:30:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:30:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:30:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-12-13 06:30:08,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1753846153846154 [2022-12-13 06:30:08,700 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 168 predicate places. [2022-12-13 06:30:08,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 310 transitions, 21641 flow [2022-12-13 06:30:08,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 310 transitions, 21641 flow [2022-12-13 06:30:08,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:08,719 INFO L89 Accepts]: Start accepts. Operand has 223 places, 310 transitions, 21641 flow [2022-12-13 06:30:08,728 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:08,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:08,728 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 310 transitions, 21641 flow [2022-12-13 06:30:08,737 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 310 transitions, 21641 flow [2022-12-13 06:30:08,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:08,741 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:08,742 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:08,744 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:08,744 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:08,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [533] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_55 28))) (and (= (store |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.base_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.base_113|) (= |v_#memory_int_158| (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1)))) (= (store |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.offset_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.offset_113|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_114|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_114|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_113|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_113|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 06:30:08,848 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:30:08,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 06:30:08,848 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 309 transitions, 21571 flow [2022-12-13 06:30:08,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:08,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:08,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:08,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 06:30:08,849 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2054736116, now seen corresponding path program 12 times [2022-12-13 06:30:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:08,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557697616] [2022-12-13 06:30:08,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:08,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:09,902 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-13 06:30:09,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:09,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557697616] [2022-12-13 06:30:09,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557697616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:09,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:09,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:09,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672324591] [2022-12-13 06:30:09,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:09,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:09,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:09,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:09,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:09,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 06:30:09,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 309 transitions, 21571 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:09,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:09,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 06:30:09,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:10,862 INFO L130 PetriNetUnfolder]: 203/531 cut-off events. [2022-12-13 06:30:10,863 INFO L131 PetriNetUnfolder]: For 572/572 co-relation queries the response was YES. [2022-12-13 06:30:10,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18984 conditions, 531 events. 203/531 cut-off events. For 572/572 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2948 event pairs, 12 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 10971. Up to 532 conditions per place. [2022-12-13 06:30:10,870 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 285 selfloop transitions, 39 changer transitions 0/324 dead transitions. [2022-12-13 06:30:10,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 324 transitions, 23311 flow [2022-12-13 06:30:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:30:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:30:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-12-13 06:30:10,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17751479289940827 [2022-12-13 06:30:10,872 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 179 predicate places. [2022-12-13 06:30:10,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 324 transitions, 23311 flow [2022-12-13 06:30:10,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 324 transitions, 23311 flow [2022-12-13 06:30:10,892 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:10,892 INFO L89 Accepts]: Start accepts. Operand has 234 places, 324 transitions, 23311 flow [2022-12-13 06:30:10,901 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:10,901 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:10,901 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 324 transitions, 23311 flow [2022-12-13 06:30:10,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 324 transitions, 23311 flow [2022-12-13 06:30:10,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:10,910 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:10,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 06:30:10,911 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 324 transitions, 23311 flow [2022-12-13 06:30:10,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:10,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:10,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:10,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 06:30:10,912 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:10,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash 277705690, now seen corresponding path program 13 times [2022-12-13 06:30:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:10,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200498425] [2022-12-13 06:30:10,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:11,876 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-13 06:30:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:11,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200498425] [2022-12-13 06:30:11,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200498425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:11,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:11,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362735758] [2022-12-13 06:30:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:11,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:11,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:11,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:11,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:11,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 06:30:11,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 324 transitions, 23311 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:11,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:11,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 06:30:11,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:12,656 INFO L130 PetriNetUnfolder]: 203/534 cut-off events. [2022-12-13 06:30:12,656 INFO L131 PetriNetUnfolder]: For 572/572 co-relation queries the response was YES. [2022-12-13 06:30:12,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19631 conditions, 534 events. 203/534 cut-off events. For 572/572 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2981 event pairs, 12 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 11278. Up to 535 conditions per place. [2022-12-13 06:30:12,661 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 295 selfloop transitions, 32 changer transitions 0/327 dead transitions. [2022-12-13 06:30:12,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 327 transitions, 24190 flow [2022-12-13 06:30:12,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:30:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:30:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-12-13 06:30:12,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17159763313609466 [2022-12-13 06:30:12,670 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 191 predicate places. [2022-12-13 06:30:12,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 327 transitions, 24190 flow [2022-12-13 06:30:12,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 327 transitions, 24190 flow [2022-12-13 06:30:12,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:12,687 INFO L89 Accepts]: Start accepts. Operand has 246 places, 327 transitions, 24190 flow [2022-12-13 06:30:12,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:12,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:12,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 327 transitions, 24190 flow [2022-12-13 06:30:12,702 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 327 transitions, 24190 flow [2022-12-13 06:30:12,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:12,705 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:12,706 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:12,707 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:12,708 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:12,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [594] L1710-1-->L1712: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_167 24))) (and (= (select (select |v_#memory_int_440| v_my_callbackThread1of1ForFork1_~data~0.base_167) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_167 28)) |v_my_callbackThread1of1ForFork1_#t~mem32_55|) (= (store |v_#memory_$Pointer$.base_386| v_my_callbackThread1of1ForFork1_~data~0.base_167 (store (select |v_#memory_$Pointer$.base_386| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0 (select (select |v_#memory_$Pointer$.base_385| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0))) |v_#memory_$Pointer$.base_385|) (= (store |v_#memory_$Pointer$.offset_386| v_my_callbackThread1of1ForFork1_~data~0.base_167 (store (select |v_#memory_$Pointer$.offset_386| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0 (select (select |v_#memory_$Pointer$.offset_385| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0))) |v_#memory_$Pointer$.offset_385|) (= (store |v_#memory_int_441| v_my_callbackThread1of1ForFork1_~data~0.base_167 (store (select |v_#memory_int_441| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0 1)) |v_#memory_int_440|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_167, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_167, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_386|, #memory_int=|v_#memory_int_441|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_386|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_55|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_167, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_167, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_385|, #memory_int=|v_#memory_int_440|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_51|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_385|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] [2022-12-13 06:30:12,812 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:12,813 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:12,814 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:12,814 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:13,001 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:30:13,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 316 [2022-12-13 06:30:13,002 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 325 transitions, 24040 flow [2022-12-13 06:30:13,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:13,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:13,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:13,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 06:30:13,002 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:13,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash -526050004, now seen corresponding path program 3 times [2022-12-13 06:30:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:13,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049888892] [2022-12-13 06:30:13,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:13,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:13,374 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-13 06:30:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:13,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049888892] [2022-12-13 06:30:13,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049888892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:13,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:13,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:30:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825454626] [2022-12-13 06:30:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:13,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:30:13,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:13,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:30:13,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:30:13,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 06:30:13,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 325 transitions, 24040 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-13 06:30:13,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:13,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 06:30:13,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:13,920 INFO L130 PetriNetUnfolder]: 281/727 cut-off events. [2022-12-13 06:30:13,920 INFO L131 PetriNetUnfolder]: For 830/830 co-relation queries the response was YES. [2022-12-13 06:30:13,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27375 conditions, 727 events. 281/727 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4429 event pairs, 18 based on Foata normal form. 3/729 useless extension candidates. Maximal degree in co-relation 15290. Up to 728 conditions per place. [2022-12-13 06:30:13,928 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 350 selfloop transitions, 69 changer transitions 23/442 dead transitions. [2022-12-13 06:30:13,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 442 transitions, 33523 flow [2022-12-13 06:30:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:30:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:30:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-12-13 06:30:13,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 06:30:13,931 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 195 predicate places. [2022-12-13 06:30:13,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 442 transitions, 33523 flow [2022-12-13 06:30:13,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 419 transitions, 31707 flow [2022-12-13 06:30:13,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:13,954 INFO L89 Accepts]: Start accepts. Operand has 247 places, 419 transitions, 31707 flow [2022-12-13 06:30:13,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:13,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:13,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 419 transitions, 31707 flow [2022-12-13 06:30:13,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 419 transitions, 31707 flow [2022-12-13 06:30:13,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:13,977 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:13,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 06:30:13,977 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 419 transitions, 31707 flow [2022-12-13 06:30:13,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-13 06:30:13,978 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:13,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:13,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 06:30:13,978 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash 410303569, now seen corresponding path program 2 times [2022-12-13 06:30:13,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:13,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6672534] [2022-12-13 06:30:13,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:13,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:14,918 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-13 06:30:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:14,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6672534] [2022-12-13 06:30:14,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6672534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:14,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:14,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:14,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716019591] [2022-12-13 06:30:14,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:14,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:14,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:14,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:14,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:30:14,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 419 transitions, 31707 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:14,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:14,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:30:14,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:15,886 INFO L130 PetriNetUnfolder]: 308/781 cut-off events. [2022-12-13 06:30:15,887 INFO L131 PetriNetUnfolder]: For 1167/1167 co-relation queries the response was YES. [2022-12-13 06:30:15,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30219 conditions, 781 events. 308/781 cut-off events. For 1167/1167 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4778 event pairs, 19 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 15806. Up to 782 conditions per place. [2022-12-13 06:30:15,896 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 422 selfloop transitions, 43 changer transitions 14/479 dead transitions. [2022-12-13 06:30:15,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 479 transitions, 37339 flow [2022-12-13 06:30:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:30:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:30:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-12-13 06:30:15,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.216 [2022-12-13 06:30:15,899 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 206 predicate places. [2022-12-13 06:30:15,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 479 transitions, 37339 flow [2022-12-13 06:30:15,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 465 transitions, 36223 flow [2022-12-13 06:30:15,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:15,926 INFO L89 Accepts]: Start accepts. Operand has 261 places, 465 transitions, 36223 flow [2022-12-13 06:30:15,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:15,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:15,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 465 transitions, 36223 flow [2022-12-13 06:30:15,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 465 transitions, 36223 flow [2022-12-13 06:30:15,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:15,951 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:15,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 06:30:15,952 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 465 transitions, 36223 flow [2022-12-13 06:30:15,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:15,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:15,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:15,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 06:30:15,952 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:15,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1831459216, now seen corresponding path program 14 times [2022-12-13 06:30:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:15,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91350257] [2022-12-13 06:30:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:15,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:17,003 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-13 06:30:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:17,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91350257] [2022-12-13 06:30:17,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91350257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:17,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:17,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703097902] [2022-12-13 06:30:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:17,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:17,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:30:17,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 465 transitions, 36223 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:17,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:17,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:30:17,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:17,945 INFO L130 PetriNetUnfolder]: 301/773 cut-off events. [2022-12-13 06:30:17,945 INFO L131 PetriNetUnfolder]: For 1134/1134 co-relation queries the response was YES. [2022-12-13 06:30:17,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30683 conditions, 773 events. 301/773 cut-off events. For 1134/1134 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4770 event pairs, 19 based on Foata normal form. 1/773 useless extension candidates. Maximal degree in co-relation 16379. Up to 774 conditions per place. [2022-12-13 06:30:17,954 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 442 selfloop transitions, 23 changer transitions 11/476 dead transitions. [2022-12-13 06:30:17,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 476 transitions, 38053 flow [2022-12-13 06:30:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:30:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:30:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2022-12-13 06:30:17,955 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14666666666666667 [2022-12-13 06:30:17,956 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 220 predicate places. [2022-12-13 06:30:17,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 476 transitions, 38053 flow [2022-12-13 06:30:17,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 465 transitions, 37153 flow [2022-12-13 06:30:17,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:17,982 INFO L89 Accepts]: Start accepts. Operand has 269 places, 465 transitions, 37153 flow [2022-12-13 06:30:17,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:17,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:17,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 465 transitions, 37153 flow [2022-12-13 06:30:18,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 465 transitions, 37153 flow [2022-12-13 06:30:18,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:18,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [570] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.offset_31| 0) (= |v_#pthreadsMutex_223| (store |v_#pthreadsMutex_224| v_my_callbackThread1of1ForFork0_~data~0.base_111 (store (select |v_#pthreadsMutex_224| v_my_callbackThread1of1ForFork0_~data~0.base_111) v_my_callbackThread1of1ForFork0_~data~0.offset_111 0))) (= |v_my_callbackThread1of1ForFork0_#res.base_31| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_224|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_111, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_111} OutVars{#pthreadsMutex=|v_#pthreadsMutex_223|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_111, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_31|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_31|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_31|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_111} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-13 06:30:18,087 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:30:18,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 06:30:18,087 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 464 transitions, 37073 flow [2022-12-13 06:30:18,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:18,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:18,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:18,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 06:30:18,088 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1920528975, now seen corresponding path program 3 times [2022-12-13 06:30:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:18,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427051752] [2022-12-13 06:30:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:19,036 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-13 06:30:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:19,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427051752] [2022-12-13 06:30:19,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427051752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:19,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:19,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276637250] [2022-12-13 06:30:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:19,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:19,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:19,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:19,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 06:30:19,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 464 transitions, 37073 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:19,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:19,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 06:30:19,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:20,053 INFO L130 PetriNetUnfolder]: 302/776 cut-off events. [2022-12-13 06:30:20,053 INFO L131 PetriNetUnfolder]: For 1125/1125 co-relation queries the response was YES. [2022-12-13 06:30:20,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31590 conditions, 776 events. 302/776 cut-off events. For 1125/1125 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4767 event pairs, 17 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 16461. Up to 777 conditions per place. [2022-12-13 06:30:20,063 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 425 selfloop transitions, 31 changer transitions 23/479 dead transitions. [2022-12-13 06:30:20,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 479 transitions, 39273 flow [2022-12-13 06:30:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:30:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:30:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2022-12-13 06:30:20,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21005917159763313 [2022-12-13 06:30:20,064 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 225 predicate places. [2022-12-13 06:30:20,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 479 transitions, 39273 flow [2022-12-13 06:30:20,083 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 456 transitions, 37366 flow [2022-12-13 06:30:20,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:20,093 INFO L89 Accepts]: Start accepts. Operand has 280 places, 456 transitions, 37366 flow [2022-12-13 06:30:20,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:20,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:20,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 456 transitions, 37366 flow [2022-12-13 06:30:20,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 456 transitions, 37366 flow [2022-12-13 06:30:20,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:20,116 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:20,116 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 06:30:20,116 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 456 transitions, 37366 flow [2022-12-13 06:30:20,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:20,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:20,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:20,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 06:30:20,117 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:20,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1984793821, now seen corresponding path program 1 times [2022-12-13 06:30:20,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:20,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024112894] [2022-12-13 06:30:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:20,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:21,020 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-13 06:30:21,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024112894] [2022-12-13 06:30:21,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024112894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:21,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:21,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 06:30:21,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586077910] [2022-12-13 06:30:21,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:21,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 06:30:21,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:21,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 06:30:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-12-13 06:30:21,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 06:30:21,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 456 transitions, 37366 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:30:21,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:21,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 06:30:21,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:21,889 INFO L130 PetriNetUnfolder]: 290/759 cut-off events. [2022-12-13 06:30:21,890 INFO L131 PetriNetUnfolder]: For 1028/1028 co-relation queries the response was YES. [2022-12-13 06:30:21,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31674 conditions, 759 events. 290/759 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4697 event pairs, 17 based on Foata normal form. 1/759 useless extension candidates. Maximal degree in co-relation 17089. Up to 760 conditions per place. [2022-12-13 06:30:21,898 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 422 selfloop transitions, 33 changer transitions 22/477 dead transitions. [2022-12-13 06:30:21,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 477 transitions, 40093 flow [2022-12-13 06:30:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:30:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:30:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-12-13 06:30:21,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17582417582417584 [2022-12-13 06:30:21,899 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 238 predicate places. [2022-12-13 06:30:21,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 293 places, 477 transitions, 40093 flow [2022-12-13 06:30:21,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 455 transitions, 38206 flow [2022-12-13 06:30:21,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:21,922 INFO L89 Accepts]: Start accepts. Operand has 289 places, 455 transitions, 38206 flow [2022-12-13 06:30:21,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:21,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:21,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 455 transitions, 38206 flow [2022-12-13 06:30:21,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 289 places, 455 transitions, 38206 flow [2022-12-13 06:30:21,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:21,944 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:21,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 06:30:21,945 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 455 transitions, 38206 flow [2022-12-13 06:30:21,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:30:21,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:21,945 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:21,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 06:30:21,945 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:21,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:21,945 INFO L85 PathProgramCache]: Analyzing trace with hash -429258496, now seen corresponding path program 15 times [2022-12-13 06:30:21,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:21,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102033627] [2022-12-13 06:30:21,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:21,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:22,881 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-13 06:30:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:22,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102033627] [2022-12-13 06:30:22,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102033627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:22,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:22,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16358140] [2022-12-13 06:30:22,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:22,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:22,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:22,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:22,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:30:22,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 455 transitions, 38206 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:22,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:22,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:30:22,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:23,629 INFO L130 PetriNetUnfolder]: 286/742 cut-off events. [2022-12-13 06:30:23,629 INFO L131 PetriNetUnfolder]: For 1029/1029 co-relation queries the response was YES. [2022-12-13 06:30:23,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31692 conditions, 742 events. 286/742 cut-off events. For 1029/1029 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4517 event pairs, 17 based on Foata normal form. 1/742 useless extension candidates. Maximal degree in co-relation 16846. Up to 743 conditions per place. [2022-12-13 06:30:23,637 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 435 selfloop transitions, 12 changer transitions 13/460 dead transitions. [2022-12-13 06:30:23,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 460 transitions, 39562 flow [2022-12-13 06:30:23,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:30:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:30:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-12-13 06:30:23,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16 [2022-12-13 06:30:23,639 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 246 predicate places. [2022-12-13 06:30:23,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 460 transitions, 39562 flow [2022-12-13 06:30:23,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 447 transitions, 38428 flow [2022-12-13 06:30:23,664 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:23,664 INFO L89 Accepts]: Start accepts. Operand has 294 places, 447 transitions, 38428 flow [2022-12-13 06:30:23,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:23,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:23,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 294 places, 447 transitions, 38428 flow [2022-12-13 06:30:23,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 294 places, 447 transitions, 38428 flow [2022-12-13 06:30:23,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:23,798 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:23,799 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:23,801 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:23,801 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:24,037 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:24,037 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:24,039 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:24,039 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:24,495 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:24,496 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:24,497 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:24,497 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:24,499 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse4 (select |v_#memory_$Pointer$.base_535| v_my_callbackThread1of1ForFork0_~data~0.base_171)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_171 28)) (.cse3 (select |v_#memory_$Pointer$.offset_535| v_my_callbackThread1of1ForFork0_~data~0.base_171)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_171 24)) (.cse5 (select |v_#pthreadsMutex_333| v_my_callbackThread1of1ForFork0_~data~0.base_171))) (and (= |v_my_callbackThread1of1ForFork0_#res.base_43| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_43| 0) (= v_my_callbackThread1of1ForFork0_~arg.offset_49 v_my_callbackThread1of1ForFork0_~dev~0.offset_49) (= v_my_callbackThread1of1ForFork0_~arg.offset_49 |v_my_callbackThread1of1ForFork0_#in~arg.offset_41|) (= (store |v_#memory_int_507| v_my_callbackThread1of1ForFork0_~data~0.base_171 (let ((.cse0 (select |v_#memory_int_507| v_my_callbackThread1of1ForFork0_~data~0.base_171))) (store (store .cse0 .cse1 1) .cse2 (+ (select .cse0 .cse2) 1)))) |v_#memory_int_506|) (= (store |v_#memory_$Pointer$.offset_535| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store .cse3 .cse2 (select (select |v_#memory_$Pointer$.offset_533| v_my_callbackThread1of1ForFork0_~data~0.base_171) .cse2))) |v_#memory_$Pointer$.offset_533|) (= (store |v_#memory_$Pointer$.base_534| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store (select |v_#memory_$Pointer$.base_534| v_my_callbackThread1of1ForFork0_~data~0.base_171) .cse1 (select .cse4 .cse1))) |v_#memory_$Pointer$.base_535|) (= (select .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_171) 0) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_41| v_my_callbackThread1of1ForFork0_~arg.base_49) (= (store |v_#memory_$Pointer$.base_535| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store .cse4 .cse2 (select (select |v_#memory_$Pointer$.base_533| v_my_callbackThread1of1ForFork0_~data~0.base_171) .cse2))) |v_#memory_$Pointer$.base_533|) (= (store |v_#memory_$Pointer$.offset_534| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store (select |v_#memory_$Pointer$.offset_534| v_my_callbackThread1of1ForFork0_~data~0.base_171) .cse1 (select .cse3 .cse1))) |v_#memory_$Pointer$.offset_535|) (= .cse1 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_43) (= v_my_callbackThread1of1ForFork0_~dev~0.base_49 v_my_callbackThread1of1ForFork0_~arg.base_49) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_49 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_43) (= v_my_callbackThread1of1ForFork0_~data~0.base_171 v_my_callbackThread1of1ForFork0_~__mptr~0.base_43) (= |v_#pthreadsMutex_331| (store |v_#pthreadsMutex_333| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_171 0))) (= v_my_callbackThread1of1ForFork0_~dev~0.base_49 v_my_callbackThread1of1ForFork0_~__mptr~0.base_43))) InVars {#pthreadsMutex=|v_#pthreadsMutex_333|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_41|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_534|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_41|, #memory_int=|v_#memory_int_507|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_534|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_331|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_85|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_533|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_49, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_41|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_47|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_43, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_171, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_171, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_43|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_41|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_49, #memory_int=|v_#memory_int_506|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_43, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_49, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_43|, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_49, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_533|} AuxVars[|v_#memory_$Pointer$.offset_535|, |v_#memory_$Pointer$.base_535|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_#res.offset, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [608] $Ultimate##0-->L1712: Formula: (let ((.cse0 (select |v_#pthreadsMutex_328| v_my_callbackThread1of1ForFork1_~data~0.base_183)) (.cse1 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_183 24))) (and (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_183) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.base_33 v_my_callbackThread1of1ForFork1_~arg.base_31) (= (select (select |v_#memory_int_502| v_my_callbackThread1of1ForFork1_~data~0.base_183) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_183 28)) |v_my_callbackThread1of1ForFork1_#t~mem32_79|) (= |v_#memory_$Pointer$.offset_529| (store |v_#memory_$Pointer$.offset_530| v_my_callbackThread1of1ForFork1_~data~0.base_183 (store (select |v_#memory_$Pointer$.offset_530| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1 (select (select |v_#memory_$Pointer$.offset_529| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1)))) (= |v_#memory_$Pointer$.base_529| (store |v_#memory_$Pointer$.base_530| v_my_callbackThread1of1ForFork1_~data~0.base_183 (store (select |v_#memory_$Pointer$.base_530| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1 (select (select |v_#memory_$Pointer$.base_529| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1)))) (= v_my_callbackThread1of1ForFork1_~data~0.base_183 v_my_callbackThread1of1ForFork1_~__mptr~0.base_39) (= v_my_callbackThread1of1ForFork1_~dev~0.base_33 v_my_callbackThread1of1ForFork1_~__mptr~0.base_39) (= .cse1 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_39) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_33 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_39) (= v_my_callbackThread1of1ForFork1_~arg.base_31 |v_my_callbackThread1of1ForFork1_#in~arg.base_25|) (= (store |v_#pthreadsMutex_328| v_my_callbackThread1of1ForFork1_~data~0.base_183 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_183 1)) |v_#pthreadsMutex_327|) (= (store |v_#memory_int_503| v_my_callbackThread1of1ForFork1_~data~0.base_183 (store (select |v_#memory_int_503| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1 1)) |v_#memory_int_502|) (= v_my_callbackThread1of1ForFork1_~arg.offset_31 |v_my_callbackThread1of1ForFork1_#in~arg.offset_25|) (= v_my_callbackThread1of1ForFork1_~arg.offset_31 v_my_callbackThread1of1ForFork1_~dev~0.offset_33))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_25|, #pthreadsMutex=|v_#pthreadsMutex_328|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_530|, #memory_int=|v_#memory_int_503|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_530|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_25|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_79|, #pthreadsMutex=|v_#pthreadsMutex_327|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_529|, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_31, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_39, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_65|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_25|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_25|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_183, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_183, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_31, #memory_int=|v_#memory_int_502|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_39, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_33, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_33, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_529|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base, #memory_$Pointer$.offset] [2022-12-13 06:30:27,549 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:27,549 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:27,550 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:27,551 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:34,481 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:34,482 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:34,483 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:34,483 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:34,594 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 06:30:34,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10930 [2022-12-13 06:30:34,594 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 440 transitions, 37830 flow [2022-12-13 06:30:34,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:34,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:34,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 06:30:34,595 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1379697354, now seen corresponding path program 1 times [2022-12-13 06:30:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:34,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726145476] [2022-12-13 06:30:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:34,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:35,244 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-13 06:30:35,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:35,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726145476] [2022-12-13 06:30:35,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726145476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:35,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:35,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 06:30:35,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894107143] [2022-12-13 06:30:35,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:35,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 06:30:35,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 06:30:35,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 06:30:35,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 06:30:35,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 440 transitions, 37830 flow. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-13 06:30:35,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:35,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 06:30:35,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:35,857 INFO L130 PetriNetUnfolder]: 285/724 cut-off events. [2022-12-13 06:30:35,857 INFO L131 PetriNetUnfolder]: For 984/984 co-relation queries the response was YES. [2022-12-13 06:30:35,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31641 conditions, 724 events. 285/724 cut-off events. For 984/984 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4335 event pairs, 17 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 16538. Up to 725 conditions per place. [2022-12-13 06:30:35,866 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 423 selfloop transitions, 11 changer transitions 8/442 dead transitions. [2022-12-13 06:30:35,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 442 transitions, 38893 flow [2022-12-13 06:30:35,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:30:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:30:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-12-13 06:30:35,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 06:30:35,868 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 222 predicate places. [2022-12-13 06:30:35,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 442 transitions, 38893 flow [2022-12-13 06:30:35,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 434 transitions, 38165 flow [2022-12-13 06:30:35,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:35,895 INFO L89 Accepts]: Start accepts. Operand has 275 places, 434 transitions, 38165 flow [2022-12-13 06:30:35,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:35,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:35,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 434 transitions, 38165 flow [2022-12-13 06:30:35,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 434 transitions, 38165 flow [2022-12-13 06:30:35,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:35,943 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:35,944 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:35,946 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:35,948 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:35,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [377] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 06:30:36,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:30:36,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 06:30:36,047 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 433 transitions, 38085 flow [2022-12-13 06:30:36,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-13 06:30:36,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:36,047 INFO L214 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-13 06:30:36,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 06:30:36,047 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1484643995, now seen corresponding path program 1 times [2022-12-13 06:30:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:36,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114161913] [2022-12-13 06:30:36,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:37,108 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-13 06:30:37,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:37,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114161913] [2022-12-13 06:30:37,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114161913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:37,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:37,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:30:37,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476604384] [2022-12-13 06:30:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:30:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:30:37,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:30:37,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 06:30:37,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 433 transitions, 38085 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:30:37,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:37,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 06:30:37,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:38,030 INFO L130 PetriNetUnfolder]: 284/724 cut-off events. [2022-12-13 06:30:38,030 INFO L131 PetriNetUnfolder]: For 1014/1014 co-relation queries the response was YES. [2022-12-13 06:30:38,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32371 conditions, 724 events. 284/724 cut-off events. For 1014/1014 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4359 event pairs, 17 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 16783. Up to 725 conditions per place. [2022-12-13 06:30:38,039 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 405 selfloop transitions, 30 changer transitions 7/442 dead transitions. [2022-12-13 06:30:38,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 442 transitions, 39788 flow [2022-12-13 06:30:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:30:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:30:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2022-12-13 06:30:38,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.164021164021164 [2022-12-13 06:30:38,042 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 231 predicate places. [2022-12-13 06:30:38,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 442 transitions, 39788 flow [2022-12-13 06:30:38,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 435 transitions, 39144 flow [2022-12-13 06:30:38,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:38,068 INFO L89 Accepts]: Start accepts. Operand has 286 places, 435 transitions, 39144 flow [2022-12-13 06:30:38,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:38,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:38,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 435 transitions, 39144 flow [2022-12-13 06:30:38,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 435 transitions, 39144 flow [2022-12-13 06:30:38,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:38,095 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:38,096 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:38,098 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:38,098 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:38,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:30:38,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 06:30:38,169 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 434 transitions, 39052 flow [2022-12-13 06:30:38,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:30:38,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:38,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:38,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 06:30:38,170 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1644134177, now seen corresponding path program 1 times [2022-12-13 06:30:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:38,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079805759] [2022-12-13 06:30:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:39,079 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-13 06:30:39,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:39,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079805759] [2022-12-13 06:30:39,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079805759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:39,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:39,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 06:30:39,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370277572] [2022-12-13 06:30:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:39,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 06:30:39,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:39,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 06:30:39,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 06:30:39,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 06:30:39,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 434 transitions, 39052 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:30:39,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:39,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 06:30:39,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:39,876 INFO L130 PetriNetUnfolder]: 283/726 cut-off events. [2022-12-13 06:30:39,876 INFO L131 PetriNetUnfolder]: For 1021/1021 co-relation queries the response was YES. [2022-12-13 06:30:39,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33185 conditions, 726 events. 283/726 cut-off events. For 1021/1021 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4386 event pairs, 17 based on Foata normal form. 1/726 useless extension candidates. Maximal degree in co-relation 17248. Up to 727 conditions per place. [2022-12-13 06:30:39,886 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 422 selfloop transitions, 11 changer transitions 11/444 dead transitions. [2022-12-13 06:30:39,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 444 transitions, 40850 flow [2022-12-13 06:30:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 06:30:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 06:30:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2022-12-13 06:30:39,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15773809523809523 [2022-12-13 06:30:39,889 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 241 predicate places. [2022-12-13 06:30:39,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 444 transitions, 40850 flow [2022-12-13 06:30:39,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 433 transitions, 39824 flow [2022-12-13 06:30:39,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:39,913 INFO L89 Accepts]: Start accepts. Operand has 290 places, 433 transitions, 39824 flow [2022-12-13 06:30:39,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:39,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:39,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 433 transitions, 39824 flow [2022-12-13 06:30:39,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 433 transitions, 39824 flow [2022-12-13 06:30:39,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:39,936 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:39,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 06:30:39,937 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 433 transitions, 39824 flow [2022-12-13 06:30:39,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-13 06:30:39,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:39,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:39,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 06:30:39,937 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash -571273743, now seen corresponding path program 4 times [2022-12-13 06:30:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:39,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506014621] [2022-12-13 06:30:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:39,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:40,821 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-13 06:30:40,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:40,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506014621] [2022-12-13 06:30:40,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506014621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:40,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:40,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:40,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799904941] [2022-12-13 06:30:40,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:40,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:40,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:40,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:40,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:40,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 06:30:40,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 433 transitions, 39824 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:40,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:40,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 06:30:40,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:41,660 INFO L130 PetriNetUnfolder]: 283/739 cut-off events. [2022-12-13 06:30:41,660 INFO L131 PetriNetUnfolder]: For 1023/1023 co-relation queries the response was YES. [2022-12-13 06:30:41,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34547 conditions, 739 events. 283/739 cut-off events. For 1023/1023 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4492 event pairs, 17 based on Foata normal form. 1/739 useless extension candidates. Maximal degree in co-relation 17441. Up to 740 conditions per place. [2022-12-13 06:30:41,668 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 398 selfloop transitions, 37 changer transitions 20/455 dead transitions. [2022-12-13 06:30:41,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 455 transitions, 42820 flow [2022-12-13 06:30:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:30:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:30:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2022-12-13 06:30:41,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19753086419753085 [2022-12-13 06:30:41,670 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 249 predicate places. [2022-12-13 06:30:41,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 304 places, 455 transitions, 42820 flow [2022-12-13 06:30:41,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 304 places, 435 transitions, 40907 flow [2022-12-13 06:30:41,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:41,695 INFO L89 Accepts]: Start accepts. Operand has 304 places, 435 transitions, 40907 flow [2022-12-13 06:30:41,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:41,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:41,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 435 transitions, 40907 flow [2022-12-13 06:30:41,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 435 transitions, 40907 flow [2022-12-13 06:30:41,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:41,726 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:41,727 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:41,743 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:41,744 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:41,795 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:41,795 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:41,798 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:41,798 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:42,057 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:30:42,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-13 06:30:42,057 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 433 transitions, 40721 flow [2022-12-13 06:30:42,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:42,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:42,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:42,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 06:30:42,058 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:42,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1161268722, now seen corresponding path program 1 times [2022-12-13 06:30:42,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:42,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595055086] [2022-12-13 06:30:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:42,405 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-13 06:30:42,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:42,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595055086] [2022-12-13 06:30:42,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595055086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:42,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:42,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:30:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990499199] [2022-12-13 06:30:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:42,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:30:42,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:42,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:30:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:30:42,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 06:30:42,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 433 transitions, 40721 flow. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-13 06:30:42,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:42,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 06:30:42,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:42,997 INFO L130 PetriNetUnfolder]: 355/937 cut-off events. [2022-12-13 06:30:42,997 INFO L131 PetriNetUnfolder]: For 2024/2024 co-relation queries the response was YES. [2022-12-13 06:30:42,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44587 conditions, 937 events. 355/937 cut-off events. For 2024/2024 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6357 event pairs, 0 based on Foata normal form. 5/940 useless extension candidates. Maximal degree in co-relation 17953. Up to 938 conditions per place. [2022-12-13 06:30:43,007 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 417 selfloop transitions, 110 changer transitions 64/591 dead transitions. [2022-12-13 06:30:43,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 591 transitions, 56763 flow [2022-12-13 06:30:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:30:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:30:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-12-13 06:30:43,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30687830687830686 [2022-12-13 06:30:43,010 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 239 predicate places. [2022-12-13 06:30:43,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 591 transitions, 56763 flow [2022-12-13 06:30:43,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 527 transitions, 50529 flow [2022-12-13 06:30:43,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:43,042 INFO L89 Accepts]: Start accepts. Operand has 288 places, 527 transitions, 50529 flow [2022-12-13 06:30:43,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:43,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:43,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 527 transitions, 50529 flow [2022-12-13 06:30:43,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 527 transitions, 50529 flow [2022-12-13 06:30:43,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:43,080 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:43,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 06:30:43,080 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 527 transitions, 50529 flow [2022-12-13 06:30:43,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-13 06:30:43,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:43,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:43,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 06:30:43,081 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:43,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash -120432914, now seen corresponding path program 2 times [2022-12-13 06:30:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:43,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225603832] [2022-12-13 06:30:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:43,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:43,367 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-13 06:30:43,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:43,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225603832] [2022-12-13 06:30:43,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225603832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:43,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:43,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:30:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321884398] [2022-12-13 06:30:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:43,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:30:43,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:43,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:30:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:30:43,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 06:30:43,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 527 transitions, 50529 flow. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-13 06:30:43,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:43,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 06:30:43,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:44,056 INFO L130 PetriNetUnfolder]: 325/846 cut-off events. [2022-12-13 06:30:44,056 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 06:30:44,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41041 conditions, 846 events. 325/846 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5473 event pairs, 0 based on Foata normal form. 3/849 useless extension candidates. Maximal degree in co-relation 17267. Up to 847 conditions per place. [2022-12-13 06:30:44,065 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 402 selfloop transitions, 84 changer transitions 45/531 dead transitions. [2022-12-13 06:30:44,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 531 transitions, 51983 flow [2022-12-13 06:30:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:30:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:30:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-12-13 06:30:44,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2751322751322751 [2022-12-13 06:30:44,067 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 239 predicate places. [2022-12-13 06:30:44,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 531 transitions, 51983 flow [2022-12-13 06:30:44,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 486 transitions, 47531 flow [2022-12-13 06:30:44,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:44,095 INFO L89 Accepts]: Start accepts. Operand has 276 places, 486 transitions, 47531 flow [2022-12-13 06:30:44,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:44,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:44,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 486 transitions, 47531 flow [2022-12-13 06:30:44,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 486 transitions, 47531 flow [2022-12-13 06:30:44,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:44,123 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:44,124 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 06:30:44,124 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 486 transitions, 47531 flow [2022-12-13 06:30:44,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-13 06:30:44,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:44,124 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:44,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 06:30:44,124 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash 347595412, now seen corresponding path program 1 times [2022-12-13 06:30:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:44,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277772721] [2022-12-13 06:30:44,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:44,448 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-13 06:30:44,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:44,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277772721] [2022-12-13 06:30:44,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277772721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:44,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:44,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:30:44,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305866043] [2022-12-13 06:30:44,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:44,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:30:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:30:44,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:30:44,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 06:30:44,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 486 transitions, 47531 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-13 06:30:44,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:44,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 06:30:44,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:44,969 INFO L130 PetriNetUnfolder]: 308/786 cut-off events. [2022-12-13 06:30:44,969 INFO L131 PetriNetUnfolder]: For 1535/1535 co-relation queries the response was YES. [2022-12-13 06:30:44,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38892 conditions, 786 events. 308/786 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4876 event pairs, 0 based on Foata normal form. 1/787 useless extension candidates. Maximal degree in co-relation 17176. Up to 787 conditions per place. [2022-12-13 06:30:44,980 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 435 selfloop transitions, 43 changer transitions 7/485 dead transitions. [2022-12-13 06:30:44,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 485 transitions, 48401 flow [2022-12-13 06:30:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:30:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:30:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-12-13 06:30:44,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2802197802197802 [2022-12-13 06:30:44,982 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 226 predicate places. [2022-12-13 06:30:44,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 485 transitions, 48401 flow [2022-12-13 06:30:45,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 478 transitions, 47681 flow [2022-12-13 06:30:45,019 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:45,019 INFO L89 Accepts]: Start accepts. Operand has 279 places, 478 transitions, 47681 flow [2022-12-13 06:30:45,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:45,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:45,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 478 transitions, 47681 flow [2022-12-13 06:30:45,091 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 478 transitions, 47681 flow [2022-12-13 06:30:45,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:45,096 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:45,096 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:45,098 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:30:45,099 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:30:45,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [533] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_55 28))) (and (= (store |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.base_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.base_113|) (= |v_#memory_int_158| (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1)))) (= (store |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.offset_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.offset_113|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_114|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_114|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_113|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_113|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 06:30:45,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:30:45,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-13 06:30:45,200 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 477 transitions, 47581 flow [2022-12-13 06:30:45,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-13 06:30:45,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:45,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:45,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 06:30:45,201 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:45,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1983498381, now seen corresponding path program 1 times [2022-12-13 06:30:45,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:45,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537712689] [2022-12-13 06:30:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:45,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:46,133 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-13 06:30:46,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:46,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537712689] [2022-12-13 06:30:46,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537712689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:46,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:46,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:46,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230720815] [2022-12-13 06:30:46,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:46,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:46,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:46,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:46,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:46,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:30:46,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 477 transitions, 47581 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:46,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:46,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:30:46,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:47,067 INFO L130 PetriNetUnfolder]: 307/786 cut-off events. [2022-12-13 06:30:47,072 INFO L131 PetriNetUnfolder]: For 1541/1541 co-relation queries the response was YES. [2022-12-13 06:30:47,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39676 conditions, 786 events. 307/786 cut-off events. For 1541/1541 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4894 event pairs, 0 based on Foata normal form. 1/787 useless extension candidates. Maximal degree in co-relation 17520. Up to 787 conditions per place. [2022-12-13 06:30:47,081 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 461 selfloop transitions, 15 changer transitions 10/486 dead transitions. [2022-12-13 06:30:47,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 486 transitions, 49469 flow [2022-12-13 06:30:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:30:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:30:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-12-13 06:30:47,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1457142857142857 [2022-12-13 06:30:47,083 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 235 predicate places. [2022-12-13 06:30:47,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 486 transitions, 49469 flow [2022-12-13 06:30:47,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 285 places, 476 transitions, 48431 flow [2022-12-13 06:30:47,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:47,115 INFO L89 Accepts]: Start accepts. Operand has 285 places, 476 transitions, 48431 flow [2022-12-13 06:30:47,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:47,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:47,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 476 transitions, 48431 flow [2022-12-13 06:30:47,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 476 transitions, 48431 flow [2022-12-13 06:30:47,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:47,148 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:47,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 06:30:47,149 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 476 transitions, 48431 flow [2022-12-13 06:30:47,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:47,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:47,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:47,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 06:30:47,149 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash 830300751, now seen corresponding path program 1 times [2022-12-13 06:30:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:47,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725327302] [2022-12-13 06:30:47,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:48,063 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-13 06:30:48,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:48,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725327302] [2022-12-13 06:30:48,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725327302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:48,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:48,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770749135] [2022-12-13 06:30:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:48,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:48,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:48,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 06:30:48,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 476 transitions, 48431 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:48,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:48,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 06:30:48,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:48,938 INFO L130 PetriNetUnfolder]: 306/781 cut-off events. [2022-12-13 06:30:48,938 INFO L131 PetriNetUnfolder]: For 1512/1512 co-relation queries the response was YES. [2022-12-13 06:30:48,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40202 conditions, 781 events. 306/781 cut-off events. For 1512/1512 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4843 event pairs, 0 based on Foata normal form. 1/782 useless extension candidates. Maximal degree in co-relation 17606. Up to 782 conditions per place. [2022-12-13 06:30:48,947 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 453 selfloop transitions, 23 changer transitions 6/482 dead transitions. [2022-12-13 06:30:48,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 482 transitions, 50025 flow [2022-12-13 06:30:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:30:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:30:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-12-13 06:30:48,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15692307692307692 [2022-12-13 06:30:48,957 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 242 predicate places. [2022-12-13 06:30:48,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 482 transitions, 50025 flow [2022-12-13 06:30:48,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 476 transitions, 49381 flow [2022-12-13 06:30:48,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:48,988 INFO L89 Accepts]: Start accepts. Operand has 296 places, 476 transitions, 49381 flow [2022-12-13 06:30:49,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:49,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:49,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 296 places, 476 transitions, 49381 flow [2022-12-13 06:30:49,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 296 places, 476 transitions, 49381 flow [2022-12-13 06:30:49,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:49,020 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:49,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 06:30:49,021 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 476 transitions, 49381 flow [2022-12-13 06:30:49,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:49,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:49,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:49,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 06:30:49,022 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 643257341, now seen corresponding path program 2 times [2022-12-13 06:30:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:49,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972062968] [2022-12-13 06:30:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:49,922 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-13 06:30:49,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:49,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972062968] [2022-12-13 06:30:49,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972062968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:49,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:49,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485735523] [2022-12-13 06:30:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:49,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:49,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:49,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:30:49,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 476 transitions, 49381 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:49,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:49,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:30:49,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:50,832 INFO L130 PetriNetUnfolder]: 306/774 cut-off events. [2022-12-13 06:30:50,833 INFO L131 PetriNetUnfolder]: For 1509/1509 co-relation queries the response was YES. [2022-12-13 06:30:50,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40603 conditions, 774 events. 306/774 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4756 event pairs, 0 based on Foata normal form. 1/775 useless extension candidates. Maximal degree in co-relation 17839. Up to 775 conditions per place. [2022-12-13 06:30:50,843 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 455 selfloop transitions, 9 changer transitions 11/475 dead transitions. [2022-12-13 06:30:50,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 475 transitions, 50225 flow [2022-12-13 06:30:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:30:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:30:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2022-12-13 06:30:50,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14743589743589744 [2022-12-13 06:30:50,851 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 253 predicate places. [2022-12-13 06:30:50,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 475 transitions, 50225 flow [2022-12-13 06:30:50,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 464 transitions, 49047 flow [2022-12-13 06:30:50,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:50,883 INFO L89 Accepts]: Start accepts. Operand has 301 places, 464 transitions, 49047 flow [2022-12-13 06:30:50,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:50,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:50,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 464 transitions, 49047 flow [2022-12-13 06:30:50,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 301 places, 464 transitions, 49047 flow [2022-12-13 06:30:50,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:50,920 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:50,920 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 06:30:50,920 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 464 transitions, 49047 flow [2022-12-13 06:30:50,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-13 06:30:50,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:50,921 INFO L214 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-13 06:30:50,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 06:30:50,922 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash 331792540, now seen corresponding path program 1 times [2022-12-13 06:30:50,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:50,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661555405] [2022-12-13 06:30:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:51,839 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-13 06:30:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:51,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661555405] [2022-12-13 06:30:51,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661555405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:51,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:51,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-13 06:30:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171124710] [2022-12-13 06:30:51,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:51,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 06:30:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:51,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 06:30:51,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-12-13 06:30:51,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:30:51,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 464 transitions, 49047 flow. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-13 06:30:51,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:51,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:30:51,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:52,865 INFO L130 PetriNetUnfolder]: 324/829 cut-off events. [2022-12-13 06:30:52,866 INFO L131 PetriNetUnfolder]: For 1863/1863 co-relation queries the response was YES. [2022-12-13 06:30:52,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44359 conditions, 829 events. 324/829 cut-off events. For 1863/1863 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5292 event pairs, 0 based on Foata normal form. 4/833 useless extension candidates. Maximal degree in co-relation 18171. Up to 830 conditions per place. [2022-12-13 06:30:52,876 INFO L137 encePairwiseOnDemand]: 6/23 looper letters, 344 selfloop transitions, 90 changer transitions 82/516 dead transitions. [2022-12-13 06:30:52,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 516 transitions, 55711 flow [2022-12-13 06:30:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:30:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:30:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-12-13 06:30:52,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2453416149068323 [2022-12-13 06:30:52,877 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 259 predicate places. [2022-12-13 06:30:52,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 314 places, 516 transitions, 55711 flow [2022-12-13 06:30:52,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 434 transitions, 46775 flow [2022-12-13 06:30:52,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:52,907 INFO L89 Accepts]: Start accepts. Operand has 311 places, 434 transitions, 46775 flow [2022-12-13 06:30:52,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:52,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:52,926 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 434 transitions, 46775 flow [2022-12-13 06:30:52,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 434 transitions, 46775 flow [2022-12-13 06:30:52,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:52,941 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:52,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 06:30:52,942 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 434 transitions, 46775 flow [2022-12-13 06:30:52,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-13 06:30:52,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:52,942 INFO L214 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-13 06:30:52,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 06:30:52,942 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:52,942 INFO L85 PathProgramCache]: Analyzing trace with hash 162040849, now seen corresponding path program 10 times [2022-12-13 06:30:52,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:52,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388749709] [2022-12-13 06:30:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:52,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:53,803 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-13 06:30:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:53,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388749709] [2022-12-13 06:30:53,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388749709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:53,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:53,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:30:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395483380] [2022-12-13 06:30:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:53,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:30:53,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:53,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:30:53,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:30:53,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:30:53,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 434 transitions, 46775 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:30:53,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:53,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:30:53,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:54,754 INFO L130 PetriNetUnfolder]: 279/733 cut-off events. [2022-12-13 06:30:54,754 INFO L131 PetriNetUnfolder]: For 1479/1479 co-relation queries the response was YES. [2022-12-13 06:30:54,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40057 conditions, 733 events. 279/733 cut-off events. For 1479/1479 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4538 event pairs, 0 based on Foata normal form. 2/735 useless extension candidates. Maximal degree in co-relation 18063. Up to 734 conditions per place. [2022-12-13 06:30:54,763 INFO L137 encePairwiseOnDemand]: 7/23 looper letters, 339 selfloop transitions, 91 changer transitions 52/482 dead transitions. [2022-12-13 06:30:54,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 482 transitions, 53055 flow [2022-12-13 06:30:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:30:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:30:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-12-13 06:30:54,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23768115942028986 [2022-12-13 06:30:54,764 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 270 predicate places. [2022-12-13 06:30:54,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 482 transitions, 53055 flow [2022-12-13 06:30:54,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 320 places, 430 transitions, 47221 flow [2022-12-13 06:30:54,793 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:54,793 INFO L89 Accepts]: Start accepts. Operand has 320 places, 430 transitions, 47221 flow [2022-12-13 06:30:54,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:54,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:54,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 430 transitions, 47221 flow [2022-12-13 06:30:54,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 430 transitions, 47221 flow [2022-12-13 06:30:54,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:54,823 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:54,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 06:30:54,824 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 430 transitions, 47221 flow [2022-12-13 06:30:54,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:30:54,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:54,824 INFO L214 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-13 06:30:54,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 06:30:54,824 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash -962544047, now seen corresponding path program 11 times [2022-12-13 06:30:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:54,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070807918] [2022-12-13 06:30:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:55,705 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-13 06:30:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:55,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070807918] [2022-12-13 06:30:55,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070807918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:55,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:55,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:30:55,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887845422] [2022-12-13 06:30:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:55,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:30:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:55,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:30:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:30:55,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:30:55,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 430 transitions, 47221 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:30:55,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:55,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:30:55,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:56,625 INFO L130 PetriNetUnfolder]: 257/674 cut-off events. [2022-12-13 06:30:56,625 INFO L131 PetriNetUnfolder]: For 1284/1284 co-relation queries the response was YES. [2022-12-13 06:30:56,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37482 conditions, 674 events. 257/674 cut-off events. For 1284/1284 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4030 event pairs, 0 based on Foata normal form. 2/676 useless extension candidates. Maximal degree in co-relation 17783. Up to 675 conditions per place. [2022-12-13 06:30:56,633 INFO L137 encePairwiseOnDemand]: 6/23 looper letters, 313 selfloop transitions, 69 changer transitions 59/441 dead transitions. [2022-12-13 06:30:56,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 441 transitions, 49347 flow [2022-12-13 06:30:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:30:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:30:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-12-13 06:30:56,634 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2144927536231884 [2022-12-13 06:30:56,634 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 279 predicate places. [2022-12-13 06:30:56,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 441 transitions, 49347 flow [2022-12-13 06:30:56,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 382 transitions, 42671 flow [2022-12-13 06:30:56,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:56,661 INFO L89 Accepts]: Start accepts. Operand has 319 places, 382 transitions, 42671 flow [2022-12-13 06:30:56,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:56,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:56,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 319 places, 382 transitions, 42671 flow [2022-12-13 06:30:56,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 319 places, 382 transitions, 42671 flow [2022-12-13 06:30:56,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:56,746 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:56,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-13 06:30:56,746 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 382 transitions, 42671 flow [2022-12-13 06:30:56,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:30:56,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:56,747 INFO L214 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-13 06:30:56,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 06:30:56,747 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash 124411926, now seen corresponding path program 2 times [2022-12-13 06:30:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:56,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597484546] [2022-12-13 06:30:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:56,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:57,725 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-13 06:30:57,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:57,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597484546] [2022-12-13 06:30:57,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597484546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:57,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:57,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-13 06:30:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721636185] [2022-12-13 06:30:57,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:57,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 06:30:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:57,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 06:30:57,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-12-13 06:30:57,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:30:57,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 382 transitions, 42671 flow. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-13 06:30:57,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:57,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:30:57,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:58,828 INFO L130 PetriNetUnfolder]: 254/669 cut-off events. [2022-12-13 06:30:58,828 INFO L131 PetriNetUnfolder]: For 1457/1457 co-relation queries the response was YES. [2022-12-13 06:30:58,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37867 conditions, 669 events. 254/669 cut-off events. For 1457/1457 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4025 event pairs, 0 based on Foata normal form. 4/673 useless extension candidates. Maximal degree in co-relation 15591. Up to 670 conditions per place. [2022-12-13 06:30:58,835 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 298 selfloop transitions, 44 changer transitions 96/438 dead transitions. [2022-12-13 06:30:58,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 438 transitions, 49915 flow [2022-12-13 06:30:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:30:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:30:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-12-13 06:30:58,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21739130434782608 [2022-12-13 06:30:58,836 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 277 predicate places. [2022-12-13 06:30:58,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 438 transitions, 49915 flow [2022-12-13 06:30:58,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 329 places, 342 transitions, 38975 flow [2022-12-13 06:30:58,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:58,858 INFO L89 Accepts]: Start accepts. Operand has 329 places, 342 transitions, 38975 flow [2022-12-13 06:30:58,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:58,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:58,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 342 transitions, 38975 flow [2022-12-13 06:30:58,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 342 transitions, 38975 flow [2022-12-13 06:30:58,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:30:58,883 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:58,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 06:30:58,884 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 342 transitions, 38975 flow [2022-12-13 06:30:58,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-13 06:30:58,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:58,884 INFO L214 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-13 06:30:58,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 06:30:58,884 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1730298653, now seen corresponding path program 12 times [2022-12-13 06:30:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:58,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361540208] [2022-12-13 06:30:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:58,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:59,795 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-13 06:30:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:59,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361540208] [2022-12-13 06:30:59,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361540208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:59,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:59,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:30:59,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495555824] [2022-12-13 06:30:59,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:59,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:30:59,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:59,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:30:59,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:30:59,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:30:59,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 342 transitions, 38975 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:30:59,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:59,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:30:59,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:00,720 INFO L130 PetriNetUnfolder]: 209/573 cut-off events. [2022-12-13 06:31:00,720 INFO L131 PetriNetUnfolder]: For 1147/1147 co-relation queries the response was YES. [2022-12-13 06:31:00,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33117 conditions, 573 events. 209/573 cut-off events. For 1147/1147 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3347 event pairs, 0 based on Foata normal form. 2/575 useless extension candidates. Maximal degree in co-relation 15392. Up to 574 conditions per place. [2022-12-13 06:31:00,726 INFO L137 encePairwiseOnDemand]: 7/23 looper letters, 291 selfloop transitions, 43 changer transitions 56/390 dead transitions. [2022-12-13 06:31:00,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 390 transitions, 45359 flow [2022-12-13 06:31:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 06:31:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 06:31:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-12-13 06:31:00,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20380434782608695 [2022-12-13 06:31:00,728 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 289 predicate places. [2022-12-13 06:31:00,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 344 places, 390 transitions, 45359 flow [2022-12-13 06:31:00,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 339 places, 334 transitions, 38773 flow [2022-12-13 06:31:00,749 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:31:00,749 INFO L89 Accepts]: Start accepts. Operand has 339 places, 334 transitions, 38773 flow [2022-12-13 06:31:00,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:31:00,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:00,763 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 334 transitions, 38773 flow [2022-12-13 06:31:00,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 339 places, 334 transitions, 38773 flow [2022-12-13 06:31:00,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:00,773 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:31:00,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 06:31:00,774 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 334 transitions, 38773 flow [2022-12-13 06:31:00,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:31:00,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:31:00,774 INFO L214 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-13 06:31:00,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 06:31:00,774 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:31:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:31:00,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1583091331, now seen corresponding path program 13 times [2022-12-13 06:31:00,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:31:00,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808647172] [2022-12-13 06:31:00,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:31:00,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:31:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:31:01,607 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-13 06:31:01,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:31:01,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808647172] [2022-12-13 06:31:01,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808647172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:31:01,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:31:01,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:31:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968969000] [2022-12-13 06:31:01,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:31:01,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:31:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:31:01,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:31:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:31:01,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:31:01,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 334 transitions, 38773 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:31:01,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:31:01,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:31:01,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:02,492 INFO L130 PetriNetUnfolder]: 187/514 cut-off events. [2022-12-13 06:31:02,492 INFO L131 PetriNetUnfolder]: For 990/990 co-relation queries the response was YES. [2022-12-13 06:31:02,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 514 events. 187/514 cut-off events. For 990/990 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2859 event pairs, 0 based on Foata normal form. 2/516 useless extension candidates. Maximal degree in co-relation 15015. Up to 515 conditions per place. [2022-12-13 06:31:02,499 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 265 selfloop transitions, 17 changer transitions 63/345 dead transitions. [2022-12-13 06:31:02,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 345 transitions, 40773 flow [2022-12-13 06:31:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:31:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:31:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-12-13 06:31:02,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18840579710144928 [2022-12-13 06:31:02,500 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 298 predicate places. [2022-12-13 06:31:02,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 345 transitions, 40773 flow [2022-12-13 06:31:02,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 333 places, 282 transitions, 33275 flow [2022-12-13 06:31:02,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:31:02,521 INFO L89 Accepts]: Start accepts. Operand has 333 places, 282 transitions, 33275 flow [2022-12-13 06:31:02,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:31:02,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:02,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 333 places, 282 transitions, 33275 flow [2022-12-13 06:31:02,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 333 places, 282 transitions, 33275 flow [2022-12-13 06:31:02,546 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:02,547 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:31:02,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 06:31:02,548 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 282 transitions, 33275 flow [2022-12-13 06:31:02,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:31:02,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:31:02,548 INFO L214 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-13 06:31:02,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 06:31:02,548 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:31:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:31:02,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1588656929, now seen corresponding path program 14 times [2022-12-13 06:31:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:31:02,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076399255] [2022-12-13 06:31:02,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:31:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:31:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:31:03,431 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-13 06:31:03,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:31:03,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076399255] [2022-12-13 06:31:03,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076399255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:31:03,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:31:03,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:31:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377105938] [2022-12-13 06:31:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:31:03,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:31:03,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:31:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:31:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:31:03,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:31:03,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 282 transitions, 33275 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:31:03,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:31:03,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:31:03,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:04,325 INFO L130 PetriNetUnfolder]: 214/571 cut-off events. [2022-12-13 06:31:04,325 INFO L131 PetriNetUnfolder]: For 1472/1472 co-relation queries the response was YES. [2022-12-13 06:31:04,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34103 conditions, 571 events. 214/571 cut-off events. For 1472/1472 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3337 event pairs, 9 based on Foata normal form. 2/573 useless extension candidates. Maximal degree in co-relation 13114. Up to 572 conditions per place. [2022-12-13 06:31:04,332 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 263 selfloop transitions, 85 changer transitions 52/400 dead transitions. [2022-12-13 06:31:04,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 400 transitions, 48145 flow [2022-12-13 06:31:04,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:31:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:31:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2022-12-13 06:31:04,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22608695652173913 [2022-12-13 06:31:04,333 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 292 predicate places. [2022-12-13 06:31:04,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 400 transitions, 48145 flow [2022-12-13 06:31:04,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 344 places, 348 transitions, 41861 flow [2022-12-13 06:31:04,356 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:31:04,356 INFO L89 Accepts]: Start accepts. Operand has 344 places, 348 transitions, 41861 flow [2022-12-13 06:31:04,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:31:04,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:04,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 344 places, 348 transitions, 41861 flow [2022-12-13 06:31:04,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 344 places, 348 transitions, 41861 flow [2022-12-13 06:31:04,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:04,384 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:31:04,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 06:31:04,385 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 348 transitions, 41861 flow [2022-12-13 06:31:04,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:31:04,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:31:04,385 INFO L214 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-13 06:31:04,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 06:31:04,385 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:31:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:31:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash -742175615, now seen corresponding path program 15 times [2022-12-13 06:31:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:31:04,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373425988] [2022-12-13 06:31:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:31:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:31:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:31:05,252 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-13 06:31:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:31:05,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373425988] [2022-12-13 06:31:05,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373425988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:31:05,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:31:05,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 06:31:05,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117055547] [2022-12-13 06:31:05,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:31:05,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 06:31:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:31:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 06:31:05,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 06:31:05,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:31:05,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 348 transitions, 41861 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:31:05,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:31:05,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:31:05,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:06,108 INFO L130 PetriNetUnfolder]: 186/527 cut-off events. [2022-12-13 06:31:06,108 INFO L131 PetriNetUnfolder]: For 1411/1411 co-relation queries the response was YES. [2022-12-13 06:31:06,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32038 conditions, 527 events. 186/527 cut-off events. For 1411/1411 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3086 event pairs, 0 based on Foata normal form. 4/531 useless extension candidates. Maximal degree in co-relation 12490. Up to 528 conditions per place. [2022-12-13 06:31:06,114 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 174 selfloop transitions, 29 changer transitions 179/382 dead transitions. [2022-12-13 06:31:06,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 382 transitions, 46794 flow [2022-12-13 06:31:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:31:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:31:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-12-13 06:31:06,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22073578595317725 [2022-12-13 06:31:06,115 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 301 predicate places. [2022-12-13 06:31:06,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 356 places, 382 transitions, 46794 flow [2022-12-13 06:31:06,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 203 transitions, 24961 flow [2022-12-13 06:31:06,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:31:06,133 INFO L89 Accepts]: Start accepts. Operand has 350 places, 203 transitions, 24961 flow [2022-12-13 06:31:06,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:31:06,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:06,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 203 transitions, 24961 flow [2022-12-13 06:31:06,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 203 transitions, 24961 flow [2022-12-13 06:31:06,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:06,152 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:31:06,158 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 06:31:06,158 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 203 transitions, 24961 flow [2022-12-13 06:31:06,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-13 06:31:06,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:31:06,158 INFO L214 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-13 06:31:06,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 06:31:06,158 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:31:06,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:31:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash 607079617, now seen corresponding path program 16 times [2022-12-13 06:31:06,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:31:06,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095460824] [2022-12-13 06:31:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:31:06,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:31:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:31:07,225 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-13 06:31:07,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:31:07,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095460824] [2022-12-13 06:31:07,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095460824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:31:07,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:31:07,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:31:07,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270658958] [2022-12-13 06:31:07,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:31:07,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:31:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:31:07,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:31:07,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:31:07,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:31:07,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 203 transitions, 24961 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:31:07,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:31:07,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:31:07,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:08,039 INFO L130 PetriNetUnfolder]: 97/310 cut-off events. [2022-12-13 06:31:08,039 INFO L131 PetriNetUnfolder]: For 676/676 co-relation queries the response was YES. [2022-12-13 06:31:08,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19326 conditions, 310 events. 97/310 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1494 event pairs, 0 based on Foata normal form. 2/312 useless extension candidates. Maximal degree in co-relation 11394. Up to 311 conditions per place. [2022-12-13 06:31:08,042 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 153 selfloop transitions, 9 changer transitions 66/228 dead transitions. [2022-12-13 06:31:08,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 228 transitions, 28535 flow [2022-12-13 06:31:08,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:31:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:31:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-12-13 06:31:08,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1855072463768116 [2022-12-13 06:31:08,043 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 309 predicate places. [2022-12-13 06:31:08,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 228 transitions, 28535 flow [2022-12-13 06:31:08,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 162 transitions, 20287 flow [2022-12-13 06:31:08,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:31:08,055 INFO L89 Accepts]: Start accepts. Operand has 350 places, 162 transitions, 20287 flow [2022-12-13 06:31:08,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:31:08,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:08,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 162 transitions, 20287 flow [2022-12-13 06:31:08,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 162 transitions, 20287 flow [2022-12-13 06:31:08,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:08,069 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:31:08,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 06:31:08,069 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 162 transitions, 20287 flow [2022-12-13 06:31:08,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:31:08,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:31:08,069 INFO L214 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-13 06:31:08,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 06:31:08,070 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:31:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:31:08,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1492899683, now seen corresponding path program 17 times [2022-12-13 06:31:08,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:31:08,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217355508] [2022-12-13 06:31:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:31:08,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:31:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:31:08,976 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-13 06:31:08,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:31:08,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217355508] [2022-12-13 06:31:08,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217355508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:31:08,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:31:08,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:31:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374232007] [2022-12-13 06:31:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:31:08,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:31:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:31:08,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:31:08,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:31:08,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 06:31:08,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 162 transitions, 20287 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:31:08,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:31:08,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 06:31:08,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:09,664 INFO L130 PetriNetUnfolder]: 72/241 cut-off events. [2022-12-13 06:31:09,664 INFO L131 PetriNetUnfolder]: For 562/562 co-relation queries the response was YES. [2022-12-13 06:31:09,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15291 conditions, 241 events. 72/241 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1066 event pairs, 0 based on Foata normal form. 2/243 useless extension candidates. Maximal degree in co-relation 8002. Up to 242 conditions per place. [2022-12-13 06:31:09,667 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 121 selfloop transitions, 5 changer transitions 47/173 dead transitions. [2022-12-13 06:31:09,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 173 transitions, 22031 flow [2022-12-13 06:31:09,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 06:31:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 06:31:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-12-13 06:31:09,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17971014492753623 [2022-12-13 06:31:09,668 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 309 predicate places. [2022-12-13 06:31:09,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 173 transitions, 22031 flow [2022-12-13 06:31:09,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 329 places, 126 transitions, 16040 flow [2022-12-13 06:31:09,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:31:09,695 INFO L89 Accepts]: Start accepts. Operand has 329 places, 126 transitions, 16040 flow [2022-12-13 06:31:09,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:31:09,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:09,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 126 transitions, 16040 flow [2022-12-13 06:31:09,707 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 126 transitions, 16040 flow [2022-12-13 06:31:09,707 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:09,710 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:31:09,711 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:31:09,712 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:31:09,712 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:31:09,739 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:31:09,740 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:31:09,741 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:31:09,741 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:31:09,843 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:31:09,843 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:31:09,844 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:31:09,845 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:31:10,079 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 06:31:10,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-13 06:31:10,080 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 123 transitions, 15662 flow [2022-12-13 06:31:10,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-13 06:31:10,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:31:10,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:31:10,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 06:31:10,080 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:31:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:31:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1725846199, now seen corresponding path program 1 times [2022-12-13 06:31:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:31:10,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564038801] [2022-12-13 06:31:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:31:10,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:31:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:31:10,875 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-13 06:31:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:31:10,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564038801] [2022-12-13 06:31:10,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564038801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:31:10,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:31:10,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 06:31:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696456514] [2022-12-13 06:31:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:31:10,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 06:31:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:31:10,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 06:31:10,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 06:31:10,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:31:10,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 123 transitions, 15662 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-13 06:31:10,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:31:10,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:31:10,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:11,444 INFO L130 PetriNetUnfolder]: 78/246 cut-off events. [2022-12-13 06:31:11,444 INFO L131 PetriNetUnfolder]: For 701/701 co-relation queries the response was YES. [2022-12-13 06:31:11,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15848 conditions, 246 events. 78/246 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1182 event pairs, 3 based on Foata normal form. 2/248 useless extension candidates. Maximal degree in co-relation 11895. Up to 247 conditions per place. [2022-12-13 06:31:11,447 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 122 selfloop transitions, 36 changer transitions 26/184 dead transitions. [2022-12-13 06:31:11,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 184 transitions, 23781 flow [2022-12-13 06:31:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 06:31:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 06:31:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 67 transitions. [2022-12-13 06:31:11,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21474358974358973 [2022-12-13 06:31:11,448 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 240 predicate places. [2022-12-13 06:31:11,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 184 transitions, 23781 flow [2022-12-13 06:31:11,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 158 transitions, 20393 flow [2022-12-13 06:31:11,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:31:11,458 INFO L89 Accepts]: Start accepts. Operand has 292 places, 158 transitions, 20393 flow [2022-12-13 06:31:11,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:31:11,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:11,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 292 places, 158 transitions, 20393 flow [2022-12-13 06:31:11,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 292 places, 158 transitions, 20393 flow [2022-12-13 06:31:11,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:11,473 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:31:11,473 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 06:31:11,473 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 158 transitions, 20393 flow [2022-12-13 06:31:11,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-13 06:31:11,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:31:11,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:31:11,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 06:31:11,474 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:31:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:31:11,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1810075821, now seen corresponding path program 2 times [2022-12-13 06:31:11,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:31:11,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092843119] [2022-12-13 06:31:11,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:31:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:31:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:31:12,205 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-13 06:31:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:31:12,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092843119] [2022-12-13 06:31:12,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092843119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:31:12,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:31:12,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 06:31:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918292589] [2022-12-13 06:31:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:31:12,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 06:31:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:31:12,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 06:31:12,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 06:31:12,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:31:12,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 158 transitions, 20393 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-13 06:31:12,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:31:12,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:31:12,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:12,746 INFO L130 PetriNetUnfolder]: 63/214 cut-off events. [2022-12-13 06:31:12,746 INFO L131 PetriNetUnfolder]: For 544/544 co-relation queries the response was YES. [2022-12-13 06:31:12,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14011 conditions, 214 events. 63/214 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 991 event pairs, 0 based on Foata normal form. 4/218 useless extension candidates. Maximal degree in co-relation 9931. Up to 215 conditions per place. [2022-12-13 06:31:12,749 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 75 selfloop transitions, 10 changer transitions 83/168 dead transitions. [2022-12-13 06:31:12,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 168 transitions, 22041 flow [2022-12-13 06:31:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 06:31:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 06:31:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-12-13 06:31:12,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20454545454545456 [2022-12-13 06:31:12,753 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 247 predicate places. [2022-12-13 06:31:12,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 168 transitions, 22041 flow [2022-12-13 06:31:12,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 85 transitions, 11186 flow [2022-12-13 06:31:12,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:31:12,761 INFO L89 Accepts]: Start accepts. Operand has 296 places, 85 transitions, 11186 flow [2022-12-13 06:31:12,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:31:12,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:12,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 296 places, 85 transitions, 11186 flow [2022-12-13 06:31:12,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 296 places, 85 transitions, 11186 flow [2022-12-13 06:31:12,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:12,771 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:31:12,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 06:31:12,772 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 85 transitions, 11186 flow [2022-12-13 06:31:12,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-13 06:31:12,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:31:12,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:31:12,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 06:31:12,772 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:31:12,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:31:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1807735995, now seen corresponding path program 3 times [2022-12-13 06:31:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:31:12,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310746918] [2022-12-13 06:31:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:31:12,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:31:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:31:13,626 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-13 06:31:13,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:31:13,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310746918] [2022-12-13 06:31:13,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310746918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:31:13,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:31:13,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 06:31:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599729335] [2022-12-13 06:31:13,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:31:13,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 06:31:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:31:13,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 06:31:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 06:31:13,628 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 06:31:13,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 85 transitions, 11186 flow. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-13 06:31:13,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:31:13,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 06:31:13,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:14,074 INFO L130 PetriNetUnfolder]: 25/98 cut-off events. [2022-12-13 06:31:14,074 INFO L131 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2022-12-13 06:31:14,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6589 conditions, 98 events. 25/98 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 273 event pairs, 0 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 4701. Up to 99 conditions per place. [2022-12-13 06:31:14,076 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 34 selfloop transitions, 3 changer transitions 46/83 dead transitions. [2022-12-13 06:31:14,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 83 transitions, 11088 flow [2022-12-13 06:31:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 06:31:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 06:31:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-12-13 06:31:14,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1736111111111111 [2022-12-13 06:31:14,077 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 252 predicate places. [2022-12-13 06:31:14,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 83 transitions, 11088 flow [2022-12-13 06:31:14,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 37 transitions, 4940 flow [2022-12-13 06:31:14,080 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:31:14,080 INFO L89 Accepts]: Start accepts. Operand has 280 places, 37 transitions, 4940 flow [2022-12-13 06:31:14,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:31:14,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:14,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 37 transitions, 4940 flow [2022-12-13 06:31:14,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 37 transitions, 4940 flow [2022-12-13 06:31:14,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:14,163 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:31:14,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-13 06:31:14,164 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 36 transitions, 4806 flow [2022-12-13 06:31:14,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-13 06:31:14,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:31:14,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:31:14,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 06:31:14,164 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:31:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:31:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash 341976512, now seen corresponding path program 1 times [2022-12-13 06:31:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:31:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847365294] [2022-12-13 06:31:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:31:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:31:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:31:14,995 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-13 06:31:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:31:14,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847365294] [2022-12-13 06:31:14,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847365294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:31:14,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:31:14,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 06:31:14,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789748077] [2022-12-13 06:31:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:31:14,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 06:31:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:31:14,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 06:31:14,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 06:31:14,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 06:31:14,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 36 transitions, 4806 flow. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-13 06:31:14,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:31:14,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 06:31:14,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:31:15,356 INFO L130 PetriNetUnfolder]: 10/39 cut-off events. [2022-12-13 06:31:15,357 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-13 06:31:15,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 39 events. 10/39 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 2284. Up to 40 conditions per place. [2022-12-13 06:31:15,357 INFO L137 encePairwiseOnDemand]: 7/22 looper letters, 0 selfloop transitions, 0 changer transitions 35/35 dead transitions. [2022-12-13 06:31:15,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 35 transitions, 4742 flow [2022-12-13 06:31:15,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:31:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 06:31:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2022-12-13 06:31:15,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.09740259740259741 [2022-12-13 06:31:15,358 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 236 predicate places. [2022-12-13 06:31:15,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 35 transitions, 4742 flow [2022-12-13 06:31:15,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 06:31:15,359 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:31:15,359 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:31:15,359 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:31:15,359 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:31:15,359 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:31:15,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 06:31:15,361 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 06:31:15,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-13 06:31:15,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-13 06:31:15,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-13 06:31:15,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-13 06:31:15,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-13 06:31:15,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-13 06:31:15,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-13 06:31:15,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-13 06:31:15,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-13 06:31:15,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 06:31:15,364 INFO L445 BasicCegarLoop]: Path program histogram: [17, 15, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:31:15,366 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:31:15,366 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:31:15,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:31:15 BasicIcfg [2022-12-13 06:31:15,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:31:15,373 INFO L158 Benchmark]: Toolchain (without parser) took 159120.77ms. Allocated memory was 181.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 153.5MB in the beginning and 1.1GB in the end (delta: -977.4MB). Peak memory consumption was 234.7MB. Max. memory is 8.0GB. [2022-12-13 06:31:15,373 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 157.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:31:15,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1026.78ms. Allocated memory is still 181.4MB. Free memory was 153.5MB in the beginning and 137.0MB in the end (delta: 16.5MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. [2022-12-13 06:31:15,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.93ms. Allocated memory is still 181.4MB. Free memory was 137.0MB in the beginning and 133.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-13 06:31:15,374 INFO L158 Benchmark]: Boogie Preprocessor took 34.10ms. Allocated memory is still 181.4MB. Free memory was 133.3MB in the beginning and 130.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:31:15,374 INFO L158 Benchmark]: RCFGBuilder took 673.40ms. Allocated memory is still 181.4MB. Free memory was 130.7MB in the beginning and 107.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 06:31:15,374 INFO L158 Benchmark]: TraceAbstraction took 157294.07ms. Allocated memory was 181.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 106.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 185.7MB. Max. memory is 8.0GB. [2022-12-13 06:31:15,379 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.10ms. Allocated memory is still 181.4MB. Free memory is still 157.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1026.78ms. Allocated memory is still 181.4MB. Free memory was 153.5MB in the beginning and 137.0MB in the end (delta: 16.5MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.93ms. Allocated memory is still 181.4MB. Free memory was 137.0MB in the beginning and 133.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.10ms. Allocated memory is still 181.4MB. Free memory was 133.3MB in the beginning and 130.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 673.40ms. Allocated memory is still 181.4MB. Free memory was 130.7MB in the beginning and 107.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 157294.07ms. Allocated memory was 181.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 106.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 185.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.1s, 162 PlacesBefore, 55 PlacesAfterwards, 162 TransitionsBefore, 51 TransitionsAfterwards, 2604 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 76 TrivialYvCompositions, 50 ConcurrentYvCompositions, 4 ChoiceCompositions, 134 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 3256, independent unconditional: 0, dependent: 98, dependent conditional: 98, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 0, independent unconditional: 3256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 0, independent unconditional: 3256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 0, independent unconditional: 3256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2059, independent: 2016, independent conditional: 0, independent unconditional: 2016, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2059, independent: 1999, independent conditional: 0, independent unconditional: 1999, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22031, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 21709, unknown conditional: 0, unknown unconditional: 21709] ], Cache Queries: [ total: 3379, independent: 1240, independent conditional: 0, independent unconditional: 1240, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 2074, unknown conditional: 0, unknown unconditional: 2074] , Statistics on independence cache: Total cache size (in pairs): 4165, Positive cache size: 4132, Positive conditional cache size: 0, Positive unconditional cache size: 4132, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 54 PlacesBefore, 53 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 57, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4410, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 4319, unknown conditional: 0, unknown unconditional: 4319] ], Cache Queries: [ total: 160, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 61, unknown conditional: 0, unknown unconditional: 61] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 230 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): 55, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 57 PlacesBefore, 57 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 32 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 147 TransitionsBefore, 147 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 146 TransitionsBefore, 146 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 191 TransitionsBefore, 191 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 77 PlacesBefore, 74 PlacesAfterwards, 167 TransitionsBefore, 166 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 185 TransitionsBefore, 185 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 190 TransitionsBefore, 190 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 173 TransitionsBefore, 173 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 145 TransitionsBefore, 145 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 190 TransitionsBefore, 190 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 259 TransitionsBefore, 259 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 271 TransitionsBefore, 271 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 144 TransitionsBefore, 144 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 112 PlacesBefore, 111 PlacesAfterwards, 155 TransitionsBefore, 154 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 118 PlacesBefore, 118 PlacesAfterwards, 161 TransitionsBefore, 161 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 178 TransitionsBefore, 178 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 137 PlacesBefore, 135 PlacesAfterwards, 171 TransitionsBefore, 169 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 131 PlacesBefore, 131 PlacesAfterwards, 148 TransitionsBefore, 148 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 214 TransitionsBefore, 214 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 148 PlacesBefore, 148 PlacesAfterwards, 244 TransitionsBefore, 244 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 155 PlacesBefore, 155 PlacesAfterwards, 252 TransitionsBefore, 252 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 164 PlacesBefore, 164 PlacesAfterwards, 290 TransitionsBefore, 290 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 170 PlacesBefore, 168 PlacesAfterwards, 277 TransitionsBefore, 276 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 175 PlacesBefore, 175 PlacesAfterwards, 275 TransitionsBefore, 275 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 184 PlacesBefore, 184 PlacesAfterwards, 300 TransitionsBefore, 300 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 193 PlacesBefore, 192 PlacesAfterwards, 305 TransitionsBefore, 304 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 201 PlacesBefore, 201 PlacesAfterwards, 316 TransitionsBefore, 316 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 205 PlacesBefore, 205 PlacesAfterwards, 287 TransitionsBefore, 287 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 211 PlacesBefore, 211 PlacesAfterwards, 297 TransitionsBefore, 297 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 223 PlacesBefore, 222 PlacesAfterwards, 310 TransitionsBefore, 309 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 234 PlacesBefore, 234 PlacesAfterwards, 324 TransitionsBefore, 324 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 246 PlacesBefore, 244 PlacesAfterwards, 327 TransitionsBefore, 325 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 247 PlacesBefore, 247 PlacesAfterwards, 419 TransitionsBefore, 419 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 261 PlacesBefore, 261 PlacesAfterwards, 465 TransitionsBefore, 465 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 269 PlacesBefore, 268 PlacesAfterwards, 465 TransitionsBefore, 464 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 280 PlacesBefore, 280 PlacesAfterwards, 456 TransitionsBefore, 456 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 289 PlacesBefore, 289 PlacesAfterwards, 455 TransitionsBefore, 455 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.9s, 294 PlacesBefore, 271 PlacesAfterwards, 447 TransitionsBefore, 440 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 275 PlacesBefore, 273 PlacesAfterwards, 434 TransitionsBefore, 433 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 286 PlacesBefore, 285 PlacesAfterwards, 435 TransitionsBefore, 434 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 290 PlacesBefore, 290 PlacesAfterwards, 433 TransitionsBefore, 433 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 304 PlacesBefore, 288 PlacesAfterwards, 435 TransitionsBefore, 433 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 288 PlacesBefore, 288 PlacesAfterwards, 527 TransitionsBefore, 527 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 276 PlacesBefore, 276 PlacesAfterwards, 486 TransitionsBefore, 486 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 279 PlacesBefore, 277 PlacesAfterwards, 478 TransitionsBefore, 477 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 285 PlacesBefore, 285 PlacesAfterwards, 476 TransitionsBefore, 476 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 296 PlacesBefore, 296 PlacesAfterwards, 476 TransitionsBefore, 476 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 301 PlacesBefore, 301 PlacesAfterwards, 464 TransitionsBefore, 464 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 311 PlacesBefore, 311 PlacesAfterwards, 434 TransitionsBefore, 434 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 320 PlacesBefore, 320 PlacesAfterwards, 430 TransitionsBefore, 430 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 319 PlacesBefore, 319 PlacesAfterwards, 382 TransitionsBefore, 382 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 329 PlacesBefore, 329 PlacesAfterwards, 342 TransitionsBefore, 342 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 339 PlacesBefore, 339 PlacesAfterwards, 334 TransitionsBefore, 334 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 333 PlacesBefore, 333 PlacesAfterwards, 282 TransitionsBefore, 282 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 344 PlacesBefore, 344 PlacesAfterwards, 348 TransitionsBefore, 348 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 350 PlacesBefore, 350 PlacesAfterwards, 203 TransitionsBefore, 203 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 350 PlacesBefore, 350 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 329 PlacesBefore, 283 PlacesAfterwards, 126 TransitionsBefore, 123 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 292 PlacesBefore, 292 PlacesAfterwards, 158 TransitionsBefore, 158 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 296 PlacesBefore, 296 PlacesAfterwards, 85 TransitionsBefore, 85 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 280 PlacesBefore, 279 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 183 locations, 8 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: 157.1s, OverallIterations: 67, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 47.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 33.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2944 SdHoareTripleChecker+Valid, 19.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2944 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 1514 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29549 IncrementalHoareTripleChecker+Invalid, 31063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1514 mSolverCounterUnsat, 158 mSDtfsCounter, 29549 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1233 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2699 ImplicationChecksByTransitivity, 23.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50529occurred in iteration=48, InterpolantAutomatonStates: 789, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 53.8s InterpolantComputationTime, 1217 NumberOfCodeBlocks, 1217 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 1150 ConstructedInterpolants, 0 QuantifiedInterpolants, 30405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 06:31:15,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...