/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:58:44,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:58:44,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:58:44,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:58:44,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:58:44,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:58:44,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:58:44,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:58:44,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:58:44,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:58:44,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:58:44,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:58:44,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:58:44,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:58:44,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:58:44,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:58:44,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:58:44,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:58:44,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:58:44,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:58:44,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:58:44,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:58:44,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:58:44,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:58:44,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:58:44,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:58:44,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:58:44,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:58:44,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:58:44,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:58:44,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:58:44,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:58:44,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:58:44,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:58:44,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:58:44,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:58:44,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:58:44,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:58:44,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:58:44,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:58:44,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:58:44,423 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-05 22:58:44,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:58:44,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:58:44,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:58:44,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:58:44,460 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:58:44,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:58:44,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:58:44,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:58:44,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:58:44,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:58:44,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:58:44,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:58:44,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:58:44,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:58:44,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:58:44,463 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:58:44,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:58:44,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:58:44,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:58:44,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:58:44,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:58:44,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:58:44,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:58:44,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:58:44,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:58:44,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:58:44,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:58:44,465 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:58:44,465 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 [2022-12-05 22:58:44,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:58:44,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:58:44,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:58:44,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:58:44,820 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:58:44,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2022-12-05 22:58:45,849 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:58:46,114 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:58:46,115 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2022-12-05 22:58:46,128 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf2f41bd/5979c472c59e464ca83263a4a6dd68bb/FLAG4c106cd03 [2022-12-05 22:58:46,141 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf2f41bd/5979c472c59e464ca83263a4a6dd68bb [2022-12-05 22:58:46,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:58:46,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:58:46,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:58:46,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:58:46,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:58:46,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14dbb53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46, skipping insertion in model container [2022-12-05 22:58:46,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:58:46,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:58:46,374 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/mix030_tso.i[944,957] [2022-12-05 22:58:46,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:58:46,629 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:58:46,640 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/mix030_tso.i[944,957] [2022-12-05 22:58:46,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:58:46,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:58:46,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:58:46,756 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:58:46,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46 WrapperNode [2022-12-05 22:58:46,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:58:46,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:58:46,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:58:46,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:58:46,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,826 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-12-05 22:58:46,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:58:46,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:58:46,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:58:46,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:58:46,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,884 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:58:46,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:58:46,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:58:46,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:58:46,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (1/1) ... [2022-12-05 22:58:46,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:58:46,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:58:46,924 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-05 22:58:46,937 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-05 22:58:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:58:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:58:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:58:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:58:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:58:46,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:58:46,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:58:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:58:46,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:58:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:58:46,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:58:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 22:58:46,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 22:58:46,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:58:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:58:46,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:58:46,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:58:46,969 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:58:47,159 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:58:47,161 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:58:47,547 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:58:47,676 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:58:47,676 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:58:47,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:58:47 BoogieIcfgContainer [2022-12-05 22:58:47,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:58:47,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:58:47,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:58:47,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:58:47,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:58:46" (1/3) ... [2022-12-05 22:58:47,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344114af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:58:47, skipping insertion in model container [2022-12-05 22:58:47,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:58:46" (2/3) ... [2022-12-05 22:58:47,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344114af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:58:47, skipping insertion in model container [2022-12-05 22:58:47,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:58:47" (3/3) ... [2022-12-05 22:58:47,685 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2022-12-05 22:58:47,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:58:47,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:58:47,700 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:58:47,749 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:58:47,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2022-12-05 22:58:47,854 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-05 22:58:47,854 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:58:47,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-05 22:58:47,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2022-12-05 22:58:47,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2022-12-05 22:58:47,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:47,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-05 22:58:47,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 258 flow [2022-12-05 22:58:47,940 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-05 22:58:47,940 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:58:47,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-05 22:58:47,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-05 22:58:47,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 2836 [2022-12-05 22:58:53,592 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-05 22:58:53,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:58:53,610 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;@48098e8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:58:53,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 22:58:53,614 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-05 22:58:53,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:58:53,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:53,615 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:53,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:58:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1729502736, now seen corresponding path program 1 times [2022-12-05 22:58:53,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:53,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630193042] [2022-12-05 22:58:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:53,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:54,045 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-05 22:58:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630193042] [2022-12-05 22:58:54,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630193042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:54,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:54,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:58:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393963866] [2022-12-05 22:58:54,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:54,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:58:54,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:54,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:58:54,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:58:54,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 22:58:54,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:54,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:54,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 22:58:54,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:54,744 INFO L130 PetriNetUnfolder]: 3113/4528 cut-off events. [2022-12-05 22:58:54,744 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-05 22:58:54,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8922 conditions, 4528 events. 3113/4528 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24729 event pairs, 593 based on Foata normal form. 0/4155 useless extension candidates. Maximal degree in co-relation 8910. Up to 3385 conditions per place. [2022-12-05 22:58:54,769 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 30 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2022-12-05 22:58:54,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2022-12-05 22:58:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:58:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:58:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 22:58:54,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2022-12-05 22:58:54,779 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 53 transitions. [2022-12-05 22:58:54,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2022-12-05 22:58:54,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 22:58:54,784 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2022-12-05 22:58:54,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-05 22:58:54,788 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-05 22:58:54,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:54,789 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 64 flow [2022-12-05 22:58:54,791 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:54,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:54,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 64 flow [2022-12-05 22:58:54,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 64 flow [2022-12-05 22:58:54,797 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-05 22:58:54,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:58:54,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:58:54,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 64 flow [2022-12-05 22:58:54,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-05 22:58:54,851 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:58:54,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-05 22:58:54,854 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-05 22:58:54,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:54,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:54,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:54,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:58:54,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:58:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash -100136067, now seen corresponding path program 1 times [2022-12-05 22:58:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:54,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355783055] [2022-12-05 22:58:54,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:55,545 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-05 22:58:55,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:55,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355783055] [2022-12-05 22:58:55,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355783055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:55,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:55,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:58:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102049253] [2022-12-05 22:58:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:55,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:58:55,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:55,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:58:55,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:58:55,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:58:55,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:55,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:55,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:58:55,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:56,587 INFO L130 PetriNetUnfolder]: 7719/10640 cut-off events. [2022-12-05 22:58:56,587 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-12-05 22:58:56,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21726 conditions, 10640 events. 7719/10640 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 51006 event pairs, 1847 based on Foata normal form. 400/11040 useless extension candidates. Maximal degree in co-relation 21716. Up to 5729 conditions per place. [2022-12-05 22:58:56,646 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 43 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2022-12-05 22:58:56,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 224 flow [2022-12-05 22:58:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:58:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:58:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-05 22:58:56,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2022-12-05 22:58:56,649 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 4 states and 55 transitions. [2022-12-05 22:58:56,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 224 flow [2022-12-05 22:58:56,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:58:56,653 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 136 flow [2022-12-05 22:58:56,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-05 22:58:56,654 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2022-12-05 22:58:56,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:56,654 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 136 flow [2022-12-05 22:58:56,655 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:56,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:56,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 136 flow [2022-12-05 22:58:56,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 136 flow [2022-12-05 22:58:56,749 INFO L130 PetriNetUnfolder]: 534/999 cut-off events. [2022-12-05 22:58:56,750 INFO L131 PetriNetUnfolder]: For 184/240 co-relation queries the response was YES. [2022-12-05 22:58:56,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2244 conditions, 999 events. 534/999 cut-off events. For 184/240 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5938 event pairs, 225 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 2234. Up to 596 conditions per place. [2022-12-05 22:58:56,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 136 flow [2022-12-05 22:58:56,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-05 22:58:56,782 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:58:56,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-05 22:58:56,784 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 136 flow [2022-12-05 22:58:56,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:56,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:56,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:56,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:58:56,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:58:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1799958113, now seen corresponding path program 1 times [2022-12-05 22:58:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:56,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427453979] [2022-12-05 22:58:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:58:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:57,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427453979] [2022-12-05 22:58:57,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427453979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:57,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:57,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:58:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402467199] [2022-12-05 22:58:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:57,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:58:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:58:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:58:57,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:58:57,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 136 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:57,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:57,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:58:57,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:58:58,682 INFO L130 PetriNetUnfolder]: 8653/11938 cut-off events. [2022-12-05 22:58:58,682 INFO L131 PetriNetUnfolder]: For 5253/5253 co-relation queries the response was YES. [2022-12-05 22:58:58,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32653 conditions, 11938 events. 8653/11938 cut-off events. For 5253/5253 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 59681 event pairs, 779 based on Foata normal form. 40/11978 useless extension candidates. Maximal degree in co-relation 32640. Up to 7441 conditions per place. [2022-12-05 22:58:58,763 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 54 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2022-12-05 22:58:58,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 412 flow [2022-12-05 22:58:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:58:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:58:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 22:58:58,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-05 22:58:58,767 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 136 flow. Second operand 4 states and 68 transitions. [2022-12-05 22:58:58,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 412 flow [2022-12-05 22:58:58,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 408 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:58:58,785 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 277 flow [2022-12-05 22:58:58,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-05 22:58:58,787 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2022-12-05 22:58:58,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:58:58,787 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 277 flow [2022-12-05 22:58:58,789 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:58:58,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:58:58,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 277 flow [2022-12-05 22:58:58,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 277 flow [2022-12-05 22:58:58,934 INFO L130 PetriNetUnfolder]: 709/1302 cut-off events. [2022-12-05 22:58:58,935 INFO L131 PetriNetUnfolder]: For 1449/1579 co-relation queries the response was YES. [2022-12-05 22:58:58,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4248 conditions, 1302 events. 709/1302 cut-off events. For 1449/1579 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7908 event pairs, 237 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 4234. Up to 695 conditions per place. [2022-12-05 22:58:58,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 277 flow [2022-12-05 22:58:58,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-05 22:58:58,996 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:58:58,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-05 22:58:58,998 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 277 flow [2022-12-05 22:58:58,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:58,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:58:58,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:58:58,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:58:58,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:58:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:58:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash 33364243, now seen corresponding path program 1 times [2022-12-05 22:58:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:58:58,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876908793] [2022-12-05 22:58:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:58:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:58:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:58:59,695 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-05 22:58:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:58:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876908793] [2022-12-05 22:58:59,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876908793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:58:59,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:58:59,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:58:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717890992] [2022-12-05 22:58:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:58:59,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:58:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:58:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:58:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:58:59,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:58:59,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 277 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:58:59,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:58:59,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:58:59,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:00,670 INFO L130 PetriNetUnfolder]: 8517/11754 cut-off events. [2022-12-05 22:59:00,670 INFO L131 PetriNetUnfolder]: For 18883/18883 co-relation queries the response was YES. [2022-12-05 22:59:00,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40715 conditions, 11754 events. 8517/11754 cut-off events. For 18883/18883 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 58882 event pairs, 857 based on Foata normal form. 24/11778 useless extension candidates. Maximal degree in co-relation 40698. Up to 7369 conditions per place. [2022-12-05 22:59:00,752 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 62 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2022-12-05 22:59:00,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 87 transitions, 685 flow [2022-12-05 22:59:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:59:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:59:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-05 22:59:00,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-05 22:59:00,757 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 277 flow. Second operand 4 states and 63 transitions. [2022-12-05 22:59:00,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 87 transitions, 685 flow [2022-12-05 22:59:00,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:59:00,767 INFO L231 Difference]: Finished difference. Result has 52 places, 63 transitions, 562 flow [2022-12-05 22:59:00,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=562, PETRI_PLACES=52, PETRI_TRANSITIONS=63} [2022-12-05 22:59:00,768 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2022-12-05 22:59:00,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:00,768 INFO L89 Accepts]: Start accepts. Operand has 52 places, 63 transitions, 562 flow [2022-12-05 22:59:00,770 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:00,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:00,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 63 transitions, 562 flow [2022-12-05 22:59:00,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions, 562 flow [2022-12-05 22:59:00,940 INFO L130 PetriNetUnfolder]: 676/1240 cut-off events. [2022-12-05 22:59:00,940 INFO L131 PetriNetUnfolder]: For 3152/3365 co-relation queries the response was YES. [2022-12-05 22:59:00,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5135 conditions, 1240 events. 676/1240 cut-off events. For 3152/3365 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7365 event pairs, 207 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 5116. Up to 662 conditions per place. [2022-12-05 22:59:00,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 63 transitions, 562 flow [2022-12-05 22:59:00,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-05 22:59:00,982 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:59:00,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-05 22:59:00,989 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 63 transitions, 562 flow [2022-12-05 22:59:00,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:00,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:00,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:00,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:59:00,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:59:00,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash 686733045, now seen corresponding path program 1 times [2022-12-05 22:59:00,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:00,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681240960] [2022-12-05 22:59:00,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:00,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:01,164 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-05 22:59:01,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:01,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681240960] [2022-12-05 22:59:01,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681240960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:01,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:01,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:59:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281233188] [2022-12-05 22:59:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:01,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:59:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:59:01,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:59:01,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 22:59:01,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 63 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:01,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:01,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 22:59:01,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:02,132 INFO L130 PetriNetUnfolder]: 7334/10617 cut-off events. [2022-12-05 22:59:02,132 INFO L131 PetriNetUnfolder]: For 35579/35800 co-relation queries the response was YES. [2022-12-05 22:59:02,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41854 conditions, 10617 events. 7334/10617 cut-off events. For 35579/35800 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 60809 event pairs, 2731 based on Foata normal form. 248/10722 useless extension candidates. Maximal degree in co-relation 41832. Up to 5509 conditions per place. [2022-12-05 22:59:02,202 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 62 selfloop transitions, 8 changer transitions 2/85 dead transitions. [2022-12-05 22:59:02,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 846 flow [2022-12-05 22:59:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:59:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:59:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-05 22:59:02,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2022-12-05 22:59:02,207 INFO L175 Difference]: Start difference. First operand has 52 places, 63 transitions, 562 flow. Second operand 3 states and 49 transitions. [2022-12-05 22:59:02,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 846 flow [2022-12-05 22:59:02,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 846 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:59:02,230 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 576 flow [2022-12-05 22:59:02,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2022-12-05 22:59:02,233 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2022-12-05 22:59:02,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:02,234 INFO L89 Accepts]: Start accepts. Operand has 55 places, 62 transitions, 576 flow [2022-12-05 22:59:02,235 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:02,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:02,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 62 transitions, 576 flow [2022-12-05 22:59:02,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 62 transitions, 576 flow [2022-12-05 22:59:02,373 INFO L130 PetriNetUnfolder]: 682/1339 cut-off events. [2022-12-05 22:59:02,373 INFO L131 PetriNetUnfolder]: For 4073/4272 co-relation queries the response was YES. [2022-12-05 22:59:02,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5606 conditions, 1339 events. 682/1339 cut-off events. For 4073/4272 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8759 event pairs, 245 based on Foata normal form. 0/1308 useless extension candidates. Maximal degree in co-relation 5585. Up to 721 conditions per place. [2022-12-05 22:59:02,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 62 transitions, 576 flow [2022-12-05 22:59:02,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 566 [2022-12-05 22:59:02,407 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:59:02,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-05 22:59:02,408 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 576 flow [2022-12-05 22:59:02,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:02,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:02,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:02,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:59:02,409 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:59:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 585274310, now seen corresponding path program 1 times [2022-12-05 22:59:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:02,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947907124] [2022-12-05 22:59:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:02,698 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-05 22:59:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:02,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947907124] [2022-12-05 22:59:02,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947907124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:02,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:02,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:59:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973795163] [2022-12-05 22:59:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:02,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:59:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:59:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:59:02,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 22:59:02,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 576 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:02,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:02,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 22:59:02,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:03,561 INFO L130 PetriNetUnfolder]: 6001/8898 cut-off events. [2022-12-05 22:59:03,561 INFO L131 PetriNetUnfolder]: For 41619/43486 co-relation queries the response was YES. [2022-12-05 22:59:03,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34873 conditions, 8898 events. 6001/8898 cut-off events. For 41619/43486 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 54802 event pairs, 1002 based on Foata normal form. 1810/10430 useless extension candidates. Maximal degree in co-relation 34849. Up to 5753 conditions per place. [2022-12-05 22:59:03,607 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 126 selfloop transitions, 10 changer transitions 2/156 dead transitions. [2022-12-05 22:59:03,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 156 transitions, 1670 flow [2022-12-05 22:59:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:59:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:59:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-05 22:59:03,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2022-12-05 22:59:03,609 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 576 flow. Second operand 5 states and 84 transitions. [2022-12-05 22:59:03,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 156 transitions, 1670 flow [2022-12-05 22:59:03,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 156 transitions, 1645 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 22:59:03,624 INFO L231 Difference]: Finished difference. Result has 61 places, 71 transitions, 657 flow [2022-12-05 22:59:03,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=657, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2022-12-05 22:59:03,624 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2022-12-05 22:59:03,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:03,625 INFO L89 Accepts]: Start accepts. Operand has 61 places, 71 transitions, 657 flow [2022-12-05 22:59:03,626 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:03,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:03,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 71 transitions, 657 flow [2022-12-05 22:59:03,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 71 transitions, 657 flow [2022-12-05 22:59:03,962 INFO L130 PetriNetUnfolder]: 2016/3602 cut-off events. [2022-12-05 22:59:03,963 INFO L131 PetriNetUnfolder]: For 12766/14429 co-relation queries the response was YES. [2022-12-05 22:59:03,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14374 conditions, 3602 events. 2016/3602 cut-off events. For 12766/14429 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 27253 event pairs, 793 based on Foata normal form. 231/3467 useless extension candidates. Maximal degree in co-relation 14349. Up to 2094 conditions per place. [2022-12-05 22:59:03,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 71 transitions, 657 flow [2022-12-05 22:59:03,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 968 [2022-12-05 22:59:04,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L859-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45| (mod v_~main$tmp_guard0~0_50 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [506] L767-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_165 (+ v_~__unbuffered_cnt~0_166 1)) (= |v_P1Thread1of1ForFork3_#res.offset_17| 0) (= |v_P1Thread1of1ForFork3_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_166} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_17|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_165} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-05 22:59:04,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L859-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45| (mod v_~main$tmp_guard0~0_50 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [496] L789-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-05 22:59:04,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L859-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45| (mod v_~main$tmp_guard0~0_50 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [475] L752-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_13| 0) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P0Thread1of1ForFork1_#res.offset_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_13|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-05 22:59:04,130 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L859-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45| (mod v_~main$tmp_guard0~0_50 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [479] L835-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_21| 0) (= |v_P3Thread1of1ForFork2_#res#1.base_21| 0) (= v_~__unbuffered_cnt~0_141 (+ v_~__unbuffered_cnt~0_142 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_21|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-05 22:59:04,173 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:59:04,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 550 [2022-12-05 22:59:04,174 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 70 transitions, 667 flow [2022-12-05 22:59:04,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:04,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:04,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:04,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:59:04,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:59:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash 718113329, now seen corresponding path program 1 times [2022-12-05 22:59:04,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:04,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245785783] [2022-12-05 22:59:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:04,700 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-05 22:59:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:04,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245785783] [2022-12-05 22:59:04,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245785783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:04,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:04,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:59:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061389453] [2022-12-05 22:59:04,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:04,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:59:04,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:04,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:59:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:59:04,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 22:59:04,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 70 transitions, 667 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:04,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:04,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 22:59:04,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:05,826 INFO L130 PetriNetUnfolder]: 10584/15621 cut-off events. [2022-12-05 22:59:05,826 INFO L131 PetriNetUnfolder]: For 70162/70162 co-relation queries the response was YES. [2022-12-05 22:59:05,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73707 conditions, 15621 events. 10584/15621 cut-off events. For 70162/70162 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 93386 event pairs, 3226 based on Foata normal form. 101/15722 useless extension candidates. Maximal degree in co-relation 73679. Up to 7780 conditions per place. [2022-12-05 22:59:05,906 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 82 selfloop transitions, 28 changer transitions 23/133 dead transitions. [2022-12-05 22:59:05,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 133 transitions, 1405 flow [2022-12-05 22:59:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:59:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:59:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-05 22:59:05,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 22:59:05,908 INFO L175 Difference]: Start difference. First operand has 60 places, 70 transitions, 667 flow. Second operand 4 states and 80 transitions. [2022-12-05 22:59:05,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 133 transitions, 1405 flow [2022-12-05 22:59:06,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 133 transitions, 1368 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-05 22:59:06,075 INFO L231 Difference]: Finished difference. Result has 65 places, 74 transitions, 859 flow [2022-12-05 22:59:06,076 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=859, PETRI_PLACES=65, PETRI_TRANSITIONS=74} [2022-12-05 22:59:06,076 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2022-12-05 22:59:06,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:06,076 INFO L89 Accepts]: Start accepts. Operand has 65 places, 74 transitions, 859 flow [2022-12-05 22:59:06,078 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:06,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:06,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 74 transitions, 859 flow [2022-12-05 22:59:06,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 74 transitions, 859 flow [2022-12-05 22:59:06,423 INFO L130 PetriNetUnfolder]: 2165/3792 cut-off events. [2022-12-05 22:59:06,424 INFO L131 PetriNetUnfolder]: For 18925/20127 co-relation queries the response was YES. [2022-12-05 22:59:06,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16273 conditions, 3792 events. 2165/3792 cut-off events. For 18925/20127 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 27927 event pairs, 939 based on Foata normal form. 254/3685 useless extension candidates. Maximal degree in co-relation 16244. Up to 2176 conditions per place. [2022-12-05 22:59:06,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 74 transitions, 859 flow [2022-12-05 22:59:06,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 738 [2022-12-05 22:59:06,607 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:59:06,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 532 [2022-12-05 22:59:06,608 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 861 flow [2022-12-05 22:59:06,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:06,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:06,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:06,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:59:06,609 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:59:06,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:06,609 INFO L85 PathProgramCache]: Analyzing trace with hash 586642792, now seen corresponding path program 1 times [2022-12-05 22:59:06,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:06,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903789166] [2022-12-05 22:59:06,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:06,807 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-05 22:59:06,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:06,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903789166] [2022-12-05 22:59:06,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903789166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:06,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:06,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:59:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693659695] [2022-12-05 22:59:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:06,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:59:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:59:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:59:06,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-05 22:59:06,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 861 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:06,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:06,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-05 22:59:06,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:07,408 INFO L130 PetriNetUnfolder]: 3790/6032 cut-off events. [2022-12-05 22:59:07,408 INFO L131 PetriNetUnfolder]: For 51324/53402 co-relation queries the response was YES. [2022-12-05 22:59:07,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28981 conditions, 6032 events. 3790/6032 cut-off events. For 51324/53402 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 38925 event pairs, 372 based on Foata normal form. 1597/7496 useless extension candidates. Maximal degree in co-relation 28949. Up to 2755 conditions per place. [2022-12-05 22:59:07,559 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 147 selfloop transitions, 14 changer transitions 22/200 dead transitions. [2022-12-05 22:59:07,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 200 transitions, 2627 flow [2022-12-05 22:59:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:59:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:59:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-05 22:59:07,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2022-12-05 22:59:07,564 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 861 flow. Second operand 6 states and 104 transitions. [2022-12-05 22:59:07,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 200 transitions, 2627 flow [2022-12-05 22:59:07,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 200 transitions, 2609 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-05 22:59:07,611 INFO L231 Difference]: Finished difference. Result has 71 places, 82 transitions, 967 flow [2022-12-05 22:59:07,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=967, PETRI_PLACES=71, PETRI_TRANSITIONS=82} [2022-12-05 22:59:07,613 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2022-12-05 22:59:07,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:07,613 INFO L89 Accepts]: Start accepts. Operand has 71 places, 82 transitions, 967 flow [2022-12-05 22:59:07,617 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:07,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:07,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 82 transitions, 967 flow [2022-12-05 22:59:07,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 82 transitions, 967 flow [2022-12-05 22:59:07,813 INFO L130 PetriNetUnfolder]: 1317/2614 cut-off events. [2022-12-05 22:59:07,813 INFO L131 PetriNetUnfolder]: For 16183/19256 co-relation queries the response was YES. [2022-12-05 22:59:07,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13455 conditions, 2614 events. 1317/2614 cut-off events. For 16183/19256 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 20265 event pairs, 297 based on Foata normal form. 246/2702 useless extension candidates. Maximal degree in co-relation 13422. Up to 1678 conditions per place. [2022-12-05 22:59:07,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 82 transitions, 967 flow [2022-12-05 22:59:07,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 1130 [2022-12-05 22:59:07,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L859-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45| (mod v_~main$tmp_guard0~0_50 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [496] L789-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-05 22:59:07,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L859-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45| (mod v_~main$tmp_guard0~0_50 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [506] L767-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_165 (+ v_~__unbuffered_cnt~0_166 1)) (= |v_P1Thread1of1ForFork3_#res.offset_17| 0) (= |v_P1Thread1of1ForFork3_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_166} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_17|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_165} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-05 22:59:07,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L859-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45| (mod v_~main$tmp_guard0~0_50 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [479] L835-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_21| 0) (= |v_P3Thread1of1ForFork2_#res#1.base_21| 0) (= v_~__unbuffered_cnt~0_141 (+ v_~__unbuffered_cnt~0_142 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_21|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-05 22:59:07,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L859-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45| (mod v_~main$tmp_guard0~0_50 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [475] L752-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_13| 0) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P0Thread1of1ForFork1_#res.offset_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_13|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-05 22:59:07,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:59:07,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-05 22:59:07,971 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 81 transitions, 975 flow [2022-12-05 22:59:07,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:07,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:07,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:07,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:59:07,972 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:59:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -386554633, now seen corresponding path program 1 times [2022-12-05 22:59:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:07,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381979986] [2022-12-05 22:59:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:08,208 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-05 22:59:08,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:08,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381979986] [2022-12-05 22:59:08,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381979986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:08,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:08,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:59:08,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742598448] [2022-12-05 22:59:08,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:08,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:59:08,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:08,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:59:08,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:59:08,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-05 22:59:08,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 81 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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-05 22:59:08,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:08,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-05 22:59:08,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:08,715 INFO L130 PetriNetUnfolder]: 2772/4501 cut-off events. [2022-12-05 22:59:08,715 INFO L131 PetriNetUnfolder]: For 39340/40599 co-relation queries the response was YES. [2022-12-05 22:59:08,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25665 conditions, 4501 events. 2772/4501 cut-off events. For 39340/40599 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 28310 event pairs, 189 based on Foata normal form. 915/5318 useless extension candidates. Maximal degree in co-relation 25629. Up to 2264 conditions per place. [2022-12-05 22:59:08,735 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 122 selfloop transitions, 21 changer transitions 46/204 dead transitions. [2022-12-05 22:59:08,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 204 transitions, 2697 flow [2022-12-05 22:59:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:59:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:59:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-12-05 22:59:08,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2022-12-05 22:59:08,737 INFO L175 Difference]: Start difference. First operand has 70 places, 81 transitions, 975 flow. Second operand 7 states and 124 transitions. [2022-12-05 22:59:08,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 204 transitions, 2697 flow [2022-12-05 22:59:08,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 204 transitions, 2594 flow, removed 41 selfloop flow, removed 4 redundant places. [2022-12-05 22:59:08,889 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 959 flow [2022-12-05 22:59:08,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=959, PETRI_PLACES=75, PETRI_TRANSITIONS=84} [2022-12-05 22:59:08,889 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2022-12-05 22:59:08,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:08,889 INFO L89 Accepts]: Start accepts. Operand has 75 places, 84 transitions, 959 flow [2022-12-05 22:59:08,891 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:08,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:08,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 84 transitions, 959 flow [2022-12-05 22:59:08,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 84 transitions, 959 flow [2022-12-05 22:59:09,044 INFO L130 PetriNetUnfolder]: 785/1779 cut-off events. [2022-12-05 22:59:09,045 INFO L131 PetriNetUnfolder]: For 11076/12200 co-relation queries the response was YES. [2022-12-05 22:59:09,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9072 conditions, 1779 events. 785/1779 cut-off events. For 11076/12200 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 13989 event pairs, 75 based on Foata normal form. 69/1744 useless extension candidates. Maximal degree in co-relation 9038. Up to 1200 conditions per place. [2022-12-05 22:59:09,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 84 transitions, 959 flow [2022-12-05 22:59:09,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 1122 [2022-12-05 22:59:09,066 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:59:09,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-05 22:59:09,067 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 959 flow [2022-12-05 22:59:09,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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-05 22:59:09,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:09,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:09,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:59:09,067 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:59:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1408250364, now seen corresponding path program 1 times [2022-12-05 22:59:09,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:09,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019627273] [2022-12-05 22:59:09,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:09,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:09,282 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-05 22:59:09,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:09,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019627273] [2022-12-05 22:59:09,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019627273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:09,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:09,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 22:59:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728577415] [2022-12-05 22:59:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:09,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:59:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:09,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:59:09,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:59:09,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-05 22:59:09,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 959 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 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-05 22:59:09,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:09,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-05 22:59:09,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:09,910 INFO L130 PetriNetUnfolder]: 2555/4230 cut-off events. [2022-12-05 22:59:09,910 INFO L131 PetriNetUnfolder]: For 31312/32099 co-relation queries the response was YES. [2022-12-05 22:59:09,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23324 conditions, 4230 events. 2555/4230 cut-off events. For 31312/32099 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 27362 event pairs, 172 based on Foata normal form. 492/4625 useless extension candidates. Maximal degree in co-relation 23287. Up to 1773 conditions per place. [2022-12-05 22:59:09,931 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 75 selfloop transitions, 20 changer transitions 98/202 dead transitions. [2022-12-05 22:59:09,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 202 transitions, 2662 flow [2022-12-05 22:59:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 22:59:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 22:59:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2022-12-05 22:59:09,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-05 22:59:09,932 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 959 flow. Second operand 9 states and 132 transitions. [2022-12-05 22:59:09,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 202 transitions, 2662 flow [2022-12-05 22:59:10,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 202 transitions, 2403 flow, removed 25 selfloop flow, removed 6 redundant places. [2022-12-05 22:59:10,217 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 532 flow [2022-12-05 22:59:10,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=532, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2022-12-05 22:59:10,218 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2022-12-05 22:59:10,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:10,218 INFO L89 Accepts]: Start accepts. Operand has 80 places, 57 transitions, 532 flow [2022-12-05 22:59:10,220 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:10,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:10,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 57 transitions, 532 flow [2022-12-05 22:59:10,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 57 transitions, 532 flow [2022-12-05 22:59:10,244 INFO L130 PetriNetUnfolder]: 69/206 cut-off events. [2022-12-05 22:59:10,244 INFO L131 PetriNetUnfolder]: For 941/1039 co-relation queries the response was YES. [2022-12-05 22:59:10,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 206 events. 69/206 cut-off events. For 941/1039 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 961 event pairs, 5 based on Foata normal form. 12/210 useless extension candidates. Maximal degree in co-relation 914. Up to 70 conditions per place. [2022-12-05 22:59:10,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 57 transitions, 532 flow [2022-12-05 22:59:10,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-05 22:59:45,435 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:59:45,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35218 [2022-12-05 22:59:45,436 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 496 flow [2022-12-05 22:59:45,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 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-05 22:59:45,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:45,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:45,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:59:45,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:59:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1289319746, now seen corresponding path program 1 times [2022-12-05 22:59:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:45,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971280090] [2022-12-05 22:59:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:45,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:45,655 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-05 22:59:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:45,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971280090] [2022-12-05 22:59:45,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971280090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:45,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:45,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:59:45,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680307944] [2022-12-05 22:59:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:45,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:59:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:59:45,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:59:45,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-05 22:59:45,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 496 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:45,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:45,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-05 22:59:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:45,788 INFO L130 PetriNetUnfolder]: 413/739 cut-off events. [2022-12-05 22:59:45,789 INFO L131 PetriNetUnfolder]: For 3524/3541 co-relation queries the response was YES. [2022-12-05 22:59:45,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 739 events. 413/739 cut-off events. For 3524/3541 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3147 event pairs, 93 based on Foata normal form. 10/745 useless extension candidates. Maximal degree in co-relation 3779. Up to 466 conditions per place. [2022-12-05 22:59:45,792 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 38 selfloop transitions, 1 changer transitions 45/87 dead transitions. [2022-12-05 22:59:45,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 87 transitions, 941 flow [2022-12-05 22:59:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:59:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:59:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-05 22:59:45,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2022-12-05 22:59:45,794 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 496 flow. Second operand 4 states and 53 transitions. [2022-12-05 22:59:45,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 87 transitions, 941 flow [2022-12-05 22:59:45,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 771 flow, removed 42 selfloop flow, removed 15 redundant places. [2022-12-05 22:59:45,803 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 275 flow [2022-12-05 22:59:45,803 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2022-12-05 22:59:45,803 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2022-12-05 22:59:45,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:45,804 INFO L89 Accepts]: Start accepts. Operand has 62 places, 40 transitions, 275 flow [2022-12-05 22:59:45,805 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:45,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:45,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 40 transitions, 275 flow [2022-12-05 22:59:45,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 40 transitions, 275 flow [2022-12-05 22:59:45,815 INFO L130 PetriNetUnfolder]: 37/107 cut-off events. [2022-12-05 22:59:45,816 INFO L131 PetriNetUnfolder]: For 402/435 co-relation queries the response was YES. [2022-12-05 22:59:45,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 107 events. 37/107 cut-off events. For 402/435 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 322 event pairs, 1 based on Foata normal form. 9/108 useless extension candidates. Maximal degree in co-relation 363. Up to 32 conditions per place. [2022-12-05 22:59:45,817 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 40 transitions, 275 flow [2022-12-05 22:59:45,817 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-05 22:59:45,981 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [535] $Ultimate##0-->L752: Formula: (and (= v_~a~0_40 1) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~x~0_130 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_130, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [458] $Ultimate##0-->L764: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~x~0_28 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-05 22:59:46,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L764-->L767: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [439] $Ultimate##0-->L779: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_24 2)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_24, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] [2022-12-05 22:59:46,367 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:59:46,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 564 [2022-12-05 22:59:46,368 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 277 flow [2022-12-05 22:59:46,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:46,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:46,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:46,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:59:46,369 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:59:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1930775486, now seen corresponding path program 1 times [2022-12-05 22:59:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:46,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521544581] [2022-12-05 22:59:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:47,039 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-05 22:59:47,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:47,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521544581] [2022-12-05 22:59:47,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521544581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:47,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:47,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:59:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151901566] [2022-12-05 22:59:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:47,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:59:47,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:59:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:59:47,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-05 22:59:47,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:47,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:47,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-05 22:59:47,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:47,133 INFO L130 PetriNetUnfolder]: 135/251 cut-off events. [2022-12-05 22:59:47,133 INFO L131 PetriNetUnfolder]: For 839/845 co-relation queries the response was YES. [2022-12-05 22:59:47,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 251 events. 135/251 cut-off events. For 839/845 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 899 event pairs, 22 based on Foata normal form. 5/256 useless extension candidates. Maximal degree in co-relation 1070. Up to 157 conditions per place. [2022-12-05 22:59:47,134 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 37 selfloop transitions, 4 changer transitions 14/55 dead transitions. [2022-12-05 22:59:47,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 483 flow [2022-12-05 22:59:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:59:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:59:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-05 22:59:47,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2956521739130435 [2022-12-05 22:59:47,136 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 277 flow. Second operand 5 states and 34 transitions. [2022-12-05 22:59:47,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 483 flow [2022-12-05 22:59:47,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 412 flow, removed 19 selfloop flow, removed 9 redundant places. [2022-12-05 22:59:47,139 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 172 flow [2022-12-05 22:59:47,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2022-12-05 22:59:47,139 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2022-12-05 22:59:47,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:47,139 INFO L89 Accepts]: Start accepts. Operand has 54 places, 31 transitions, 172 flow [2022-12-05 22:59:47,140 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:47,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:47,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 31 transitions, 172 flow [2022-12-05 22:59:47,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 31 transitions, 172 flow [2022-12-05 22:59:47,147 INFO L130 PetriNetUnfolder]: 22/57 cut-off events. [2022-12-05 22:59:47,147 INFO L131 PetriNetUnfolder]: For 138/146 co-relation queries the response was YES. [2022-12-05 22:59:47,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 57 events. 22/57 cut-off events. For 138/146 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 122 event pairs, 1 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 162. Up to 18 conditions per place. [2022-12-05 22:59:47,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 31 transitions, 172 flow [2022-12-05 22:59:47,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-05 22:59:47,167 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] $Ultimate##0-->L764: Formula: (and (= |v_P1Thread1of1ForFork3_#in~arg.base_23| v_P1Thread1of1ForFork3_~arg.base_23) (= 2 v_~x~0_132) (= v_~a~0_44 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= |v_P1Thread1of1ForFork3_#in~arg.offset_23| v_P1Thread1of1ForFork3_~arg.offset_23) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_23|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_23, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_23|, ~a~0=v_~a~0_44, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_23, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_132, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, ~a~0, P1Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [475] L752-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_13| 0) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P0Thread1of1ForFork1_#res.offset_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_13|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-05 22:59:47,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L828-->L835: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_69 256) 0))) (.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_56 256))))) (let ((.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_141 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_156 256) 0)) .cse5)) (.cse1 (and .cse4 .cse5))) (and (= v_~z$w_buff1_used~0_140 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_141)) (= v_~z~0_111 (ite .cse2 v_~z$w_buff0~0_75 (ite .cse0 v_~z$w_buff1~0_80 v_~z~0_112))) (= (ite .cse2 0 v_~z$w_buff0_used~0_156) v_~z$w_buff0_used~0_155) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_140 256) 0))) (and (not (= (mod v_~z$r_buff0_thd4~0_68 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_56) v_~z$r_buff1_thd4~0_55) (= (ite .cse1 0 v_~z$r_buff0_thd4~0_69) v_~z$r_buff0_thd4~0_68)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_75, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_69, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_141, ~z$w_buff1~0=v_~z$w_buff1~0_80, ~z~0=v_~z~0_112} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_55, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_75, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_68, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_140, ~z$w_buff1~0=v_~z$w_buff1~0_80, ~z~0=v_~z~0_111} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [540] L764-->L782: Formula: (and (= v_~y~0_124 2) (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z~0_506 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z~0=v_~z~0_506, ~y~0=v_~y~0_124, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~z~0, ~y~0] [2022-12-05 22:59:47,300 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-05 22:59:47,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L828-->L782: Formula: (let ((.cse1 (not (= (mod v_~z$r_buff0_thd4~0_285 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_570 256) 0)))) (let ((.cse0 (and .cse1 .cse3)) (.cse2 (not (= (mod v_~z$r_buff1_thd4~0_248 256) 0)))) (and (= v_~z$r_buff0_thd4~0_284 (ite .cse0 0 v_~z$r_buff0_thd4~0_285)) (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (= v_~z$w_buff0_used~0_570 (ite (and (not (= (mod v_~z$w_buff0_used~0_571 256) 0)) .cse1) 0 v_~z$w_buff0_used~0_571)) (= (ite (or .cse0 (and (not (= 0 (mod v_~z$w_buff1_used~0_530 256))) .cse2)) 0 v_~z$w_buff1_used~0_530) v_~z$w_buff1_used~0_529) (= v_~z~0_508 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= v_~y~0_126 2) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_284 256) 0))) (and .cse2 (not (= (mod v_~z$w_buff1_used~0_529 256) 0)))) 0 v_~z$r_buff1_thd4~0_248) v_~z$r_buff1_thd4~0_247)))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_248, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_285, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_530, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_247, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_570, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_284, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_529, ~z~0=v_~z~0_508, ~y~0=v_~y~0_126, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0, ~y~0] and [479] L835-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_21| 0) (= |v_P3Thread1of1ForFork2_#res#1.base_21| 0) (= v_~__unbuffered_cnt~0_141 (+ v_~__unbuffered_cnt~0_142 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_21|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-05 22:59:47,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L828-->P3EXIT: Formula: (let ((.cse1 (not (= (mod v_~z$r_buff0_thd4~0_289 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_574 256) 0)))) (let ((.cse0 (and .cse1 .cse3)) (.cse2 (not (= (mod v_~z$r_buff1_thd4~0_252 256) 0)))) (and (= v_~z$r_buff0_thd4~0_288 (ite .cse0 0 v_~z$r_buff0_thd4~0_289)) (= v_~z$w_buff0_used~0_574 (ite (and .cse1 (not (= (mod v_~z$w_buff0_used~0_575 256) 0))) 0 v_~z$w_buff0_used~0_575)) (= |v_P3Thread1of1ForFork2_#res#1.base_39| 0) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= v_~z$w_buff1_used~0_533 (ite (or .cse0 (and (not (= (mod v_~z$w_buff1_used~0_534 256) 0)) .cse2)) 0 v_~z$w_buff1_used~0_534)) (= v_~z~0_514 1) (= |v_P3Thread1of1ForFork2_#res#1.offset_39| 0) (= v_~y~0_128 2) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_533 256) 0)) .cse2) (and (not (= (mod v_~z$r_buff0_thd4~0_288 256) 0)) .cse3)) 0 v_~z$r_buff1_thd4~0_252) v_~z$r_buff1_thd4~0_251) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~__unbuffered_cnt~0_317 (+ v_~__unbuffered_cnt~0_318 1))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_252, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_575, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_289, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_534, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_318, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_39|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_251, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_39|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_574, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_533, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_288, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_317, ~z~0=v_~z~0_514, ~y~0=v_~y~0_128, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork2_#res#1.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~__unbuffered_cnt~0, ~z~0, ~y~0] and [397] L782-->L789: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_143 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256))))) (let ((.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_129 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_144 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~z~0_99 (ite .cse0 v_~z$w_buff0~0_67 (ite .cse1 v_~z$w_buff1~0_72 v_~z~0_100))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_129) v_~z$w_buff1_used~0_128) (= v_~z$w_buff0_used~0_143 (ite .cse0 0 v_~z$w_buff0_used~0_144)) (= v_~z$r_buff0_thd3~0_29 (ite .cse2 0 v_~z$r_buff0_thd3~0_30)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_128 256) 0)))) 0 v_~z$r_buff1_thd3~0_28) v_~z$r_buff1_thd3~0_27)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_144, ~z$w_buff0~0=v_~z$w_buff0~0_67, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_72, ~z~0=v_~z~0_100} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_67, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_128, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_72, ~z~0=v_~z~0_99} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 22:59:47,606 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:59:47,606 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-05 22:59:47,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:59:47,607 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-05 22:59:47,610 INFO L158 Benchmark]: Toolchain (without parser) took 61465.06ms. Allocated memory was 191.9MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 165.9MB in the beginning and 1.1GB in the end (delta: -972.2MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-05 22:59:47,610 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory was 168.5MB in the beginning and 168.5MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:59:47,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.24ms. Allocated memory is still 191.9MB. Free memory was 165.9MB in the beginning and 137.2MB in the end (delta: 28.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 22:59:47,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.03ms. Allocated memory is still 191.9MB. Free memory was 137.2MB in the beginning and 134.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 22:59:47,611 INFO L158 Benchmark]: Boogie Preprocessor took 60.97ms. Allocated memory is still 191.9MB. Free memory was 134.4MB in the beginning and 131.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:59:47,611 INFO L158 Benchmark]: RCFGBuilder took 788.96ms. Allocated memory is still 191.9MB. Free memory was 131.9MB in the beginning and 137.6MB in the end (delta: -5.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-05 22:59:47,611 INFO L158 Benchmark]: TraceAbstraction took 59929.65ms. Allocated memory was 191.9MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 136.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-05 22:59:47,612 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory was 168.5MB in the beginning and 168.5MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 611.24ms. Allocated memory is still 191.9MB. Free memory was 165.9MB in the beginning and 137.2MB in the end (delta: 28.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.03ms. Allocated memory is still 191.9MB. Free memory was 137.2MB in the beginning and 134.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.97ms. Allocated memory is still 191.9MB. Free memory was 134.4MB in the beginning and 131.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 788.96ms. Allocated memory is still 191.9MB. Free memory was 131.9MB in the beginning and 137.6MB in the end (delta: -5.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 59929.65ms. Allocated memory was 191.9MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 136.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 134 PlacesBefore, 43 PlacesAfterwards, 123 TransitionsBefore, 31 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2007, independent: 1939, independent conditional: 1939, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2007, independent: 1939, independent conditional: 0, independent unconditional: 1939, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2007, independent: 1939, independent conditional: 0, independent unconditional: 1939, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2007, independent: 1939, independent conditional: 0, independent unconditional: 1939, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1654, independent: 1605, independent conditional: 0, independent unconditional: 1605, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1654, independent: 1579, independent conditional: 0, independent unconditional: 1579, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 342, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2007, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 1654, unknown conditional: 0, unknown unconditional: 1654] , Statistics on independence cache: Total cache size (in pairs): 2545, Positive cache size: 2496, Positive conditional cache size: 0, Positive unconditional cache size: 2496, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 195, independent: 169, independent conditional: 15, independent unconditional: 154, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 195, independent: 169, independent conditional: 15, independent unconditional: 154, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 195, independent: 169, independent conditional: 15, independent unconditional: 154, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 174, independent: 155, independent conditional: 12, independent unconditional: 143, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 174, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 41, dependent conditional: 10, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 195, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 174, unknown conditional: 14, unknown unconditional: 160] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 155, Positive conditional cache size: 12, Positive unconditional cache size: 143, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, 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, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 13, independent unconditional: 77, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 90, independent conditional: 4, independent unconditional: 86, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 90, independent conditional: 4, independent unconditional: 86, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 79, independent conditional: 4, independent unconditional: 75, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 166, Positive conditional cache size: 12, Positive unconditional cache size: 154, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 350, independent: 328, independent conditional: 328, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 350, independent: 328, independent conditional: 94, independent unconditional: 234, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 351, independent: 328, independent conditional: 41, independent unconditional: 287, dependent: 23, dependent conditional: 6, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 351, independent: 328, independent conditional: 41, independent unconditional: 287, dependent: 23, dependent conditional: 6, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 351, independent: 320, independent conditional: 37, independent unconditional: 283, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 12, unknown conditional: 8, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 174, Positive conditional cache size: 16, Positive unconditional cache size: 158, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 53, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 583, independent: 546, independent conditional: 546, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 583, independent: 546, independent conditional: 172, independent unconditional: 374, dependent: 37, dependent conditional: 1, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 585, independent: 546, independent conditional: 23, independent unconditional: 523, dependent: 39, dependent conditional: 3, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 585, independent: 546, independent conditional: 23, independent unconditional: 523, dependent: 39, dependent conditional: 3, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 585, independent: 543, independent conditional: 22, independent unconditional: 521, dependent: 38, dependent conditional: 2, dependent unconditional: 36, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 177, Positive conditional cache size: 17, Positive unconditional cache size: 160, Negative cache size: 26, Negative conditional cache size: 7, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 149, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 492, independent: 455, independent conditional: 455, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 492, independent: 455, independent conditional: 143, independent unconditional: 312, dependent: 37, dependent conditional: 1, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 494, independent: 455, independent conditional: 10, independent unconditional: 445, dependent: 39, dependent conditional: 3, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 494, independent: 455, independent conditional: 10, independent unconditional: 445, dependent: 39, dependent conditional: 3, dependent unconditional: 36, 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: 494, independent: 455, independent conditional: 10, independent unconditional: 445, dependent: 39, dependent conditional: 3, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 177, Positive conditional cache size: 17, Positive unconditional cache size: 160, Negative cache size: 26, Negative conditional cache size: 7, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 133, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 61 PlacesBefore, 60 PlacesAfterwards, 71 TransitionsBefore, 70 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 728, independent: 694, independent conditional: 694, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 728, independent: 694, independent conditional: 418, independent unconditional: 276, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 752, independent: 694, independent conditional: 270, independent unconditional: 424, dependent: 58, dependent conditional: 36, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 752, independent: 694, independent conditional: 270, independent unconditional: 424, dependent: 58, dependent conditional: 36, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 13, independent conditional: 9, independent unconditional: 4, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 752, independent: 681, independent conditional: 261, independent unconditional: 420, dependent: 52, dependent conditional: 30, dependent unconditional: 22, unknown: 19, unknown conditional: 15, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 205, Positive conditional cache size: 29, Positive unconditional cache size: 176, Negative cache size: 32, Negative conditional cache size: 13, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 148, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 64 PlacesBefore, 64 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 458, independent: 424, independent conditional: 424, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 458, independent: 424, independent conditional: 215, independent unconditional: 209, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 494, independent: 424, independent conditional: 110, independent unconditional: 314, dependent: 70, dependent conditional: 48, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 494, independent: 424, independent conditional: 110, independent unconditional: 314, dependent: 70, dependent conditional: 48, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 494, independent: 418, independent conditional: 108, independent unconditional: 310, dependent: 68, dependent conditional: 46, dependent unconditional: 22, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 217, Positive conditional cache size: 31, Positive unconditional cache size: 186, Negative cache size: 34, Negative conditional cache size: 15, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 71 PlacesBefore, 70 PlacesAfterwards, 82 TransitionsBefore, 81 TransitionsAfterwards, 1130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 687, independent: 651, independent conditional: 651, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 687, independent: 651, independent conditional: 433, independent unconditional: 218, dependent: 36, dependent conditional: 12, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 723, independent: 651, independent conditional: 273, independent unconditional: 378, dependent: 72, dependent conditional: 48, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 723, independent: 651, independent conditional: 273, independent unconditional: 378, dependent: 72, dependent conditional: 48, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 723, independent: 649, independent conditional: 273, independent unconditional: 376, dependent: 72, dependent conditional: 48, dependent unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 240, Positive conditional cache size: 34, Positive unconditional cache size: 206, Negative cache size: 34, Negative conditional cache size: 15, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 160, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 245, independent conditional: 245, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 245, independent conditional: 140, independent unconditional: 105, dependent: 15, dependent conditional: 6, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 272, independent: 245, independent conditional: 98, independent unconditional: 147, dependent: 27, dependent conditional: 18, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 272, independent: 245, independent conditional: 98, independent unconditional: 147, dependent: 27, dependent conditional: 18, dependent unconditional: 9, 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: 272, independent: 245, independent conditional: 98, independent unconditional: 147, dependent: 27, dependent conditional: 18, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 240, Positive conditional cache size: 34, Positive unconditional cache size: 206, Negative cache size: 34, Negative conditional cache size: 15, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.2s, 77 PlacesBefore, 72 PlacesAfterwards, 57 TransitionsBefore, 52 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 99, independent conditional: 57, independent unconditional: 42, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 99, independent conditional: 57, independent unconditional: 42, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 99, independent conditional: 57, independent unconditional: 42, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 111, independent: 92, independent conditional: 50, independent unconditional: 42, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 252, Positive conditional cache size: 41, Positive unconditional cache size: 211, Negative cache size: 34, Negative conditional cache size: 15, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 61 PlacesBefore, 58 PlacesAfterwards, 40 TransitionsBefore, 37 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 23, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 35, independent: 25, independent conditional: 9, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 318, Positive conditional cache size: 47, Positive unconditional cache size: 271, Negative cache size: 34, Negative conditional cache size: 15, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 49 PlacesBefore, 48 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 23, 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: 23, independent: 23, independent conditional: 23, 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: 23, independent: 23, independent conditional: 18, independent unconditional: 5, 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: 23, independent: 23, independent conditional: 18, independent unconditional: 5, 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: 4, 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: 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: 23, independent: 19, independent conditional: 14, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 356, Positive conditional cache size: 53, Positive unconditional cache size: 303, Negative cache size: 34, Negative conditional cache size: 15, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-05 22:59:47,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...