/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:27:54,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:27:54,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:27:54,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:27:54,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:27:54,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:27:54,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:27:54,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:27:54,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:27:54,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:27:54,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:27:54,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:27:54,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:27:54,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:27:54,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:27:54,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:27:54,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:27:54,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:27:54,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:27:54,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:27:54,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:27:54,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:27:54,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:27:54,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:27:54,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:27:54,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:27:54,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:27:54,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:27:54,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:27:54,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:27:54,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:27:54,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:27:54,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:27:54,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:27:54,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:27:54,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:27:54,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:27:54,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:27:54,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:27:54,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:27:54,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:27:54,397 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:27:54,421 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:27:54,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:27:54,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:27:54,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:27:54,423 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:27:54,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:27:54,424 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:27:54,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:27:54,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:27:54,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:27:54,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:27:54,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:27:54,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:27:54,425 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:27:54,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:27:54,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:27:54,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:27:54,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:27:54,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:27:54,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:27:54,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:27:54,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:27:54,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:27:54,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:27:54,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:27:54,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:27:54,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:27:54,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:27:54,427 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-06 04:27:54,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:27:54,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:27:54,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:27:54,721 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:27:54,722 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:27:54,723 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i [2022-12-06 04:27:55,915 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:27:56,164 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:27:56,165 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i [2022-12-06 04:27:56,176 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f507f9e/2785076bdb454ed9ae64f98116cda6c3/FLAG267f23d8c [2022-12-06 04:27:56,190 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f507f9e/2785076bdb454ed9ae64f98116cda6c3 [2022-12-06 04:27:56,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:27:56,193 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:27:56,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:27:56,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:27:56,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:27:56,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b62bda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56, skipping insertion in model container [2022-12-06 04:27:56,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:27:56,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:27:56,379 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/safe012_power.oepc.i[995,1008] [2022-12-06 04:27:56,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:27:56,572 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:27:56,583 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/safe012_power.oepc.i[995,1008] [2022-12-06 04:27:56,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:27:56,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:27:56,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:27:56,673 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:27:56,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56 WrapperNode [2022-12-06 04:27:56,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:27:56,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:27:56,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:27:56,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:27:56,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,707 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-06 04:27:56,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:27:56,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:27:56,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:27:56,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:27:56,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,727 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:27:56,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:27:56,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:27:56,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:27:56,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (1/1) ... [2022-12-06 04:27:56,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:27:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:27:56,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:27:56,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:27:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:27:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:27:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:27:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:27:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:27:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:27:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:27:56,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:27:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:27:56,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:27:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:27:56,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:27:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:27:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:27:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:27:56,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:27:56,824 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:27:56,997 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:27:56,999 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:27:57,297 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:27:57,483 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:27:57,483 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:27:57,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:27:57 BoogieIcfgContainer [2022-12-06 04:27:57,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:27:57,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:27:57,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:27:57,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:27:57,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:27:56" (1/3) ... [2022-12-06 04:27:57,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293c43d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:27:57, skipping insertion in model container [2022-12-06 04:27:57,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:27:56" (2/3) ... [2022-12-06 04:27:57,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293c43d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:27:57, skipping insertion in model container [2022-12-06 04:27:57,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:27:57" (3/3) ... [2022-12-06 04:27:57,491 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.oepc.i [2022-12-06 04:27:57,505 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:27:57,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:27:57,505 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:27:57,558 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:27:57,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:27:57,697 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:27:57,697 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:27:57,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-06 04:27:57,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:27:57,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-06 04:27:57,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:27:57,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:27:57,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-06 04:27:57,786 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-06 04:27:57,786 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:27:57,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-06 04:27:57,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:27:57,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-06 04:28:05,942 INFO L203 LiptonReduction]: Total number of compositions: 92 [2022-12-06 04:28:05,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:28:05,982 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;@5c0a5cbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:28:05,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:28:05,987 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 04:28:05,987 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:05,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:05,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:05,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash 799131745, now seen corresponding path program 1 times [2022-12-06 04:28:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:06,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275816953] [2022-12-06 04:28:06,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:06,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275816953] [2022-12-06 04:28:06,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275816953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:06,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:06,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106414285] [2022-12-06 04:28:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:06,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:28:06,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:28:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:28:06,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 04:28:06,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-06 04:28:06,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:06,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 04:28:06,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:06,354 INFO L130 PetriNetUnfolder]: 293/488 cut-off events. [2022-12-06 04:28:06,354 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:28:06,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 488 events. 293/488 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2079 event pairs, 293 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 970. Up to 463 conditions per place. [2022-12-06 04:28:06,358 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 16 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-06 04:28:06,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 79 flow [2022-12-06 04:28:06,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:28:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:28:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-12-06 04:28:06,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 04:28:06,368 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 23 transitions. [2022-12-06 04:28:06,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 79 flow [2022-12-06 04:28:06,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:28:06,371 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2022-12-06 04:28:06,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 04:28:06,374 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 04:28:06,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:06,375 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 44 flow [2022-12-06 04:28:06,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:06,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:06,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2022-12-06 04:28:06,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2022-12-06 04:28:06,382 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:28:06,382 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:06,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:28:06,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 44 flow [2022-12-06 04:28:06,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 04:28:06,480 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:06,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 04:28:06,482 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2022-12-06 04:28:06,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-06 04:28:06,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:06,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:06,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:28:06,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:06,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash -833554059, now seen corresponding path program 1 times [2022-12-06 04:28:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:06,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157383876] [2022-12-06 04:28:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:06,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157383876] [2022-12-06 04:28:06,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157383876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:06,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:06,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:06,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176075934] [2022-12-06 04:28:06,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:06,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:28:06,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:28:06,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:28:06,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-06 04:28:06,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:06,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:06,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-06 04:28:06,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:06,992 INFO L130 PetriNetUnfolder]: 272/467 cut-off events. [2022-12-06 04:28:06,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:06,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 467 events. 272/467 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2010 event pairs, 74 based on Foata normal form. 9/472 useless extension candidates. Maximal degree in co-relation 919. Up to 325 conditions per place. [2022-12-06 04:28:06,995 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 20 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 04:28:06,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 100 flow [2022-12-06 04:28:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:28:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:28:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:28:06,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 04:28:06,997 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:28:06,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 100 flow [2022-12-06 04:28:06,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:28:06,999 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:06,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 04:28:06,999 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 04:28:07,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:07,000 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:07,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:07,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:07,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:07,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:07,005 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:28:07,005 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:07,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:28:07,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:07,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 04:28:07,007 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:07,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:28:07,008 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 04:28:07,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:07,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:07,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:07,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:28:07,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:07,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash -70371449, now seen corresponding path program 1 times [2022-12-06 04:28:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:07,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756500718] [2022-12-06 04:28:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:07,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756500718] [2022-12-06 04:28:07,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756500718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:07,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:07,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:28:07,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966429550] [2022-12-06 04:28:07,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:07,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:07,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:07,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:28:07,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:07,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:07,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:28:07,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:07,287 INFO L130 PetriNetUnfolder]: 417/696 cut-off events. [2022-12-06 04:28:07,287 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 04:28:07,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 696 events. 417/696 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3188 event pairs, 145 based on Foata normal form. 36/725 useless extension candidates. Maximal degree in co-relation 1476. Up to 236 conditions per place. [2022-12-06 04:28:07,291 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 25 selfloop transitions, 3 changer transitions 5/35 dead transitions. [2022-12-06 04:28:07,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 155 flow [2022-12-06 04:28:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 04:28:07,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5657894736842105 [2022-12-06 04:28:07,292 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 4 states and 43 transitions. [2022-12-06 04:28:07,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 155 flow [2022-12-06 04:28:07,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:07,293 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 62 flow [2022-12-06 04:28:07,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2022-12-06 04:28:07,294 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 04:28:07,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:07,294 INFO L89 Accepts]: Start accepts. Operand has 32 places, 19 transitions, 62 flow [2022-12-06 04:28:07,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:07,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:07,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 19 transitions, 62 flow [2022-12-06 04:28:07,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 19 transitions, 62 flow [2022-12-06 04:28:07,299 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:28:07,299 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:28:07,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 19 events. 0/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:28:07,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 19 transitions, 62 flow [2022-12-06 04:28:07,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 04:28:07,326 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:28:07,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 04:28:07,327 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 60 flow [2022-12-06 04:28:07,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:07,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:07,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:07,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:28:07,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:07,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash 651111026, now seen corresponding path program 1 times [2022-12-06 04:28:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:07,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900089600] [2022-12-06 04:28:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:07,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:07,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900089600] [2022-12-06 04:28:07,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900089600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:07,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:07,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:07,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523561105] [2022-12-06 04:28:07,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:07,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:28:07,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:07,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:28:07,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:28:07,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 04:28:07,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-06 04:28:07,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:07,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 04:28:07,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:07,602 INFO L130 PetriNetUnfolder]: 175/332 cut-off events. [2022-12-06 04:28:07,602 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-06 04:28:07,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 332 events. 175/332 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1344 event pairs, 35 based on Foata normal form. 6/336 useless extension candidates. Maximal degree in co-relation 765. Up to 229 conditions per place. [2022-12-06 04:28:07,604 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 04:28:07,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 148 flow [2022-12-06 04:28:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:28:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:28:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 04:28:07,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 04:28:07,605 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 60 flow. Second operand 3 states and 34 transitions. [2022-12-06 04:28:07,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 148 flow [2022-12-06 04:28:07,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 131 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:28:07,607 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 56 flow [2022-12-06 04:28:07,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2022-12-06 04:28:07,608 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-06 04:28:07,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:07,608 INFO L89 Accepts]: Start accepts. Operand has 30 places, 18 transitions, 56 flow [2022-12-06 04:28:07,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:07,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:07,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 56 flow [2022-12-06 04:28:07,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 56 flow [2022-12-06 04:28:07,613 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:28:07,613 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:28:07,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:28:07,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 56 flow [2022-12-06 04:28:07,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 04:28:07,657 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:07,658 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:28:07,658 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 56 flow [2022-12-06 04:28:07,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-06 04:28:07,658 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:07,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:07,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:28:07,659 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1289732468, now seen corresponding path program 1 times [2022-12-06 04:28:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:07,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238075486] [2022-12-06 04:28:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:08,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238075486] [2022-12-06 04:28:08,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238075486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:08,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:08,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:28:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614267583] [2022-12-06 04:28:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:08,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:28:08,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:08,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:28:08,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:28:08,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:28:08,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 56 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:08,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:08,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:28:08,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:08,979 INFO L130 PetriNetUnfolder]: 278/485 cut-off events. [2022-12-06 04:28:08,980 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-06 04:28:08,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 485 events. 278/485 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2022 event pairs, 71 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 1152. Up to 202 conditions per place. [2022-12-06 04:28:08,983 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 28 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2022-12-06 04:28:08,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 172 flow [2022-12-06 04:28:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 04:28:08,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:28:08,984 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 56 flow. Second operand 4 states and 39 transitions. [2022-12-06 04:28:08,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 172 flow [2022-12-06 04:28:08,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:08,986 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 90 flow [2022-12-06 04:28:08,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 04:28:08,987 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-06 04:28:08,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:08,987 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 90 flow [2022-12-06 04:28:08,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:08,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:08,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 90 flow [2022-12-06 04:28:08,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 90 flow [2022-12-06 04:28:08,996 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 04:28:08,996 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-12-06 04:28:08,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 39 events. 3/39 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 113 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 76. Up to 8 conditions per place. [2022-12-06 04:28:08,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 90 flow [2022-12-06 04:28:08,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 04:28:09,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:28:09,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-06 04:28:09,133 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 92 flow [2022-12-06 04:28:09,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:09,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:09,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:09,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:28:09,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1984406938, now seen corresponding path program 2 times [2022-12-06 04:28:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:09,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777672644] [2022-12-06 04:28:09,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:10,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:10,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777672644] [2022-12-06 04:28:10,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777672644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:10,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:10,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:28:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468596474] [2022-12-06 04:28:10,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:10,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:28:10,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:10,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:28:10,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:28:10,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:28:10,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 92 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:10,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:10,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:28:10,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:10,270 INFO L130 PetriNetUnfolder]: 270/473 cut-off events. [2022-12-06 04:28:10,271 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-06 04:28:10,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 473 events. 270/473 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2025 event pairs, 53 based on Foata normal form. 4/476 useless extension candidates. Maximal degree in co-relation 1253. Up to 214 conditions per place. [2022-12-06 04:28:10,273 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 29 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2022-12-06 04:28:10,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 198 flow [2022-12-06 04:28:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 04:28:10,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:28:10,274 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 92 flow. Second operand 4 states and 38 transitions. [2022-12-06 04:28:10,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 198 flow [2022-12-06 04:28:10,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:28:10,275 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 108 flow [2022-12-06 04:28:10,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 04:28:10,276 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 04:28:10,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:10,276 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 108 flow [2022-12-06 04:28:10,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:10,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:10,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 108 flow [2022-12-06 04:28:10,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 108 flow [2022-12-06 04:28:10,283 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 04:28:10,284 INFO L131 PetriNetUnfolder]: For 26/28 co-relation queries the response was YES. [2022-12-06 04:28:10,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 39 events. 3/39 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 0 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 83. Up to 8 conditions per place. [2022-12-06 04:28:10,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 108 flow [2022-12-06 04:28:10,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 04:28:10,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:28:10,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 04:28:10,372 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 108 flow [2022-12-06 04:28:10,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:10,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:10,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:10,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:28:10,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1290439516, now seen corresponding path program 1 times [2022-12-06 04:28:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:10,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226643821] [2022-12-06 04:28:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:10,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:10,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226643821] [2022-12-06 04:28:10,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226643821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:10,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:10,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:28:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474654849] [2022-12-06 04:28:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:10,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:10,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:28:10,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:10,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:10,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:28:10,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:10,641 INFO L130 PetriNetUnfolder]: 196/360 cut-off events. [2022-12-06 04:28:10,641 INFO L131 PetriNetUnfolder]: For 447/447 co-relation queries the response was YES. [2022-12-06 04:28:10,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 360 events. 196/360 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1498 event pairs, 21 based on Foata normal form. 33/391 useless extension candidates. Maximal degree in co-relation 1077. Up to 152 conditions per place. [2022-12-06 04:28:10,643 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 41 selfloop transitions, 5 changer transitions 1/48 dead transitions. [2022-12-06 04:28:10,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 332 flow [2022-12-06 04:28:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 04:28:10,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2022-12-06 04:28:10,644 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 108 flow. Second operand 4 states and 47 transitions. [2022-12-06 04:28:10,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 332 flow [2022-12-06 04:28:10,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 309 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:10,646 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 131 flow [2022-12-06 04:28:10,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:28:10,646 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-12-06 04:28:10,646 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:10,646 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 131 flow [2022-12-06 04:28:10,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:10,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:10,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 131 flow [2022-12-06 04:28:10,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 131 flow [2022-12-06 04:28:10,657 INFO L130 PetriNetUnfolder]: 24/82 cut-off events. [2022-12-06 04:28:10,657 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES. [2022-12-06 04:28:10,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 82 events. 24/82 cut-off events. For 36/41 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 309 event pairs, 8 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 203. Up to 48 conditions per place. [2022-12-06 04:28:10,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 131 flow [2022-12-06 04:28:10,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 04:28:10,661 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:10,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:28:10,661 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 131 flow [2022-12-06 04:28:10,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:10,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:10,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:10,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:28:10,662 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash 605225496, now seen corresponding path program 1 times [2022-12-06 04:28:10,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:10,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618317005] [2022-12-06 04:28:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:10,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:10,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618317005] [2022-12-06 04:28:10,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618317005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:10,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:10,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:28:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703737195] [2022-12-06 04:28:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:10,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:28:10,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:10,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:28:10,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:28:10,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:28:10,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:10,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:10,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:28:10,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:10,890 INFO L130 PetriNetUnfolder]: 118/237 cut-off events. [2022-12-06 04:28:10,891 INFO L131 PetriNetUnfolder]: For 340/340 co-relation queries the response was YES. [2022-12-06 04:28:10,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 237 events. 118/237 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 895 event pairs, 10 based on Foata normal form. 23/259 useless extension candidates. Maximal degree in co-relation 851. Up to 98 conditions per place. [2022-12-06 04:28:10,892 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 45 selfloop transitions, 8 changer transitions 1/55 dead transitions. [2022-12-06 04:28:10,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 388 flow [2022-12-06 04:28:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:28:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:28:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 04:28:10,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 04:28:10,893 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 131 flow. Second operand 5 states and 55 transitions. [2022-12-06 04:28:10,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 388 flow [2022-12-06 04:28:10,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 378 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:10,895 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 171 flow [2022-12-06 04:28:10,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2022-12-06 04:28:10,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2022-12-06 04:28:10,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:10,895 INFO L89 Accepts]: Start accepts. Operand has 42 places, 28 transitions, 171 flow [2022-12-06 04:28:10,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:10,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:10,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 28 transitions, 171 flow [2022-12-06 04:28:10,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 171 flow [2022-12-06 04:28:10,906 INFO L130 PetriNetUnfolder]: 14/64 cut-off events. [2022-12-06 04:28:10,906 INFO L131 PetriNetUnfolder]: For 79/93 co-relation queries the response was YES. [2022-12-06 04:28:10,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 64 events. 14/64 cut-off events. For 79/93 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 206 event pairs, 1 based on Foata normal form. 4/67 useless extension candidates. Maximal degree in co-relation 202. Up to 32 conditions per place. [2022-12-06 04:28:10,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 171 flow [2022-12-06 04:28:10,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 04:28:10,909 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:10,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:28:10,909 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 171 flow [2022-12-06 04:28:10,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:10,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:10,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:10,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:28:10,910 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:10,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:10,910 INFO L85 PathProgramCache]: Analyzing trace with hash -783368479, now seen corresponding path program 1 times [2022-12-06 04:28:10,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:10,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469607107] [2022-12-06 04:28:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:11,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:11,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469607107] [2022-12-06 04:28:11,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469607107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:11,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:11,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:28:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159483575] [2022-12-06 04:28:11,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:11,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:11,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:11,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:28:11,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 171 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:11,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:11,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:28:11,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:11,107 INFO L130 PetriNetUnfolder]: 175/350 cut-off events. [2022-12-06 04:28:11,107 INFO L131 PetriNetUnfolder]: For 739/739 co-relation queries the response was YES. [2022-12-06 04:28:11,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 350 events. 175/350 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1391 event pairs, 32 based on Foata normal form. 5/355 useless extension candidates. Maximal degree in co-relation 1400. Up to 184 conditions per place. [2022-12-06 04:28:11,109 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 33 selfloop transitions, 2 changer transitions 16/51 dead transitions. [2022-12-06 04:28:11,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 416 flow [2022-12-06 04:28:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 04:28:11,110 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2022-12-06 04:28:11,110 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 171 flow. Second operand 4 states and 35 transitions. [2022-12-06 04:28:11,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 416 flow [2022-12-06 04:28:11,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 372 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 04:28:11,114 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 162 flow [2022-12-06 04:28:11,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-06 04:28:11,114 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2022-12-06 04:28:11,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:11,115 INFO L89 Accepts]: Start accepts. Operand has 43 places, 29 transitions, 162 flow [2022-12-06 04:28:11,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:11,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:11,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 29 transitions, 162 flow [2022-12-06 04:28:11,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 29 transitions, 162 flow [2022-12-06 04:28:11,128 INFO L130 PetriNetUnfolder]: 25/108 cut-off events. [2022-12-06 04:28:11,128 INFO L131 PetriNetUnfolder]: For 78/93 co-relation queries the response was YES. [2022-12-06 04:28:11,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 108 events. 25/108 cut-off events. For 78/93 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 458 event pairs, 2 based on Foata normal form. 7/111 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2022-12-06 04:28:11,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 29 transitions, 162 flow [2022-12-06 04:28:11,130 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 04:28:11,130 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:11,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 04:28:11,131 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 162 flow [2022-12-06 04:28:11,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:11,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:11,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:11,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:28:11,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -281931255, now seen corresponding path program 2 times [2022-12-06 04:28:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:11,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894197204] [2022-12-06 04:28:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:28:11,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:11,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894197204] [2022-12-06 04:28:11,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894197204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:11,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:11,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:28:11,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702987277] [2022-12-06 04:28:11,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:11,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:28:11,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:11,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:28:11,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:28:11,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:28:11,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:11,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:11,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:28:11,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:11,405 INFO L130 PetriNetUnfolder]: 122/256 cut-off events. [2022-12-06 04:28:11,406 INFO L131 PetriNetUnfolder]: For 455/471 co-relation queries the response was YES. [2022-12-06 04:28:11,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 256 events. 122/256 cut-off events. For 455/471 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1059 event pairs, 13 based on Foata normal form. 27/276 useless extension candidates. Maximal degree in co-relation 962. Up to 100 conditions per place. [2022-12-06 04:28:11,407 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 11 changer transitions 8/49 dead transitions. [2022-12-06 04:28:11,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 361 flow [2022-12-06 04:28:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:28:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:28:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-06 04:28:11,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2022-12-06 04:28:11,408 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 162 flow. Second operand 6 states and 49 transitions. [2022-12-06 04:28:11,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 361 flow [2022-12-06 04:28:11,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 340 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:28:11,409 INFO L231 Difference]: Finished difference. Result has 47 places, 26 transitions, 170 flow [2022-12-06 04:28:11,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=26} [2022-12-06 04:28:11,410 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-06 04:28:11,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:11,410 INFO L89 Accepts]: Start accepts. Operand has 47 places, 26 transitions, 170 flow [2022-12-06 04:28:11,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:11,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:11,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 26 transitions, 170 flow [2022-12-06 04:28:11,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 26 transitions, 170 flow [2022-12-06 04:28:11,419 INFO L130 PetriNetUnfolder]: 11/56 cut-off events. [2022-12-06 04:28:11,419 INFO L131 PetriNetUnfolder]: For 94/100 co-relation queries the response was YES. [2022-12-06 04:28:11,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 56 events. 11/56 cut-off events. For 94/100 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 164 event pairs, 0 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 186. Up to 17 conditions per place. [2022-12-06 04:28:11,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 26 transitions, 170 flow [2022-12-06 04:28:11,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 04:28:11,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] L783-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [618] L842-3-->L845: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_43) 1 0) 0) 0 1) v_~main$tmp_guard0~0_26) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-06 04:28:14,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] L783-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [665] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_154 256) 0))) (let ((.cse7 (= (mod v_~z$r_buff1_thd0~0_148 256) 0)) (.cse8 (= (mod v_~z$w_buff1_used~0_356 256) 0)) (.cse10 (= (mod v_~z$w_buff0_used~0_366 256) 0)) (.cse1 (not .cse9)) (.cse14 (not (= (mod v_~z$w_buff0_used~0_365 256) 0)))) (let ((.cse0 (and .cse1 .cse14)) (.cse2 (not .cse10)) (.cse5 (not .cse8)) (.cse3 (select |v_#memory_int_478| |v_~#z~0.base_231|)) (.cse4 (not .cse7))) (and (= (mod v_~main$tmp_guard1~0_60 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|) (= v_~main$tmp_guard0~0_108 (ite (= (ite (= v_~__unbuffered_cnt~0_199 3) 1 0) 0) 0 1)) (= v_~z$r_buff0_thd0~0_153 (ite .cse0 0 v_~z$r_buff0_thd0~0_154)) (= v_~z$w_buff0_used~0_365 (ite (and .cse1 .cse2) 0 v_~z$w_buff0_used~0_366)) (= (store |v_#memory_int_478| |v_~#z~0.base_231| (store .cse3 |v_~#z~0.offset_231| |v_ULTIMATE.start_main_#t~ite30#1_153|)) |v_#memory_int_477|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|) (= (ite (or .cse0 (and .cse4 .cse5)) 0 v_~z$w_buff1_used~0_356) v_~z$w_buff1_used~0_355) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_196| |v_ULTIMATE.start_main_#t~mem28#1_194|))) (or (and .cse1 .cse2 .cse6 (= v_~z$w_buff0~0_214 |v_ULTIMATE.start_main_#t~ite30#1_153|) (= |v_ULTIMATE.start_main_#t~ite29#1_197| |v_ULTIMATE.start_main_#t~ite29#1_195|)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_195| |v_ULTIMATE.start_main_#t~ite30#1_153|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_195| v_~z$w_buff1~0_222) .cse4 .cse6 .cse5) (and (or .cse7 .cse8) (= |v_ULTIMATE.start_main_#t~mem28#1_194| (select .cse3 |v_~#z~0.offset_231|)) (= |v_ULTIMATE.start_main_#t~ite29#1_195| |v_ULTIMATE.start_main_#t~mem28#1_194|))) (or .cse9 .cse10)))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~mem32#1_167| |v_ULTIMATE.start_main_#t~mem32#1_165|)) (.cse11 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_111 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_167) (not .cse11) (let ((.cse12 (= (mod v_~weak$$choice1~0_152 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_168)) (and (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_164| |v_ULTIMATE.start_main_#t~mem32#1_165|) (= |v_ULTIMATE.start_main_#t~mem32#1_165| (select (select |v_#memory_int_477| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_116) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_116)))))) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_166| |v_ULTIMATE.start_main_#t~ite33#1_164|) .cse11 (= v_~__unbuffered_p0_EAX~0_168 v_~__unbuffered_p0_EAX~0_167)))) (= (mod v_~main$tmp_guard0~0_108 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~z$r_buff1_thd0~0_147 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_153 256) 0)) .cse14) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_355 256) 0)))) 0 v_~z$r_buff1_thd0~0_148)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0) (= v_~main$tmp_guard1~0_60 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_167 1) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~__unbuffered_p0_EBX~0_86 0))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| 0)) (= v_~weak$$choice1~0_152 |v_ULTIMATE.start_main_#t~nondet31#1_97|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_167|, ~#z~0.base=|v_~#z~0.base_231|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_366, ~z$w_buff0~0=v_~z$w_buff0~0_214, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_356, ~z$w_buff1~0=v_~z$w_buff1~0_222, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_97|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_116, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_197|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_168, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_154, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_166|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_116, #memory_int=|v_#memory_int_478|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_111, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_196|} OutVars{~#z~0.base=|v_~#z~0.base_231|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_67|, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_167, ~weak$$choice1~0=v_~weak$$choice1~0_152, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_153, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_147, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_75|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_111, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_78|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_365, ~z$w_buff0~0=v_~z$w_buff0~0_214, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_355, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_108, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_116, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_61|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_152|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_116, #memory_int=|v_#memory_int_477|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~mem32#1_165|, |v_ULTIMATE.start_main_#t~ite30#1_153|, |v_ULTIMATE.start_main_#t~mem28#1_194|, |v_ULTIMATE.start_main_#t~ite29#1_195|, |v_ULTIMATE.start_main_#t~ite33#1_164|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:28:14,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L798-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [665] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_154 256) 0))) (let ((.cse7 (= (mod v_~z$r_buff1_thd0~0_148 256) 0)) (.cse8 (= (mod v_~z$w_buff1_used~0_356 256) 0)) (.cse10 (= (mod v_~z$w_buff0_used~0_366 256) 0)) (.cse1 (not .cse9)) (.cse14 (not (= (mod v_~z$w_buff0_used~0_365 256) 0)))) (let ((.cse0 (and .cse1 .cse14)) (.cse2 (not .cse10)) (.cse5 (not .cse8)) (.cse3 (select |v_#memory_int_478| |v_~#z~0.base_231|)) (.cse4 (not .cse7))) (and (= (mod v_~main$tmp_guard1~0_60 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|) (= v_~main$tmp_guard0~0_108 (ite (= (ite (= v_~__unbuffered_cnt~0_199 3) 1 0) 0) 0 1)) (= v_~z$r_buff0_thd0~0_153 (ite .cse0 0 v_~z$r_buff0_thd0~0_154)) (= v_~z$w_buff0_used~0_365 (ite (and .cse1 .cse2) 0 v_~z$w_buff0_used~0_366)) (= (store |v_#memory_int_478| |v_~#z~0.base_231| (store .cse3 |v_~#z~0.offset_231| |v_ULTIMATE.start_main_#t~ite30#1_153|)) |v_#memory_int_477|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|) (= (ite (or .cse0 (and .cse4 .cse5)) 0 v_~z$w_buff1_used~0_356) v_~z$w_buff1_used~0_355) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_196| |v_ULTIMATE.start_main_#t~mem28#1_194|))) (or (and .cse1 .cse2 .cse6 (= v_~z$w_buff0~0_214 |v_ULTIMATE.start_main_#t~ite30#1_153|) (= |v_ULTIMATE.start_main_#t~ite29#1_197| |v_ULTIMATE.start_main_#t~ite29#1_195|)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_195| |v_ULTIMATE.start_main_#t~ite30#1_153|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_195| v_~z$w_buff1~0_222) .cse4 .cse6 .cse5) (and (or .cse7 .cse8) (= |v_ULTIMATE.start_main_#t~mem28#1_194| (select .cse3 |v_~#z~0.offset_231|)) (= |v_ULTIMATE.start_main_#t~ite29#1_195| |v_ULTIMATE.start_main_#t~mem28#1_194|))) (or .cse9 .cse10)))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~mem32#1_167| |v_ULTIMATE.start_main_#t~mem32#1_165|)) (.cse11 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_111 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_167) (not .cse11) (let ((.cse12 (= (mod v_~weak$$choice1~0_152 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_168)) (and (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_164| |v_ULTIMATE.start_main_#t~mem32#1_165|) (= |v_ULTIMATE.start_main_#t~mem32#1_165| (select (select |v_#memory_int_477| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_116) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_116)))))) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_166| |v_ULTIMATE.start_main_#t~ite33#1_164|) .cse11 (= v_~__unbuffered_p0_EAX~0_168 v_~__unbuffered_p0_EAX~0_167)))) (= (mod v_~main$tmp_guard0~0_108 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~z$r_buff1_thd0~0_147 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_153 256) 0)) .cse14) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_355 256) 0)))) 0 v_~z$r_buff1_thd0~0_148)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0) (= v_~main$tmp_guard1~0_60 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_167 1) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~__unbuffered_p0_EBX~0_86 0))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| 0)) (= v_~weak$$choice1~0_152 |v_ULTIMATE.start_main_#t~nondet31#1_97|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_167|, ~#z~0.base=|v_~#z~0.base_231|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_366, ~z$w_buff0~0=v_~z$w_buff0~0_214, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_356, ~z$w_buff1~0=v_~z$w_buff1~0_222, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_97|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_116, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_197|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_168, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_154, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_166|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_116, #memory_int=|v_#memory_int_478|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_111, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_196|} OutVars{~#z~0.base=|v_~#z~0.base_231|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_67|, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_167, ~weak$$choice1~0=v_~weak$$choice1~0_152, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_153, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_147, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_75|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_111, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_78|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_365, ~z$w_buff0~0=v_~z$w_buff0~0_214, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_355, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_108, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_116, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_61|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_152|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_116, #memory_int=|v_#memory_int_477|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~mem32#1_165|, |v_ULTIMATE.start_main_#t~ite30#1_153|, |v_ULTIMATE.start_main_#t~mem28#1_194|, |v_ULTIMATE.start_main_#t~ite29#1_195|, |v_ULTIMATE.start_main_#t~ite33#1_164|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:28:15,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [663] L812-->P2EXIT: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_108 256) 0))) (let ((.cse7 (= (mod v_~z$r_buff1_thd3~0_104 256) 0)) (.cse8 (= (mod v_~z$w_buff0_used~0_358 256) 0)) (.cse11 (not (= (mod v_~z$w_buff0_used~0_357 256) 0))) (.cse3 (not .cse9)) (.cse6 (= (mod v_~z$w_buff1_used~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_470| |v_~#z~0.base_227|)) (.cse4 (not .cse6)) (.cse10 (and .cse11 .cse3)) (.cse2 (not .cse8)) (.cse5 (not .cse7))) (and (= |v_#memory_int_469| (store |v_#memory_int_470| |v_~#z~0.base_227| (store .cse0 |v_~#z~0.offset_227| |v_P2_#t~ite21_53|))) (= |v_P2Thread1of1ForFork0_#res.offset_31| 0) (let ((.cse1 (= |v_P2Thread1of1ForFork0_#t~mem19_58| |v_P2_#t~mem19_62|))) (or (and (= |v_P2_#t~ite21_53| v_~z$w_buff0~0_210) .cse1 .cse2 .cse3 (= |v_P2_#t~ite20_57| |v_P2Thread1of1ForFork0_#t~ite20_58|)) (and (or (and .cse1 .cse4 (= |v_P2_#t~ite20_57| v_~z$w_buff1~0_218) .cse5) (and (= |v_P2_#t~ite20_57| |v_P2_#t~mem19_62|) (or .cse6 .cse7) (= |v_P2_#t~mem19_62| (select .cse0 |v_~#z~0.offset_227|)))) (= |v_P2_#t~ite20_57| |v_P2_#t~ite21_53|) (or .cse8 .cse9)))) (= v_~z$w_buff1_used~0_347 (ite (or .cse10 (and .cse4 .cse5)) 0 v_~z$w_buff1_used~0_348)) (= (ite .cse10 0 v_~z$r_buff0_thd3~0_108) v_~z$r_buff0_thd3~0_107) (= v_~__unbuffered_cnt~0_195 (+ v_~__unbuffered_cnt~0_196 1)) (= |v_P2Thread1of1ForFork0_#res.base_31| 0) (= v_~z$w_buff0_used~0_357 (ite (and .cse2 .cse3) 0 v_~z$w_buff0_used~0_358)) (= v_~z$r_buff1_thd3~0_103 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_347 256) 0)) .cse5) (and (not (= (mod v_~z$r_buff0_thd3~0_107 256) 0)) .cse11)) 0 v_~z$r_buff1_thd3~0_104)))))) InVars {~#z~0.base=|v_~#z~0.base_227|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_58|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_358, ~z$w_buff0~0=v_~z$w_buff0~0_210, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_104, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_348, #memory_int=|v_#memory_int_470|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_218, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_196, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_58|, ~#z~0.offset=|v_~#z~0.offset_227|} OutVars{~#z~0.base=|v_~#z~0.base_227|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_31|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_357, ~z$w_buff0~0=v_~z$w_buff0~0_210, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_103, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_347, ~z$w_buff1~0=v_~z$w_buff1~0_218, ~#z~0.offset=|v_~#z~0.offset_227|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_31|, #memory_int=|v_#memory_int_469|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_107, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_31|} AuxVars[|v_P2_#t~mem19_62|, |v_P2_#t~ite21_53|, |v_P2_#t~ite20_57|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite21, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, #memory_int, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#res.offset] and [665] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_154 256) 0))) (let ((.cse7 (= (mod v_~z$r_buff1_thd0~0_148 256) 0)) (.cse8 (= (mod v_~z$w_buff1_used~0_356 256) 0)) (.cse10 (= (mod v_~z$w_buff0_used~0_366 256) 0)) (.cse1 (not .cse9)) (.cse14 (not (= (mod v_~z$w_buff0_used~0_365 256) 0)))) (let ((.cse0 (and .cse1 .cse14)) (.cse2 (not .cse10)) (.cse5 (not .cse8)) (.cse3 (select |v_#memory_int_478| |v_~#z~0.base_231|)) (.cse4 (not .cse7))) (and (= (mod v_~main$tmp_guard1~0_60 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|) (= v_~main$tmp_guard0~0_108 (ite (= (ite (= v_~__unbuffered_cnt~0_199 3) 1 0) 0) 0 1)) (= v_~z$r_buff0_thd0~0_153 (ite .cse0 0 v_~z$r_buff0_thd0~0_154)) (= v_~z$w_buff0_used~0_365 (ite (and .cse1 .cse2) 0 v_~z$w_buff0_used~0_366)) (= (store |v_#memory_int_478| |v_~#z~0.base_231| (store .cse3 |v_~#z~0.offset_231| |v_ULTIMATE.start_main_#t~ite30#1_153|)) |v_#memory_int_477|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|) (= (ite (or .cse0 (and .cse4 .cse5)) 0 v_~z$w_buff1_used~0_356) v_~z$w_buff1_used~0_355) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_196| |v_ULTIMATE.start_main_#t~mem28#1_194|))) (or (and .cse1 .cse2 .cse6 (= v_~z$w_buff0~0_214 |v_ULTIMATE.start_main_#t~ite30#1_153|) (= |v_ULTIMATE.start_main_#t~ite29#1_197| |v_ULTIMATE.start_main_#t~ite29#1_195|)) (and (= |v_ULTIMATE.start_main_#t~ite29#1_195| |v_ULTIMATE.start_main_#t~ite30#1_153|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_195| v_~z$w_buff1~0_222) .cse4 .cse6 .cse5) (and (or .cse7 .cse8) (= |v_ULTIMATE.start_main_#t~mem28#1_194| (select .cse3 |v_~#z~0.offset_231|)) (= |v_ULTIMATE.start_main_#t~ite29#1_195| |v_ULTIMATE.start_main_#t~mem28#1_194|))) (or .cse9 .cse10)))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~mem32#1_167| |v_ULTIMATE.start_main_#t~mem32#1_165|)) (.cse11 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_111 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_167) (not .cse11) (let ((.cse12 (= (mod v_~weak$$choice1~0_152 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_168)) (and (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_164| |v_ULTIMATE.start_main_#t~mem32#1_165|) (= |v_ULTIMATE.start_main_#t~mem32#1_165| (select (select |v_#memory_int_477| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_116) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_116)))))) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_166| |v_ULTIMATE.start_main_#t~ite33#1_164|) .cse11 (= v_~__unbuffered_p0_EAX~0_168 v_~__unbuffered_p0_EAX~0_167)))) (= (mod v_~main$tmp_guard0~0_108 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~z$r_buff1_thd0~0_147 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_153 256) 0)) .cse14) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_355 256) 0)))) 0 v_~z$r_buff1_thd0~0_148)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0) (= v_~main$tmp_guard1~0_60 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_167 1) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~__unbuffered_p0_EBX~0_86 0))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| 0)) (= v_~weak$$choice1~0_152 |v_ULTIMATE.start_main_#t~nondet31#1_97|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_167|, ~#z~0.base=|v_~#z~0.base_231|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_366, ~z$w_buff0~0=v_~z$w_buff0~0_214, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_356, ~z$w_buff1~0=v_~z$w_buff1~0_222, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_97|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_116, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_197|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_168, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_154, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_166|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_116, #memory_int=|v_#memory_int_478|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_111, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_196|} OutVars{~#z~0.base=|v_~#z~0.base_231|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_67|, ~z$w_buff1~0=v_~z$w_buff1~0_222, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_167, ~weak$$choice1~0=v_~weak$$choice1~0_152, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_153, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_147, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_75|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_111, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_78|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_365, ~z$w_buff0~0=v_~z$w_buff0~0_214, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_355, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_108, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_116, ~#z~0.offset=|v_~#z~0.offset_231|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_61|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_152|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_116, #memory_int=|v_#memory_int_477|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~mem32#1_165|, |v_ULTIMATE.start_main_#t~ite30#1_153|, |v_ULTIMATE.start_main_#t~mem28#1_194|, |v_ULTIMATE.start_main_#t~ite29#1_195|, |v_ULTIMATE.start_main_#t~ite33#1_164|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:28:17,462 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 04:28:17,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6053 [2022-12-06 04:28:17,463 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 21 transitions, 163 flow [2022-12-06 04:28:17,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:17,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:17,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:17,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:28:17,463 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:28:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:17,464 INFO L85 PathProgramCache]: Analyzing trace with hash 668577208, now seen corresponding path program 1 times [2022-12-06 04:28:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:17,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204261610] [2022-12-06 04:28:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:28:17,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:28:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:28:17,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:28:17,591 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:28:17,592 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:28:17,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:28:17,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:28:17,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:28:17,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:28:17,594 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:17,599 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:28:17,599 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:28:17,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:28:17 BasicIcfg [2022-12-06 04:28:17,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:28:17,674 INFO L158 Benchmark]: Toolchain (without parser) took 21478.30ms. Allocated memory was 221.2MB in the beginning and 725.6MB in the end (delta: 504.4MB). Free memory was 195.1MB in the beginning and 539.8MB in the end (delta: -344.7MB). Peak memory consumption was 160.6MB. Max. memory is 8.0GB. [2022-12-06 04:28:17,674 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 221.2MB. Free memory is still 197.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:28:17,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.77ms. Allocated memory is still 221.2MB. Free memory was 195.1MB in the beginning and 168.5MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:28:17,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.68ms. Allocated memory is still 221.2MB. Free memory was 168.5MB in the beginning and 166.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:28:17,674 INFO L158 Benchmark]: Boogie Preprocessor took 36.04ms. Allocated memory is still 221.2MB. Free memory was 166.2MB in the beginning and 164.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:28:17,675 INFO L158 Benchmark]: RCFGBuilder took 731.26ms. Allocated memory is still 221.2MB. Free memory was 164.1MB in the beginning and 143.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. [2022-12-06 04:28:17,675 INFO L158 Benchmark]: TraceAbstraction took 20183.65ms. Allocated memory was 221.2MB in the beginning and 725.6MB in the end (delta: 504.4MB). Free memory was 142.6MB in the beginning and 539.8MB in the end (delta: -397.2MB). Peak memory consumption was 107.7MB. Max. memory is 8.0GB. [2022-12-06 04:28:17,676 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.13ms. Allocated memory is still 221.2MB. Free memory is still 197.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 478.77ms. Allocated memory is still 221.2MB. Free memory was 195.1MB in the beginning and 168.5MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.68ms. Allocated memory is still 221.2MB. Free memory was 168.5MB in the beginning and 166.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.04ms. Allocated memory is still 221.2MB. Free memory was 166.2MB in the beginning and 164.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 731.26ms. Allocated memory is still 221.2MB. Free memory was 164.1MB in the beginning and 143.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. * TraceAbstraction took 20183.65ms. Allocated memory was 221.2MB in the beginning and 725.6MB in the end (delta: 504.4MB). Free memory was 142.6MB in the beginning and 539.8MB in the end (delta: -397.2MB). Peak memory consumption was 107.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 119 PlacesBefore, 29 PlacesAfterwards, 110 TransitionsBefore, 20 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 923, independent: 862, independent conditional: 862, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 923, independent: 862, independent conditional: 0, independent unconditional: 862, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 923, independent: 862, independent conditional: 0, independent unconditional: 862, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 923, independent: 862, independent conditional: 0, independent unconditional: 862, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 691, independent: 664, independent conditional: 0, independent unconditional: 664, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 691, independent: 650, independent conditional: 0, independent unconditional: 650, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 250, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 225, dependent conditional: 0, dependent unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 923, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 691, unknown conditional: 0, unknown unconditional: 691] , Statistics on independence cache: Total cache size (in pairs): 1003, Positive cache size: 976, Positive conditional cache size: 0, Positive unconditional cache size: 976, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 62, unknown conditional: 0, unknown unconditional: 62] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 66, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 109, independent: 82, independent conditional: 11, independent unconditional: 71, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 17, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 0, dependent unconditional: 2, 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: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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, 30 PlacesBefore, 30 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 27, independent conditional: 27, 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: 39, independent: 27, independent conditional: 2, independent unconditional: 25, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 27, independent conditional: 0, independent unconditional: 27, 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: 39, independent: 27, independent conditional: 0, independent unconditional: 27, 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: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 86, independent conditional: 86, 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: 108, independent: 86, independent conditional: 38, independent unconditional: 48, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 86, independent conditional: 33, independent unconditional: 53, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 86, independent conditional: 33, independent unconditional: 53, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 7, 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: 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: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 95, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 74, independent conditional: 26, independent unconditional: 48, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 12, unknown conditional: 7, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 85, Positive conditional cache size: 7, Positive unconditional cache size: 78, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 36, independent unconditional: 58, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 94, independent conditional: 26, independent unconditional: 68, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 26, independent unconditional: 68, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 86, independent conditional: 24, independent unconditional: 62, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 97, Positive conditional cache size: 9, Positive unconditional cache size: 88, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 26, 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: 36, independent: 26, independent conditional: 18, independent unconditional: 8, 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: 36, independent: 26, independent conditional: 4, independent unconditional: 22, 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: 36, independent: 26, independent conditional: 4, independent unconditional: 22, 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: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 18, independent conditional: 4, independent unconditional: 14, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 105, Positive conditional cache size: 9, Positive unconditional cache size: 96, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 30, independent conditional: 30, 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: 42, independent: 30, independent conditional: 15, independent unconditional: 15, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 29, independent conditional: 9, independent unconditional: 20, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 106, Positive conditional cache size: 10, Positive unconditional cache size: 96, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 15, independent conditional: 11, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 15, independent conditional: 11, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 22, independent: 13, independent conditional: 9, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 108, Positive conditional cache size: 12, Positive unconditional cache size: 96, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 46 PlacesBefore, 42 PlacesAfterwards, 26 TransitionsBefore, 21 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 165, Positive conditional cache size: 22, Positive unconditional cache size: 143, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t2049; [L838] FCALL, FORK 0 pthread_create(&t2049, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2049, ((void *)0), P0, ((void *)0))=0, t2049={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t2050; [L840] FCALL, FORK 0 pthread_create(&t2050, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2050, ((void *)0), P1, ((void *)0))=1, t2049={7:0}, t2050={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t2051; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 1 __unbuffered_p0_EBX = x [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L794] 2 x = 1 [L797] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t2051, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2051, ((void *)0), P2, ((void *)0))=2, t2049={7:0}, t2050={5:0}, t2051={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 __unbuffered_p2_EAX = y [L812] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 3 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 3 !(!cond) [L846] RET 3 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 3 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 3 \read(z) [L848] EXPR 3 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 3 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 3 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 3 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L855] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 3 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 3 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 3 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L859] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 3 !expression [L19] 3 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 473 IncrementalHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 2 mSDtfsCounter, 473 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=8, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:28:17,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...