/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/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:20:19,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:20:19,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:20:19,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:20:19,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:20:19,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:20:19,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:20:19,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:20:19,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:20:19,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:20:19,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:20:19,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:20:19,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:20:19,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:20:19,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:20:19,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:20:19,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:20:19,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:20:19,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:20:19,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:20:19,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:20:19,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:20:19,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:20:19,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:20:19,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:20:19,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:20:19,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:20:19,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:20:19,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:20:19,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:20:19,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:20:19,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:20:19,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:20:19,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:20:19,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:20:19,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:20:19,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:20:19,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:20:19,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:20:19,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:20:19,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:20:19,640 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:20:19,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:20:19,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:20:19,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:20:19,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:20:19,686 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:20:19,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:20:19,687 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:20:19,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:20:19,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:20:19,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:20:19,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:20:19,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:20:19,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:20:19,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:20:19,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:20:19,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:20:19,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:20:19,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:20:19,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:20:19,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:20:19,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:20:19,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:20:19,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:20:19,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:20:19,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:20:19,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:20:19,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:20:19,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:20:19,690 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:20:19,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:20:19,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:20:19,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:20:19,981 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:20:19,981 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:20:19,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 06:20:21,018 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:20:21,249 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:20:21,249 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 06:20:21,264 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2377519bf/877283913724401f916c25a19de9f732/FLAG5ed06ef9c [2022-12-13 06:20:21,278 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2377519bf/877283913724401f916c25a19de9f732 [2022-12-13 06:20:21,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:20:21,281 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:20:21,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:20:21,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:20:21,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:20:21,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a70d6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21, skipping insertion in model container [2022-12-13 06:20:21,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:20:21,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:20:21,467 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-13 06:20:21,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:20:21,646 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:20:21,654 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-13 06:20:21,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:20:21,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:20:21,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:20:21,770 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:20:21,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21 WrapperNode [2022-12-13 06:20:21,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:20:21,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:20:21,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:20:21,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:20:21,777 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:20:21" (1/1) ... [2022-12-13 06:20:21,797 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:20:21" (1/1) ... [2022-12-13 06:20:21,816 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-13 06:20:21,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:20:21,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:20:21,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:20:21,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:20:21,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,850 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:20:21,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:20:21,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:20:21,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:20:21,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (1/1) ... [2022-12-13 06:20:21,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:20:21,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:20:21,887 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:20:21,917 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:20:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:20:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:20:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:20:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:20:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:20:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:20:21,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:20:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:20:21,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:20:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:20:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:20:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:20:21,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:20:21,936 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:20:22,094 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:20:22,095 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:20:22,474 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:20:22,559 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:20:22,565 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:20:22,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:20:22 BoogieIcfgContainer [2022-12-13 06:20:22,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:20:22,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:20:22,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:20:22,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:20:22,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:20:21" (1/3) ... [2022-12-13 06:20:22,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1cafbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:20:22, skipping insertion in model container [2022-12-13 06:20:22,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:20:21" (2/3) ... [2022-12-13 06:20:22,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1cafbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:20:22, skipping insertion in model container [2022-12-13 06:20:22,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:20:22" (3/3) ... [2022-12-13 06:20:22,573 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 06:20:22,585 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:20:22,585 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:20:22,585 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:20:22,623 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:20:22,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 06:20:22,693 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 06:20:22,694 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:20:22,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 06:20:22,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 06:20:22,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-13 06:20:22,702 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:22,717 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 06:20:22,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-13 06:20:22,748 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 06:20:22,749 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:20:22,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 06:20:22,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 06:20:22,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-13 06:20:28,767 INFO L241 LiptonReduction]: Total number of compositions: 72 [2022-12-13 06:20:28,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:20:28,789 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;@40b59bab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:20:28,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 06:20:28,793 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 06:20:28,793 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:20:28,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:28,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 06:20:28,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:28,798 INFO L85 PathProgramCache]: Analyzing trace with hash 475983688, now seen corresponding path program 1 times [2022-12-13 06:20:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:28,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212669257] [2022-12-13 06:20:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:29,070 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:20:29,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:29,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212669257] [2022-12-13 06:20:29,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212669257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:29,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:29,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:20:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107109400] [2022-12-13 06:20:29,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:29,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:20:29,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:29,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:20:29,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:20:29,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 49 [2022-12-13 06:20:29,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:20:29,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:29,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 49 [2022-12-13 06:20:29,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:29,741 INFO L130 PetriNetUnfolder]: 1980/3524 cut-off events. [2022-12-13 06:20:29,741 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 06:20:29,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6715 conditions, 3524 events. 1980/3524 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 23607 event pairs, 150 based on Foata normal form. 0/2038 useless extension candidates. Maximal degree in co-relation 6705. Up to 2839 conditions per place. [2022-12-13 06:20:29,762 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 25 selfloop transitions, 3 changer transitions 40/74 dead transitions. [2022-12-13 06:20:29,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 290 flow [2022-12-13 06:20:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:20:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:20:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-12-13 06:20:29,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2022-12-13 06:20:29,775 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2022-12-13 06:20:29,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 74 transitions, 290 flow [2022-12-13 06:20:29,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 34 transitions, 130 flow [2022-12-13 06:20:29,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:29,795 INFO L89 Accepts]: Start accepts. Operand has 34 places, 34 transitions, 130 flow [2022-12-13 06:20:29,798 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:29,798 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:29,798 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 34 transitions, 130 flow [2022-12-13 06:20:29,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 34 transitions, 130 flow [2022-12-13 06:20:29,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 06:20:29,823 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:29,825 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 06:20:29,825 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 130 flow [2022-12-13 06:20:29,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:20:29,825 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:29,825 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:29,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:20:29,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2141146691, now seen corresponding path program 1 times [2022-12-13 06:20:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:29,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184293663] [2022-12-13 06:20:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:29,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:30,294 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:20:30,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:30,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184293663] [2022-12-13 06:20:30,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184293663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:30,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:30,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:20:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18587505] [2022-12-13 06:20:30,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:30,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:20:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:20:30,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:20:30,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 06:20:30,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:30,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:30,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 06:20:30,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:30,407 INFO L130 PetriNetUnfolder]: 300/552 cut-off events. [2022-12-13 06:20:30,407 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-13 06:20:30,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 552 events. 300/552 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2319 event pairs, 11 based on Foata normal form. 24/492 useless extension candidates. Maximal degree in co-relation 1565. Up to 424 conditions per place. [2022-12-13 06:20:30,410 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-13 06:20:30,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 267 flow [2022-12-13 06:20:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:20:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:20:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 06:20:30,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-13 06:20:30,414 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -19 predicate places. [2022-12-13 06:20:30,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 47 transitions, 267 flow [2022-12-13 06:20:30,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 47 transitions, 267 flow [2022-12-13 06:20:30,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:30,419 INFO L89 Accepts]: Start accepts. Operand has 36 places, 47 transitions, 267 flow [2022-12-13 06:20:30,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:30,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:30,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 47 transitions, 267 flow [2022-12-13 06:20:30,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 47 transitions, 267 flow [2022-12-13 06:20:30,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 06:20:30,423 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:30,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 06:20:30,425 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 47 transitions, 267 flow [2022-12-13 06:20:30,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:30,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:30,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:20:30,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1959452545, now seen corresponding path program 1 times [2022-12-13 06:20:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:30,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639231686] [2022-12-13 06:20:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:30,896 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:20:30,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:30,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639231686] [2022-12-13 06:20:30,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639231686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:30,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:30,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:20:30,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50415827] [2022-12-13 06:20:30,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:30,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:20:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:20:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:20:30,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 06:20:30,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 47 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:20:30,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:30,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 06:20:30,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:31,006 INFO L130 PetriNetUnfolder]: 279/515 cut-off events. [2022-12-13 06:20:31,006 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 06:20:31,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 515 events. 279/515 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2101 event pairs, 24 based on Foata normal form. 12/450 useless extension candidates. Maximal degree in co-relation 1946. Up to 402 conditions per place. [2022-12-13 06:20:31,009 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 46 selfloop transitions, 3 changer transitions 2/56 dead transitions. [2022-12-13 06:20:31,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 423 flow [2022-12-13 06:20:31,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:20:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:20:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 06:20:31,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 06:20:31,011 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -17 predicate places. [2022-12-13 06:20:31,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 56 transitions, 423 flow [2022-12-13 06:20:31,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 54 transitions, 407 flow [2022-12-13 06:20:31,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:31,017 INFO L89 Accepts]: Start accepts. Operand has 37 places, 54 transitions, 407 flow [2022-12-13 06:20:31,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:31,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:31,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 54 transitions, 407 flow [2022-12-13 06:20:31,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 54 transitions, 407 flow [2022-12-13 06:20:31,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-13 06:20:31,893 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:31,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 877 [2022-12-13 06:20:31,894 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 54 transitions, 409 flow [2022-12-13 06:20:31,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:20:31,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:31,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:31,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:20:31,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1838242054, now seen corresponding path program 1 times [2022-12-13 06:20:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:31,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066786264] [2022-12-13 06:20:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:32,433 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:20:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:32,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066786264] [2022-12-13 06:20:32,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066786264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:32,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:32,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:20:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437464860] [2022-12-13 06:20:32,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:32,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:20:32,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:32,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:20:32,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:20:32,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 06:20:32,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 54 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:20:32,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:32,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 06:20:32,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:32,650 INFO L130 PetriNetUnfolder]: 252/474 cut-off events. [2022-12-13 06:20:32,650 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-13 06:20:32,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 474 events. 252/474 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1962 event pairs, 15 based on Foata normal form. 2/423 useless extension candidates. Maximal degree in co-relation 2194. Up to 357 conditions per place. [2022-12-13 06:20:32,653 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 53 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2022-12-13 06:20:32,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 75 transitions, 717 flow [2022-12-13 06:20:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:20:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:20:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-13 06:20:32,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-13 06:20:32,655 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2022-12-13 06:20:32,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 75 transitions, 717 flow [2022-12-13 06:20:32,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 75 transitions, 717 flow [2022-12-13 06:20:32,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:32,662 INFO L89 Accepts]: Start accepts. Operand has 42 places, 75 transitions, 717 flow [2022-12-13 06:20:32,662 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:32,662 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:32,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 75 transitions, 717 flow [2022-12-13 06:20:32,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 75 transitions, 717 flow [2022-12-13 06:20:32,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 06:20:33,266 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:33,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 605 [2022-12-13 06:20:33,267 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 75 transitions, 721 flow [2022-12-13 06:20:33,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:20:33,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:33,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:33,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:20:33,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:33,268 INFO L85 PathProgramCache]: Analyzing trace with hash -73219244, now seen corresponding path program 2 times [2022-12-13 06:20:33,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:33,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003528797] [2022-12-13 06:20:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:33,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:34,075 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:20:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:34,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003528797] [2022-12-13 06:20:34,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003528797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:34,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:34,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:20:34,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022098492] [2022-12-13 06:20:34,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:34,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:20:34,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:20:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:20:34,077 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 06:20:34,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 75 transitions, 721 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:34,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:34,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 06:20:34,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:34,284 INFO L130 PetriNetUnfolder]: 252/476 cut-off events. [2022-12-13 06:20:34,285 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-12-13 06:20:34,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2640 conditions, 476 events. 252/476 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1967 event pairs, 15 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 2618. Up to 358 conditions per place. [2022-12-13 06:20:34,288 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 59 selfloop transitions, 22 changer transitions 0/88 dead transitions. [2022-12-13 06:20:34,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 88 transitions, 1012 flow [2022-12-13 06:20:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:20:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:20:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-13 06:20:34,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-13 06:20:34,290 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -8 predicate places. [2022-12-13 06:20:34,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 88 transitions, 1012 flow [2022-12-13 06:20:34,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 88 transitions, 1012 flow [2022-12-13 06:20:34,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:34,296 INFO L89 Accepts]: Start accepts. Operand has 47 places, 88 transitions, 1012 flow [2022-12-13 06:20:34,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:34,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:34,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 88 transitions, 1012 flow [2022-12-13 06:20:34,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 88 transitions, 1012 flow [2022-12-13 06:20:34,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-13 06:20:34,983 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:34,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 689 [2022-12-13 06:20:34,985 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 88 transitions, 1016 flow [2022-12-13 06:20:34,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:34,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:34,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:34,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:20:34,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:34,986 INFO L85 PathProgramCache]: Analyzing trace with hash 900184768, now seen corresponding path program 3 times [2022-12-13 06:20:34,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:34,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746427382] [2022-12-13 06:20:34,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:34,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:35,664 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:20:35,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:35,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746427382] [2022-12-13 06:20:35,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746427382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:35,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:35,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:20:35,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841958021] [2022-12-13 06:20:35,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:35,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:20:35,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:35,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:20:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:20:35,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 06:20:35,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 88 transitions, 1016 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:35,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:35,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 06:20:35,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:35,876 INFO L130 PetriNetUnfolder]: 287/541 cut-off events. [2022-12-13 06:20:35,876 INFO L131 PetriNetUnfolder]: For 690/690 co-relation queries the response was YES. [2022-12-13 06:20:35,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3460 conditions, 541 events. 287/541 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2369 event pairs, 12 based on Foata normal form. 8/490 useless extension candidates. Maximal degree in co-relation 3435. Up to 408 conditions per place. [2022-12-13 06:20:35,881 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 72 selfloop transitions, 28 changer transitions 0/107 dead transitions. [2022-12-13 06:20:35,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 107 transitions, 1440 flow [2022-12-13 06:20:35,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:20:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:20:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-13 06:20:35,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2022-12-13 06:20:35,883 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2022-12-13 06:20:35,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 107 transitions, 1440 flow [2022-12-13 06:20:35,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 107 transitions, 1440 flow [2022-12-13 06:20:35,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:35,891 INFO L89 Accepts]: Start accepts. Operand has 52 places, 107 transitions, 1440 flow [2022-12-13 06:20:35,892 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:35,892 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:35,892 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 107 transitions, 1440 flow [2022-12-13 06:20:35,894 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 107 transitions, 1440 flow [2022-12-13 06:20:35,895 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 06:20:36,320 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:36,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-13 06:20:36,321 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 107 transitions, 1444 flow [2022-12-13 06:20:36,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:36,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:36,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:36,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:20:36,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash 961852138, now seen corresponding path program 4 times [2022-12-13 06:20:36,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:36,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737411289] [2022-12-13 06:20:36,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:36,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:36,892 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:20:36,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:36,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737411289] [2022-12-13 06:20:36,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737411289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:36,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:36,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:20:36,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924805875] [2022-12-13 06:20:36,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:36,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:20:36,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:36,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:20:36,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:20:36,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 06:20:36,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 107 transitions, 1444 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:36,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:36,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 06:20:36,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:37,147 INFO L130 PetriNetUnfolder]: 316/591 cut-off events. [2022-12-13 06:20:37,147 INFO L131 PetriNetUnfolder]: For 1156/1156 co-relation queries the response was YES. [2022-12-13 06:20:37,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 591 events. 316/591 cut-off events. For 1156/1156 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2658 event pairs, 12 based on Foata normal form. 2/534 useless extension candidates. Maximal degree in co-relation 4257. Up to 449 conditions per place. [2022-12-13 06:20:37,152 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 90 selfloop transitions, 27 changer transitions 0/124 dead transitions. [2022-12-13 06:20:37,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 124 transitions, 1912 flow [2022-12-13 06:20:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 06:20:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 06:20:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-13 06:20:37,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4951923076923077 [2022-12-13 06:20:37,154 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2022-12-13 06:20:37,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 124 transitions, 1912 flow [2022-12-13 06:20:37,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 124 transitions, 1912 flow [2022-12-13 06:20:37,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:37,164 INFO L89 Accepts]: Start accepts. Operand has 59 places, 124 transitions, 1912 flow [2022-12-13 06:20:37,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:37,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:37,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 124 transitions, 1912 flow [2022-12-13 06:20:37,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 124 transitions, 1912 flow [2022-12-13 06:20:37,168 INFO L226 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-13 06:20:37,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:37,620 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 457 [2022-12-13 06:20:37,620 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 124 transitions, 1916 flow [2022-12-13 06:20:37,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:37,620 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:37,620 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:37,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:20:37,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1796346182, now seen corresponding path program 5 times [2022-12-13 06:20:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:37,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381152503] [2022-12-13 06:20:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:37,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:38,009 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:20:38,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:38,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381152503] [2022-12-13 06:20:38,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381152503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:38,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:38,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:20:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842777207] [2022-12-13 06:20:38,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:38,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:20:38,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:38,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:20:38,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:20:38,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 06:20:38,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 124 transitions, 1916 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:20:38,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:38,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 06:20:38,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:38,232 INFO L130 PetriNetUnfolder]: 341/639 cut-off events. [2022-12-13 06:20:38,232 INFO L131 PetriNetUnfolder]: For 1635/1635 co-relation queries the response was YES. [2022-12-13 06:20:38,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5228 conditions, 639 events. 341/639 cut-off events. For 1635/1635 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2995 event pairs, 12 based on Foata normal form. 10/584 useless extension candidates. Maximal degree in co-relation 5197. Up to 497 conditions per place. [2022-12-13 06:20:38,237 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 93 selfloop transitions, 36 changer transitions 0/136 dead transitions. [2022-12-13 06:20:38,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 136 transitions, 2362 flow [2022-12-13 06:20:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:20:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:20:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-13 06:20:38,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5064102564102564 [2022-12-13 06:20:38,239 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2022-12-13 06:20:38,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 136 transitions, 2362 flow [2022-12-13 06:20:38,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 136 transitions, 2362 flow [2022-12-13 06:20:38,250 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:38,250 INFO L89 Accepts]: Start accepts. Operand has 64 places, 136 transitions, 2362 flow [2022-12-13 06:20:38,251 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:38,251 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:38,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 136 transitions, 2362 flow [2022-12-13 06:20:38,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 136 transitions, 2362 flow [2022-12-13 06:20:38,255 INFO L226 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-13 06:20:38,676 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:38,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 427 [2022-12-13 06:20:38,677 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 136 transitions, 2366 flow [2022-12-13 06:20:38,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:20:38,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:38,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:38,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:20:38,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:38,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2074880776, now seen corresponding path program 1 times [2022-12-13 06:20:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:38,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616225933] [2022-12-13 06:20:38,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:38,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:39,651 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:20:39,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:39,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616225933] [2022-12-13 06:20:39,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616225933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:39,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:39,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:20:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326772826] [2022-12-13 06:20:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:39,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:20:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:39,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:20:39,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:20:39,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 06:20:39,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 136 transitions, 2366 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:39,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:39,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 06:20:39,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:39,974 INFO L130 PetriNetUnfolder]: 355/677 cut-off events. [2022-12-13 06:20:39,975 INFO L131 PetriNetUnfolder]: For 2218/2218 co-relation queries the response was YES. [2022-12-13 06:20:39,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6050 conditions, 677 events. 355/677 cut-off events. For 2218/2218 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3305 event pairs, 14 based on Foata normal form. 6/612 useless extension candidates. Maximal degree in co-relation 6016. Up to 520 conditions per place. [2022-12-13 06:20:39,980 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 114 selfloop transitions, 21 changer transitions 0/142 dead transitions. [2022-12-13 06:20:39,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 142 transitions, 2740 flow [2022-12-13 06:20:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:20:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:20:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-13 06:20:39,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2022-12-13 06:20:39,982 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 15 predicate places. [2022-12-13 06:20:39,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 142 transitions, 2740 flow [2022-12-13 06:20:39,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 142 transitions, 2740 flow [2022-12-13 06:20:39,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:39,993 INFO L89 Accepts]: Start accepts. Operand has 70 places, 142 transitions, 2740 flow [2022-12-13 06:20:39,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:39,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:39,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 142 transitions, 2740 flow [2022-12-13 06:20:39,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 142 transitions, 2740 flow [2022-12-13 06:20:39,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-13 06:20:39,999 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:40,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 06:20:40,000 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 142 transitions, 2740 flow [2022-12-13 06:20:40,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:40,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:40,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:40,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:20:40,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:40,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2074888495, now seen corresponding path program 1 times [2022-12-13 06:20:40,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:40,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335412518] [2022-12-13 06:20:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:40,234 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:20:40,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:40,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335412518] [2022-12-13 06:20:40,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335412518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:40,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:40,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:20:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109785493] [2022-12-13 06:20:40,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:40,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:20:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:40,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:20:40,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:20:40,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 06:20:40,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 142 transitions, 2740 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:20:40,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:40,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 06:20:40,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:40,423 INFO L130 PetriNetUnfolder]: 438/865 cut-off events. [2022-12-13 06:20:40,423 INFO L131 PetriNetUnfolder]: For 2802/2802 co-relation queries the response was YES. [2022-12-13 06:20:40,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8514 conditions, 865 events. 438/865 cut-off events. For 2802/2802 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4692 event pairs, 14 based on Foata normal form. 32/793 useless extension candidates. Maximal degree in co-relation 8477. Up to 689 conditions per place. [2022-12-13 06:20:40,428 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 97 selfloop transitions, 19 changer transitions 50/173 dead transitions. [2022-12-13 06:20:40,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 173 transitions, 3692 flow [2022-12-13 06:20:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:20:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:20:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 06:20:40,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.632 [2022-12-13 06:20:40,430 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 19 predicate places. [2022-12-13 06:20:40,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 173 transitions, 3692 flow [2022-12-13 06:20:40,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 123 transitions, 2589 flow [2022-12-13 06:20:40,441 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:40,441 INFO L89 Accepts]: Start accepts. Operand has 73 places, 123 transitions, 2589 flow [2022-12-13 06:20:40,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:40,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:40,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 123 transitions, 2589 flow [2022-12-13 06:20:40,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 123 transitions, 2589 flow [2022-12-13 06:20:40,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 06:20:40,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L844-->L850: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_52 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_175 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_56 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_176 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_56) v_~x$r_buff0_thd0~0_55) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155) v_~x$w_buff1_used~0_154) (= (ite .cse2 v_~x$w_buff0~0_73 (ite .cse1 v_~x$w_buff1~0_76 v_~x~0_136)) v_~x~0_135) (= (ite .cse2 0 v_~x$w_buff0_used~0_176) v_~x$w_buff0_used~0_175) (= v_~x$r_buff1_thd0~0_51 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_52))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x~0=v_~x~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_51, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [421] $Ultimate##0-->L793: Formula: (and (= v_~x$w_buff0~0_172 v_~x$w_buff1~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_307 256) 0)) (not (= (mod v_~x$w_buff1_used~0_273 256) 0)))) 1 0)) (= v_~x$r_buff0_thd2~0_94 1) (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff1_thd0~0_120) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_9| |v_P1Thread1of1ForFork1_~arg#1.base_9|) (= 2 v_~x$w_buff0~0_171) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_9| |v_P1Thread1of1ForFork1_~arg#1.offset_9|) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_95) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0_used~0_307 1) (= v_~x$r_buff0_thd1~0_117 v_~x$r_buff1_thd1~0_117) (= v_~y~0_10 1) (= v_~x$w_buff0_used~0_308 v_~x$w_buff1_used~0_273)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_172, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_9|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_117, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_95, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_308, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_9|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_171, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_117, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_9|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_9|, ~x$w_buff1~0=v_~x$w_buff1~0_163, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_273, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_117, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_94, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_307, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_9|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_9|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~y~0=v_~y~0_10} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-13 06:20:41,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [490] L844-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse0 (and .cse2 (not (= 0 (mod v_~x$w_buff0_used~0_518 256)))))) (let ((.cse1 (ite .cse0 0 v_~x$w_buff0_used~0_518))) (and (= (ite .cse0 v_~x$w_buff0~0_330 (ite (and (not (= (mod v_~x$r_buff1_thd0~0_307 256) 0)) (not (= (mod v_~x$w_buff1_used~0_480 256) 0))) v_~x$w_buff1~0_317 v_~x~0_452)) v_~x~0_451) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_15| |v_P1Thread1of1ForFork1_~arg#1.offset_15|) (= .cse1 v_~x$w_buff1_used~0_478) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_15| |v_P1Thread1of1ForFork1_~arg#1.base_15|) (= v_~x$r_buff0_thd1~0_155 v_~x$r_buff1_thd1~0_155) (= 2 v_~x$w_buff0~0_329) (= v_~x$w_buff0_used~0_516 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$r_buff0_thd2~0_145 v_~x$r_buff1_thd2~0_127) (= v_~y~0_36 1) (= v_~x$r_buff0_thd2~0_144 1) (= v_~x$w_buff0~0_330 v_~x$w_buff1~0_316) (= (ite (and (not (= (mod .cse1 256) 0)) .cse2) 0 v_~x$r_buff0_thd0~0_309) v_~x$r_buff0_thd0~0_308) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_516 256) 0)) (not (= (mod v_~x$w_buff1_used~0_478 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_21|) (= v_~x$r_buff0_thd0~0_308 v_~x$r_buff1_thd0~0_305))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_330, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_155, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_480, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_145, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_307, ~x~0=v_~x~0_452, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_518, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_329, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_155, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_15|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_15|, ~x$w_buff1~0=v_~x$w_buff1~0_316, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_478, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_144, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_305, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_516, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_15|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_15|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_21|, ~y~0=v_~y~0_36, ~x~0=v_~x~0_451} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0] and [456] L850-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd0~0_166 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse3 .cse11)) (.cse12 (= (mod v_~x$w_buff0_used~0_352 256) 0)) (.cse9 (and (= (mod v_~x$w_buff1_used~0_315 256) 0) .cse3))) (let ((.cse6 (or .cse1 .cse12 .cse9)) (.cse7 (and (not .cse12) .cse5))) (let ((.cse8 (ite .cse6 v_~x~0_282 (ite .cse7 v_~x$w_buff0~0_206 v_~x$w_buff1~0_199))) (.cse0 (not (= (mod v_~weak$$choice2~0_130 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_314 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_351 256) 0))) (and (= v_~x$r_buff0_thd0~0_165 (ite .cse0 v_~x$r_buff0_thd0~0_166 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~x$r_buff0_thd0~0_166 (ite (and (not .cse2) .cse5) 0 v_~x$r_buff0_thd0~0_166)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| (mod v_~main$tmp_guard1~0_46 256)) (= v_~weak$$choice0~0_59 |v_ULTIMATE.start_main_#t~nondet11#1_75|) (= v_~x$w_buff0_used~0_351 (ite .cse0 v_~x$w_buff0_used~0_352 (ite .cse6 v_~x$w_buff0_used~0_352 (ite .cse7 0 v_~x$w_buff0_used~0_352)))) (= v_~weak$$choice2~0_130 |v_ULTIMATE.start_main_#t~nondet12#1_71|) (= v_~x$mem_tmp~0_92 v_~x~0_282) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= v_~x$flush_delayed~0_121 0) (= (ite .cse0 v_~x$mem_tmp~0_92 .cse8) v_~x~0_281) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (ite .cse0 v_~x$w_buff1_used~0_315 (ite (or .cse1 .cse2 .cse9) v_~x$w_buff1_used~0_315 0)) v_~x$w_buff1_used~0_314) (= v_~x$w_buff0~0_206 v_~x$w_buff0~0_205) (= v_~x$w_buff1~0_199 v_~x$w_buff1~0_198) (= v_~main$tmp_guard1~0_46 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_54 1) (= .cse8 2) (= v_~__unbuffered_p1_EBX~0_50 0) (= v_~__unbuffered_p1_EAX~0_44 1))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$r_buff1_thd0~0_160 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd0~0_165 256) 0))) (or (and .cse10 .cse11) (and .cse10 .cse4) .cse2)) v_~x$r_buff1_thd0~0_160 0)) v_~x$r_buff1_thd0~0_159)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_206, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_166, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_75|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_199, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_315, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~x~0=v_~x~0_282, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_71|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_352} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_205, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_165, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~x$flush_delayed~0=v_~x$flush_delayed~0_121, ~x$w_buff1~0=v_~x$w_buff1~0_198, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_314, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~x$mem_tmp~0=v_~x$mem_tmp~0_92, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_351, ~weak$$choice0~0=v_~weak$$choice0~0_59, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_281} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0] [2022-12-13 06:20:41,474 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 06:20:41,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1035 [2022-12-13 06:20:41,475 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 123 transitions, 2607 flow [2022-12-13 06:20:41,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:20:41,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:41,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:41,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:20:41,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:41,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2135921605, now seen corresponding path program 2 times [2022-12-13 06:20:41,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:41,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185957831] [2022-12-13 06:20:41,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:41,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:41,816 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:20:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:41,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185957831] [2022-12-13 06:20:41,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185957831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:41,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:41,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:20:41,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660558790] [2022-12-13 06:20:41,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:41,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:20:41,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:20:41,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:20:41,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 06:20:41,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 123 transitions, 2607 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:20:41,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:41,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 06:20:41,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:42,103 INFO L130 PetriNetUnfolder]: 315/693 cut-off events. [2022-12-13 06:20:42,104 INFO L131 PetriNetUnfolder]: For 2479/2479 co-relation queries the response was YES. [2022-12-13 06:20:42,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7250 conditions, 693 events. 315/693 cut-off events. For 2479/2479 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3942 event pairs, 4 based on Foata normal form. 32/621 useless extension candidates. Maximal degree in co-relation 7210. Up to 552 conditions per place. [2022-12-13 06:20:42,108 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 93 selfloop transitions, 40 changer transitions 14/154 dead transitions. [2022-12-13 06:20:42,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 154 transitions, 3567 flow [2022-12-13 06:20:42,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 06:20:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 06:20:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2022-12-13 06:20:42,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4955357142857143 [2022-12-13 06:20:42,109 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2022-12-13 06:20:42,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 154 transitions, 3567 flow [2022-12-13 06:20:42,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 140 transitions, 3229 flow [2022-12-13 06:20:42,119 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:42,119 INFO L89 Accepts]: Start accepts. Operand has 79 places, 140 transitions, 3229 flow [2022-12-13 06:20:42,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:42,120 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:42,120 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 140 transitions, 3229 flow [2022-12-13 06:20:42,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 140 transitions, 3229 flow [2022-12-13 06:20:42,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-13 06:20:42,124 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:42,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:20:42,125 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 140 transitions, 3229 flow [2022-12-13 06:20:42,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:20:42,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:42,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:42,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:20:42,126 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash -7595658, now seen corresponding path program 1 times [2022-12-13 06:20:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:42,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141869734] [2022-12-13 06:20:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:43,018 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:20:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:43,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141869734] [2022-12-13 06:20:43,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141869734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:43,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:43,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:20:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098923695] [2022-12-13 06:20:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:43,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:20:43,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:43,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:20:43,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:20:43,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 06:20:43,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 140 transitions, 3229 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:43,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:43,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 06:20:43,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:43,268 INFO L130 PetriNetUnfolder]: 274/591 cut-off events. [2022-12-13 06:20:43,269 INFO L131 PetriNetUnfolder]: For 2858/2858 co-relation queries the response was YES. [2022-12-13 06:20:43,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 591 events. 274/591 cut-off events. For 2858/2858 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3096 event pairs, 4 based on Foata normal form. 6/520 useless extension candidates. Maximal degree in co-relation 6561. Up to 457 conditions per place. [2022-12-13 06:20:43,272 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 112 selfloop transitions, 31 changer transitions 0/150 dead transitions. [2022-12-13 06:20:43,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 150 transitions, 3755 flow [2022-12-13 06:20:43,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:20:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:20:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-13 06:20:43,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2022-12-13 06:20:43,275 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2022-12-13 06:20:43,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 150 transitions, 3755 flow [2022-12-13 06:20:43,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 150 transitions, 3755 flow [2022-12-13 06:20:43,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:43,283 INFO L89 Accepts]: Start accepts. Operand has 85 places, 150 transitions, 3755 flow [2022-12-13 06:20:43,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:43,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:43,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 150 transitions, 3755 flow [2022-12-13 06:20:43,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 150 transitions, 3755 flow [2022-12-13 06:20:43,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 06:20:43,288 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:43,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 06:20:43,290 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 150 transitions, 3755 flow [2022-12-13 06:20:43,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:43,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:43,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:43,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 06:20:43,290 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:43,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1904092812, now seen corresponding path program 2 times [2022-12-13 06:20:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:43,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366321147] [2022-12-13 06:20:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:43,915 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:20:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:43,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366321147] [2022-12-13 06:20:43,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366321147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:43,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:43,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:20:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482906863] [2022-12-13 06:20:43,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:43,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:20:43,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:43,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:20:43,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:20:43,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 06:20:43,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 150 transitions, 3755 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:43,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:43,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 06:20:43,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:44,150 INFO L130 PetriNetUnfolder]: 277/595 cut-off events. [2022-12-13 06:20:44,151 INFO L131 PetriNetUnfolder]: For 3446/3446 co-relation queries the response was YES. [2022-12-13 06:20:44,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7124 conditions, 595 events. 277/595 cut-off events. For 3446/3446 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3112 event pairs, 4 based on Foata normal form. 12/534 useless extension candidates. Maximal degree in co-relation 7078. Up to 459 conditions per place. [2022-12-13 06:20:44,155 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 139 selfloop transitions, 24 changer transitions 0/170 dead transitions. [2022-12-13 06:20:44,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 170 transitions, 4601 flow [2022-12-13 06:20:44,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:20:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:20:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2022-12-13 06:20:44,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5314285714285715 [2022-12-13 06:20:44,157 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2022-12-13 06:20:44,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 170 transitions, 4601 flow [2022-12-13 06:20:44,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 170 transitions, 4601 flow [2022-12-13 06:20:44,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:44,167 INFO L89 Accepts]: Start accepts. Operand has 91 places, 170 transitions, 4601 flow [2022-12-13 06:20:44,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:44,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:44,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 170 transitions, 4601 flow [2022-12-13 06:20:44,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 170 transitions, 4601 flow [2022-12-13 06:20:44,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-13 06:20:44,196 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_332 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_332, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [364] L812-->L819: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_52 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_59 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_191 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_192 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_171 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_192) v_~x$w_buff0_used~0_191) (= v_~x$w_buff1_used~0_170 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_171)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_170 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_58 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_52) v_~x$r_buff1_thd2~0_51) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_59) v_~x$r_buff0_thd2~0_58) (= (ite .cse0 v_~x$w_buff0~0_85 (ite .cse2 v_~x$w_buff1~0_88 v_~x~0_156)) v_~x~0_155)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_171, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~x~0=v_~x~0_156, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_170, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_58, ~x~0=v_~x~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 06:20:44,335 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:44,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 06:20:44,335 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 169 transitions, 4575 flow [2022-12-13 06:20:44,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:44,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:44,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:44,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 06:20:44,336 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:44,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2127725685, now seen corresponding path program 1 times [2022-12-13 06:20:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:44,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663520916] [2022-12-13 06:20:44,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:44,868 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:20:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663520916] [2022-12-13 06:20:44,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663520916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:44,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:44,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:20:44,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48433260] [2022-12-13 06:20:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:44,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:20:44,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:44,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:20:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:20:44,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 06:20:44,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 169 transitions, 4575 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:20:44,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:44,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 06:20:44,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:45,030 INFO L130 PetriNetUnfolder]: 267/576 cut-off events. [2022-12-13 06:20:45,030 INFO L131 PetriNetUnfolder]: For 4089/4089 co-relation queries the response was YES. [2022-12-13 06:20:45,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7360 conditions, 576 events. 267/576 cut-off events. For 4089/4089 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3004 event pairs, 4 based on Foata normal form. 6/511 useless extension candidates. Maximal degree in co-relation 7311. Up to 442 conditions per place. [2022-12-13 06:20:45,034 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 127 selfloop transitions, 30 changer transitions 0/164 dead transitions. [2022-12-13 06:20:45,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 164 transitions, 4749 flow [2022-12-13 06:20:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:20:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:20:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-13 06:20:45,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2022-12-13 06:20:45,036 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places. [2022-12-13 06:20:45,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 164 transitions, 4749 flow [2022-12-13 06:20:45,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 164 transitions, 4749 flow [2022-12-13 06:20:45,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:45,047 INFO L89 Accepts]: Start accepts. Operand has 95 places, 164 transitions, 4749 flow [2022-12-13 06:20:45,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:45,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:45,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 164 transitions, 4749 flow [2022-12-13 06:20:45,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 164 transitions, 4749 flow [2022-12-13 06:20:45,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 06:20:45,052 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:45,053 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 06:20:45,053 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 164 transitions, 4749 flow [2022-12-13 06:20:45,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:20:45,053 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:45,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:45,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 06:20:45,054 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:45,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1230892307, now seen corresponding path program 1 times [2022-12-13 06:20:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:45,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313395526] [2022-12-13 06:20:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:45,309 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:20:45,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:45,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313395526] [2022-12-13 06:20:45,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313395526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:45,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:45,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:20:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757827936] [2022-12-13 06:20:45,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:45,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:20:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:45,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:20:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:20:45,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 06:20:45,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 164 transitions, 4749 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:20:45,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:45,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 06:20:45,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:45,515 INFO L130 PetriNetUnfolder]: 306/682 cut-off events. [2022-12-13 06:20:45,516 INFO L131 PetriNetUnfolder]: For 4956/4956 co-relation queries the response was YES. [2022-12-13 06:20:45,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9353 conditions, 682 events. 306/682 cut-off events. For 4956/4956 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3834 event pairs, 10 based on Foata normal form. 27/612 useless extension candidates. Maximal degree in co-relation 9301. Up to 536 conditions per place. [2022-12-13 06:20:45,520 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 102 selfloop transitions, 22 changer transitions 62/193 dead transitions. [2022-12-13 06:20:45,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 193 transitions, 5991 flow [2022-12-13 06:20:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:20:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:20:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-13 06:20:45,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2022-12-13 06:20:45,522 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 45 predicate places. [2022-12-13 06:20:45,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 193 transitions, 5991 flow [2022-12-13 06:20:45,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 131 transitions, 4002 flow [2022-12-13 06:20:45,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:45,534 INFO L89 Accepts]: Start accepts. Operand has 94 places, 131 transitions, 4002 flow [2022-12-13 06:20:45,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:45,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:45,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 131 transitions, 4002 flow [2022-12-13 06:20:45,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 131 transitions, 4002 flow [2022-12-13 06:20:45,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-13 06:20:45,539 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:45,540 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:20:45,540 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 131 transitions, 4002 flow [2022-12-13 06:20:45,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:20:45,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:45,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:45,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 06:20:45,540 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:45,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1290403701, now seen corresponding path program 1 times [2022-12-13 06:20:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:45,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229476374] [2022-12-13 06:20:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:45,986 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:20:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229476374] [2022-12-13 06:20:45,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229476374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:45,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:45,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:20:45,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133620897] [2022-12-13 06:20:45,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:45,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:20:45,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:20:45,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:20:45,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-13 06:20:45,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 131 transitions, 4002 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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:20:45,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:45,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-13 06:20:45,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:46,169 INFO L130 PetriNetUnfolder]: 275/545 cut-off events. [2022-12-13 06:20:46,170 INFO L131 PetriNetUnfolder]: For 7534/7534 co-relation queries the response was YES. [2022-12-13 06:20:46,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7526 conditions, 545 events. 275/545 cut-off events. For 7534/7534 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2489 event pairs, 46 based on Foata normal form. 19/484 useless extension candidates. Maximal degree in co-relation 7471. Up to 412 conditions per place. [2022-12-13 06:20:46,173 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 80 selfloop transitions, 19 changer transitions 31/134 dead transitions. [2022-12-13 06:20:46,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 134 transitions, 4236 flow [2022-12-13 06:20:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 06:20:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 06:20:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-12-13 06:20:46,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.415 [2022-12-13 06:20:46,176 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 46 predicate places. [2022-12-13 06:20:46,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 134 transitions, 4236 flow [2022-12-13 06:20:46,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 103 transitions, 3271 flow [2022-12-13 06:20:46,182 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:46,182 INFO L89 Accepts]: Start accepts. Operand has 94 places, 103 transitions, 3271 flow [2022-12-13 06:20:46,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:46,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:46,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 103 transitions, 3271 flow [2022-12-13 06:20:46,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 103 transitions, 3271 flow [2022-12-13 06:20:46,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 06:20:46,186 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:46,187 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 06:20:46,187 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 103 transitions, 3271 flow [2022-12-13 06:20:46,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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:20:46,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:46,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:46,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 06:20:46,187 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash -748538905, now seen corresponding path program 2 times [2022-12-13 06:20:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:46,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101123474] [2022-12-13 06:20:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:46,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:20:46,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:46,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101123474] [2022-12-13 06:20:46,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101123474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:46,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:46,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 06:20:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767480955] [2022-12-13 06:20:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:46,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 06:20:46,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:46,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 06:20:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 06:20:46,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 06:20:46,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 103 transitions, 3271 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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:20:46,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:46,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 06:20:46,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:47,034 INFO L130 PetriNetUnfolder]: 188/390 cut-off events. [2022-12-13 06:20:47,034 INFO L131 PetriNetUnfolder]: For 6979/6979 co-relation queries the response was YES. [2022-12-13 06:20:47,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5679 conditions, 390 events. 188/390 cut-off events. For 6979/6979 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1703 event pairs, 30 based on Foata normal form. 32/364 useless extension candidates. Maximal degree in co-relation 5621. Up to 311 conditions per place. [2022-12-13 06:20:47,036 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 34 selfloop transitions, 14 changer transitions 50/104 dead transitions. [2022-12-13 06:20:47,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 104 transitions, 3497 flow [2022-12-13 06:20:47,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 06:20:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 06:20:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-12-13 06:20:47,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-13 06:20:47,038 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2022-12-13 06:20:47,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 104 transitions, 3497 flow [2022-12-13 06:20:47,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 54 transitions, 1758 flow [2022-12-13 06:20:47,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:47,042 INFO L89 Accepts]: Start accepts. Operand has 92 places, 54 transitions, 1758 flow [2022-12-13 06:20:47,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:47,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:47,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 54 transitions, 1758 flow [2022-12-13 06:20:47,044 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 54 transitions, 1758 flow [2022-12-13 06:20:47,044 INFO L226 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-13 06:20:47,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_66 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd1~0_68 256))))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_151 256) 0)) .cse2))) (and (= v_~x$r_buff0_thd1~0_67 (ite .cse0 0 v_~x$r_buff0_thd1~0_68)) (= v_~x$r_buff1_thd1~0_65 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_67 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_150 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_66)) (= v_~x$w_buff1_used~0_150 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_151)) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172)) (= (ite .cse4 v_~x$w_buff0~0_71 (ite .cse3 v_~x$w_buff1~0_74 v_~x~0_128)) v_~x~0_127)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_151, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_66, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_65, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [363] L796-->L812: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd2~0_56 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_63 256) 0))) (let ((.cse10 (not .cse9)) (.cse1 (and .cse9 .cse8)) (.cse2 (and (= (mod v_~x$w_buff1_used~0_181 256) 0) .cse9)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse4 (or .cse1 .cse2 .cse11)) (.cse5 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_52 v_~__unbuffered_p1_EBX~0_22) v_~x~0_163) (= v_~x$w_buff0~0_96 v_~x$w_buff0~0_95) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_19) (= v_~x$mem_tmp~0_52 v_~x~0_165) (= (ite .cse0 v_~x$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_181 0)) v_~x$w_buff1_used~0_180) (= v_~x$w_buff1~0_97 v_~x$w_buff1~0_96) (= v_~x$w_buff0_used~0_203 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse4 v_~x$w_buff0_used~0_204 (ite .cse5 0 v_~x$w_buff0_used~0_204)))) (= v_~x$r_buff1_thd2~0_55 (ite .cse0 v_~x$r_buff1_thd2~0_56 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (or (and .cse6 .cse7) (and .cse6 .cse8) .cse3)) v_~x$r_buff1_thd2~0_56 0))) (= v_~__unbuffered_p1_EBX~0_22 (ite .cse4 v_~x~0_165 (ite .cse5 v_~x$w_buff0~0_96 v_~x$w_buff1~0_97))) (= v_~x$r_buff0_thd2~0_62 (ite .cse0 v_~x$r_buff0_thd2~0_63 (ite (or .cse1 .cse3 (and .cse7 .cse9)) v_~x$r_buff0_thd2~0_63 (ite (and (not .cse3) .cse10) 0 v_~x$r_buff0_thd2~0_63)))) (= v_~x$flush_delayed~0_81 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_181, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_165, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~x$flush_delayed~0=v_~x$flush_delayed~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_96, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, ~x$mem_tmp~0=v_~x$mem_tmp~0_52, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] [2022-12-13 06:20:47,459 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:47,459 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 417 [2022-12-13 06:20:47,459 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 54 transitions, 1760 flow [2022-12-13 06:20:47,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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:20:47,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:47,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:47,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 06:20:47,460 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:47,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash -838088487, now seen corresponding path program 1 times [2022-12-13 06:20:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:47,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039757822] [2022-12-13 06:20:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:47,790 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:20:47,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:47,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039757822] [2022-12-13 06:20:47,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039757822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:47,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:47,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:20:47,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669274972] [2022-12-13 06:20:47,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:47,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:20:47,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:47,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:20:47,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:20:47,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-13 06:20:47,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 54 transitions, 1760 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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:20:47,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:47,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-13 06:20:47,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:47,904 INFO L130 PetriNetUnfolder]: 89/197 cut-off events. [2022-12-13 06:20:47,904 INFO L131 PetriNetUnfolder]: For 3844/3844 co-relation queries the response was YES. [2022-12-13 06:20:47,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 197 events. 89/197 cut-off events. For 3844/3844 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 747 event pairs, 31 based on Foata normal form. 20/183 useless extension candidates. Maximal degree in co-relation 3032. Up to 167 conditions per place. [2022-12-13 06:20:47,905 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 34 selfloop transitions, 8 changer transitions 13/61 dead transitions. [2022-12-13 06:20:47,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 61 transitions, 2122 flow [2022-12-13 06:20:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:20:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:20:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-12-13 06:20:47,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-13 06:20:47,906 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 42 predicate places. [2022-12-13 06:20:47,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 61 transitions, 2122 flow [2022-12-13 06:20:47,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 48 transitions, 1628 flow [2022-12-13 06:20:47,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:47,909 INFO L89 Accepts]: Start accepts. Operand has 96 places, 48 transitions, 1628 flow [2022-12-13 06:20:47,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:47,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:47,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 48 transitions, 1628 flow [2022-12-13 06:20:47,912 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 48 transitions, 1628 flow [2022-12-13 06:20:47,912 INFO L226 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-13 06:20:48,113 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_66 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd1~0_68 256))))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_151 256) 0)) .cse2))) (and (= v_~x$r_buff0_thd1~0_67 (ite .cse0 0 v_~x$r_buff0_thd1~0_68)) (= v_~x$r_buff1_thd1~0_65 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_67 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_150 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_66)) (= v_~x$w_buff1_used~0_150 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_151)) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172)) (= (ite .cse4 v_~x$w_buff0~0_71 (ite .cse3 v_~x$w_buff1~0_74 v_~x~0_128)) v_~x~0_127)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_151, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_66, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_65, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [495] L793-->L812: Formula: (let ((.cse1 (= (mod v_~x$r_buff1_thd2~0_140 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_161 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse9 .cse1)) (.cse6 (and .cse9 (= (mod v_~x$w_buff1_used~0_505 256) 0))) (.cse11 (= (mod v_~x$w_buff0_used~0_543 256) 0))) (let ((.cse3 (= (mod v_~x$w_buff1_used~0_504 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_542 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_190 256) 0))) (.cse7 (or .cse5 .cse6 .cse11)) (.cse8 (and .cse10 (not .cse11)))) (and (= v_~x~0_475 (ite .cse0 v_~x$mem_tmp~0_154 v_~__unbuffered_p1_EBX~0_112)) (= v_~x$r_buff1_thd2~0_139 (ite .cse0 v_~x$r_buff1_thd2~0_140 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd2~0_160 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~x$r_buff1_thd2~0_140 0))) (= v_~weak$$choice2~0_190 |v_P1Thread1of1ForFork1_#t~nondet6#1_26|) (= v_~weak$$choice0~0_119 |v_P1Thread1of1ForFork1_#t~nondet5#1_26|) (= (ite .cse0 v_~x$w_buff1_used~0_505 (ite (or .cse5 .cse6 .cse4) v_~x$w_buff1_used~0_505 0)) v_~x$w_buff1_used~0_504) (= (ite .cse7 v_~x~0_476 (ite .cse8 v_~x$w_buff0~0_348 v_~x$w_buff1~0_335)) v_~__unbuffered_p1_EBX~0_112) (= (ite .cse0 v_~x$r_buff0_thd2~0_161 (ite (or .cse5 (and .cse9 .cse3) .cse4) v_~x$r_buff0_thd2~0_161 (ite (and (not .cse4) .cse10) 0 v_~x$r_buff0_thd2~0_161))) v_~x$r_buff0_thd2~0_160) (= v_~x$flush_delayed~0_183 0) (= v_~x~0_476 v_~x$mem_tmp~0_154) (= v_~x$w_buff1~0_335 v_~x$w_buff1~0_334) (= (ite .cse0 v_~x$w_buff0_used~0_543 (ite .cse7 v_~x$w_buff0_used~0_543 (ite .cse8 0 v_~x$w_buff0_used~0_543))) v_~x$w_buff0_used~0_542) (= v_~y~0_40 v_~__unbuffered_p1_EAX~0_93) (= v_~x$w_buff0~0_348 v_~x$w_buff0~0_347))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_348, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_26|, ~x$w_buff1~0=v_~x$w_buff1~0_335, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_140, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_505, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_26|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_161, ~y~0=v_~y~0_40, ~x~0=v_~x~0_476, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_543} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_347, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_112, ~x$flush_delayed~0=v_~x$flush_delayed~0_183, ~x$w_buff1~0=v_~x$w_buff1~0_334, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_139, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$mem_tmp~0=v_~x$mem_tmp~0_154, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_160, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_542, ~weak$$choice0~0=v_~weak$$choice0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_190, ~y~0=v_~y~0_40, ~x~0=v_~x~0_475} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~x~0] [2022-12-13 06:20:48,335 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:20:48,336 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 427 [2022-12-13 06:20:48,336 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 47 transitions, 1592 flow [2022-12-13 06:20:48,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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:20:48,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:48,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:48,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 06:20:48,337 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash -551201467, now seen corresponding path program 1 times [2022-12-13 06:20:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:48,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389318886] [2022-12-13 06:20:48,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:48,571 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:20:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:48,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389318886] [2022-12-13 06:20:48,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389318886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:48,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:48,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:20:48,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994273129] [2022-12-13 06:20:48,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:48,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:20:48,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:20:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:20:48,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-13 06:20:48,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 47 transitions, 1592 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:48,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:48,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-13 06:20:48,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:48,586 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 06:20:48,586 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-13 06:20:48,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 7 events. 0/7 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 2 event pairs, 0 based on Foata normal form. 2/9 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-13 06:20:48,586 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 0 selfloop transitions, 0 changer transitions 7/7 dead transitions. [2022-12-13 06:20:48,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 7 transitions, 214 flow [2022-12-13 06:20:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:20:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:20:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-12-13 06:20:48,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14583333333333334 [2022-12-13 06:20:48,588 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2022-12-13 06:20:48,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 7 transitions, 214 flow [2022-12-13 06:20:48,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 06:20:48,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:48,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:20:48,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:20:48,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:20:48,590 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:48,591 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 06:20:48,591 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 06:20:48,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:20:48,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 06:20:48,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 06:20:48,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 06:20:48,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 06:20:48,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 06:20:48,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 06:20:48,594 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:48,597 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:20:48,597 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:20:48,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:20:48 BasicIcfg [2022-12-13 06:20:48,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:20:48,600 INFO L158 Benchmark]: Toolchain (without parser) took 27319.88ms. Allocated memory was 238.0MB in the beginning and 1.1GB in the end (delta: 816.8MB). Free memory was 203.1MB in the beginning and 844.1MB in the end (delta: -641.0MB). Peak memory consumption was 176.9MB. Max. memory is 8.0GB. [2022-12-13 06:20:48,601 INFO L158 Benchmark]: CDTParser took 4.66ms. Allocated memory is still 238.0MB. Free memory is still 215.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:20:48,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.53ms. Allocated memory is still 238.0MB. Free memory was 203.1MB in the beginning and 174.7MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 06:20:48,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.67ms. Allocated memory is still 238.0MB. Free memory was 174.7MB in the beginning and 171.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:20:48,601 INFO L158 Benchmark]: Boogie Preprocessor took 47.17ms. Allocated memory is still 238.0MB. Free memory was 171.7MB in the beginning and 169.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:20:48,601 INFO L158 Benchmark]: RCFGBuilder took 702.34ms. Allocated memory is still 238.0MB. Free memory was 169.6MB in the beginning and 187.4MB in the end (delta: -17.8MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. [2022-12-13 06:20:48,602 INFO L158 Benchmark]: TraceAbstraction took 26031.37ms. Allocated memory was 238.0MB in the beginning and 1.1GB in the end (delta: 816.8MB). Free memory was 186.3MB in the beginning and 844.1MB in the end (delta: -657.8MB). Peak memory consumption was 159.6MB. Max. memory is 8.0GB. [2022-12-13 06:20:48,603 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.66ms. Allocated memory is still 238.0MB. Free memory is still 215.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 488.53ms. Allocated memory is still 238.0MB. Free memory was 203.1MB in the beginning and 174.7MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.67ms. Allocated memory is still 238.0MB. Free memory was 174.7MB in the beginning and 171.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.17ms. Allocated memory is still 238.0MB. Free memory was 171.7MB in the beginning and 169.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 702.34ms. Allocated memory is still 238.0MB. Free memory was 169.6MB in the beginning and 187.4MB in the end (delta: -17.8MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. * TraceAbstraction took 26031.37ms. Allocated memory was 238.0MB in the beginning and 1.1GB in the end (delta: 816.8MB). Free memory was 186.3MB in the beginning and 844.1MB in the end (delta: -657.8MB). Peak memory consumption was 159.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 95 PlacesBefore, 55 PlacesAfterwards, 90 TransitionsBefore, 49 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 33 ConcurrentYvCompositions, 2 ChoiceCompositions, 72 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2157, independent: 2053, independent conditional: 2053, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2157, independent: 2053, independent conditional: 0, independent unconditional: 2053, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2157, independent: 2053, independent conditional: 0, independent unconditional: 2053, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2157, independent: 2053, independent conditional: 0, independent unconditional: 2053, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1208, independent: 1173, independent conditional: 0, independent unconditional: 1173, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1208, independent: 1163, independent conditional: 0, independent unconditional: 1163, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 249, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 239, dependent conditional: 0, dependent unconditional: 239, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2157, independent: 880, independent conditional: 0, independent unconditional: 880, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 1208, unknown conditional: 0, unknown unconditional: 1208] , Statistics on independence cache: Total cache size (in pairs): 2285, Positive cache size: 2250, Positive conditional cache size: 0, Positive unconditional cache size: 2250, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 168 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): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 37 PlacesBefore, 37 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 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): 7, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 42 PlacesBefore, 42 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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): 7, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 47 PlacesBefore, 47 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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): 7, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 52 PlacesBefore, 52 PlacesAfterwards, 107 TransitionsBefore, 107 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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): 7, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 59 PlacesBefore, 59 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, 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): 7, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 64 PlacesBefore, 64 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 7, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 306 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): 7, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 73 PlacesBefore, 73 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 260 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): 8, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 150 TransitionsBefore, 150 TransitionsAfterwards, 270 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): 8, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 91 PlacesBefore, 90 PlacesAfterwards, 170 TransitionsBefore, 169 TransitionsAfterwards, 292 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): 8, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 164 TransitionsBefore, 164 TransitionsAfterwards, 286 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): 8, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 198 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): 8, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 88 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): 8, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 92 PlacesBefore, 92 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 96 PlacesBefore, 95 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 1, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - 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): 9, Positive cache size: 8, Positive conditional cache size: 1, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 5 procedures, 113 locations, 5 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: 25.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 492 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1739 IncrementalHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 5 mSDtfsCounter, 1739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4749occurred in iteration=14, InterpolantAutomatonStates: 115, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 3063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 06:20:48,649 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...