/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:36:26,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:36:26,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:36:26,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:36:26,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:36:26,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:36:26,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:36:26,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:36:26,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:36:26,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:36:26,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:36:26,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:36:26,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:36:26,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:36:26,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:36:26,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:36:26,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:36:26,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:36:26,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:36:26,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:36:26,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:36:26,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:36:26,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:36:26,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:36:26,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:36:26,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:36:26,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:36:26,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:36:26,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:36:26,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:36:26,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:36:26,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:36:26,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:36:26,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:36:26,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:36:26,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:36:26,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:36:26,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:36:26,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:36:26,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:36:26,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:36:26,755 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:36:26,780 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:36:26,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:36:26,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:36:26,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:36:26,782 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:36:26,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:36:26,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:36:26,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:36:26,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:36:26,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:36:26,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:36:26,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:36:26,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:36:26,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:36:26,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:36:26,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:36:26,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:36:26,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:36:26,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:36:26,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:36:26,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:36:26,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:36:26,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:36:26,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:36:26,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:36:26,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:36:26,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:36:26,785 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:36:26,785 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 06:36:27,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:36:27,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:36:27,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:36:27,089 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:36:27,090 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:36:27,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2022-12-06 06:36:28,069 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:36:28,257 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:36:28,258 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2022-12-06 06:36:28,267 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c770e4b51/7dff6f9883e74d778f8731c6c9919fa0/FLAGf285bb338 [2022-12-06 06:36:28,279 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c770e4b51/7dff6f9883e74d778f8731c6c9919fa0 [2022-12-06 06:36:28,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:36:28,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:36:28,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:36:28,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:36:28,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:36:28,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a2f927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28, skipping insertion in model container [2022-12-06 06:36:28,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:36:28,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:36:28,413 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/safe007_power.opt-thin001_power.opt.i[969,982] [2022-12-06 06:36:28,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:36:28,605 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:36:28,614 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/safe007_power.opt-thin001_power.opt.i[969,982] [2022-12-06 06:36:28,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:28,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:28,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:36:28,699 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:36:28,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28 WrapperNode [2022-12-06 06:36:28,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:36:28,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:36:28,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:36:28,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:36:28,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,753 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-12-06 06:36:28,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:36:28,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:36:28,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:36:28,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:36:28,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,779 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:36:28,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:36:28,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:36:28,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:36:28,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (1/1) ... [2022-12-06 06:36:28,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:36:28,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:36:28,814 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 06:36:28,817 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 06:36:28,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:36:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:36:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:36:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:36:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:36:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:36:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:36:28,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:36:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:36:28,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:36:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:36:28,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:36:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:36:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:36:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:36:28,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:36:28,853 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 06:36:29,029 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:36:29,030 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:36:29,376 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:36:29,650 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:36:29,651 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:36:29,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:36:29 BoogieIcfgContainer [2022-12-06 06:36:29,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:36:29,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:36:29,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:36:29,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:36:29,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:36:28" (1/3) ... [2022-12-06 06:36:29,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25aeafbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:36:29, skipping insertion in model container [2022-12-06 06:36:29,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:28" (2/3) ... [2022-12-06 06:36:29,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25aeafbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:36:29, skipping insertion in model container [2022-12-06 06:36:29,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:36:29" (3/3) ... [2022-12-06 06:36:29,658 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2022-12-06 06:36:29,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:36:29,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:36:29,671 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:36:29,723 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:36:29,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 06:36:29,812 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 06:36:29,813 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:36:29,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:36:29,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 06:36:29,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-06 06:36:29,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:29,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 06:36:29,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-06 06:36:29,882 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 06:36:29,883 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:36:29,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:36:29,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 06:36:29,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-06 06:36:38,279 INFO L203 LiptonReduction]: Total number of compositions: 102 [2022-12-06 06:36:38,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:36:38,293 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;@8e09593, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:36:38,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:36:38,296 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 06:36:38,296 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:36:38,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:38,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:36:38,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1555944793, now seen corresponding path program 1 times [2022-12-06 06:36:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:38,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512863241] [2022-12-06 06:36:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:38,640 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 06:36:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:38,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512863241] [2022-12-06 06:36:38,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512863241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:38,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:38,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:36:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088187696] [2022-12-06 06:36:38,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:38,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:36:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:38,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:36:38,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:36:38,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:36:38,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 06:36:38,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:38,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:36:38,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:38,997 INFO L130 PetriNetUnfolder]: 809/1229 cut-off events. [2022-12-06 06:36:38,998 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:36:39,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 1229 events. 809/1229 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5845 event pairs, 278 based on Foata normal form. 0/1081 useless extension candidates. Maximal degree in co-relation 2482. Up to 775 conditions per place. [2022-12-06 06:36:39,033 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 26 selfloop transitions, 2 changer transitions 6/36 dead transitions. [2022-12-06 06:36:39,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 152 flow [2022-12-06 06:36:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:36:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:36:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:36:39,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-06 06:36:39,056 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:36:39,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 152 flow [2022-12-06 06:36:39,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:36:39,060 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-06 06:36:39,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-06 06:36:39,079 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 06:36:39,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:39,080 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 50 flow [2022-12-06 06:36:39,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:39,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:39,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 50 flow [2022-12-06 06:36:39,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:36:39,095 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:36:39,095 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:36:39,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:36:39,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:36:39,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:36:39,250 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:36:39,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 06:36:39,252 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 06:36:39,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 06:36:39,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:39,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:39,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:36:39,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1908787455, now seen corresponding path program 1 times [2022-12-06 06:36:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:39,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167292048] [2022-12-06 06:36:39,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:39,452 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 06:36:39,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:39,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167292048] [2022-12-06 06:36:39,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167292048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:39,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:39,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:36:39,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852473791] [2022-12-06 06:36:39,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:39,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:36:39,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:39,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:36:39,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:36:39,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:36:39,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 06:36:39,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:39,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:36:39,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:39,613 INFO L130 PetriNetUnfolder]: 492/762 cut-off events. [2022-12-06 06:36:39,613 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 06:36:39,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 762 events. 492/762 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3349 event pairs, 84 based on Foata normal form. 12/770 useless extension candidates. Maximal degree in co-relation 1605. Up to 661 conditions per place. [2022-12-06 06:36:39,616 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 06:36:39,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 124 flow [2022-12-06 06:36:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:36:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:36:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:36:39,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 06:36:39,618 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:36:39,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 124 flow [2022-12-06 06:36:39,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:36:39,621 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-06 06:36:39,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-06 06:36:39,621 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2022-12-06 06:36:39,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:39,621 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 06:36:39,622 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:39,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:39,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 06:36:39,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 06:36:39,626 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:36:39,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:36:39,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:36:39,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 06:36:39,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 06:36:39,636 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:36:39,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 06:36:39,637 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 06:36:39,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 06:36:39,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:39,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:39,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:36:39,638 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:39,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash -957132081, now seen corresponding path program 1 times [2022-12-06 06:36:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:39,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601959753] [2022-12-06 06:36:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:39,736 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 06:36:39,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:39,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601959753] [2022-12-06 06:36:39,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601959753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:39,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:39,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:36:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927908517] [2022-12-06 06:36:39,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:39,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:36:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:39,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:36:39,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:36:39,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:36:39,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:36:39,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:39,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:36:39,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:39,938 INFO L130 PetriNetUnfolder]: 785/1224 cut-off events. [2022-12-06 06:36:39,938 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-06 06:36:39,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 1224 events. 785/1224 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5697 event pairs, 259 based on Foata normal form. 64/1280 useless extension candidates. Maximal degree in co-relation 2646. Up to 422 conditions per place. [2022-12-06 06:36:39,942 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 33 selfloop transitions, 3 changer transitions 7/44 dead transitions. [2022-12-06 06:36:39,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 197 flow [2022-12-06 06:36:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:36:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:36:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 06:36:39,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6125 [2022-12-06 06:36:39,944 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 49 transitions. [2022-12-06 06:36:39,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 197 flow [2022-12-06 06:36:39,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:36:39,945 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 64 flow [2022-12-06 06:36:39,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2022-12-06 06:36:39,945 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-06 06:36:39,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:39,946 INFO L89 Accepts]: Start accepts. Operand has 33 places, 20 transitions, 64 flow [2022-12-06 06:36:39,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:39,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:39,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 20 transitions, 64 flow [2022-12-06 06:36:39,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 20 transitions, 64 flow [2022-12-06 06:36:39,950 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:36:39,950 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 06:36:39,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 20 events. 0/20 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:36:39,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 20 transitions, 64 flow [2022-12-06 06:36:39,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-06 06:36:39,984 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:36:39,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 06:36:39,985 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 62 flow [2022-12-06 06:36:39,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:36:39,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:39,986 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:39,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:36:39,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1600782523, now seen corresponding path program 1 times [2022-12-06 06:36:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:39,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491690109] [2022-12-06 06:36:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:40,201 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 06:36:40,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:40,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491690109] [2022-12-06 06:36:40,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491690109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:40,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:40,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:36:40,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108361331] [2022-12-06 06:36:40,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:40,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:36:40,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:40,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:36:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:36:40,205 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:36:40,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:36:40,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:40,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:36:40,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:40,327 INFO L130 PetriNetUnfolder]: 302/520 cut-off events. [2022-12-06 06:36:40,327 INFO L131 PetriNetUnfolder]: For 247/247 co-relation queries the response was YES. [2022-12-06 06:36:40,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 520 events. 302/520 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2001 event pairs, 80 based on Foata normal form. 8/528 useless extension candidates. Maximal degree in co-relation 1219. Up to 362 conditions per place. [2022-12-06 06:36:40,332 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-06 06:36:40,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 138 flow [2022-12-06 06:36:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:36:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:36:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 06:36:40,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 06:36:40,336 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 62 flow. Second operand 3 states and 30 transitions. [2022-12-06 06:36:40,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 138 flow [2022-12-06 06:36:40,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 121 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:36:40,340 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 58 flow [2022-12-06 06:36:40,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, 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=58, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-06 06:36:40,344 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-06 06:36:40,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:40,344 INFO L89 Accepts]: Start accepts. Operand has 31 places, 19 transitions, 58 flow [2022-12-06 06:36:40,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:40,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:40,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 19 transitions, 58 flow [2022-12-06 06:36:40,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 58 flow [2022-12-06 06:36:40,352 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:36:40,353 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:36:40,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 19 events. 0/19 cut-off events. For 1/1 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 06:36:40,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 19 transitions, 58 flow [2022-12-06 06:36:40,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 06:36:40,356 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:36:40,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:36:40,365 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 58 flow [2022-12-06 06:36:40,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:36:40,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:40,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:40,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:36:40,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash -282477988, now seen corresponding path program 1 times [2022-12-06 06:36:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:40,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168117699] [2022-12-06 06:36:40,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:40,565 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 06:36:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:40,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168117699] [2022-12-06 06:36:40,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168117699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:40,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:40,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:36:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683643713] [2022-12-06 06:36:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:40,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:36:40,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:36:40,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:36:40,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:36:40,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 58 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 06:36:40,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:40,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:36:40,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:40,770 INFO L130 PetriNetUnfolder]: 513/821 cut-off events. [2022-12-06 06:36:40,770 INFO L131 PetriNetUnfolder]: For 214/214 co-relation queries the response was YES. [2022-12-06 06:36:40,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 821 events. 513/821 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3163 event pairs, 194 based on Foata normal form. 32/853 useless extension candidates. Maximal degree in co-relation 1851. Up to 317 conditions per place. [2022-12-06 06:36:40,773 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 22 selfloop transitions, 3 changer transitions 11/36 dead transitions. [2022-12-06 06:36:40,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 169 flow [2022-12-06 06:36:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:36:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:36:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 06:36:40,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:36:40,775 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 58 flow. Second operand 4 states and 38 transitions. [2022-12-06 06:36:40,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 169 flow [2022-12-06 06:36:40,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:36:40,777 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 68 flow [2022-12-06 06:36:40,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=68, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2022-12-06 06:36:40,778 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2022-12-06 06:36:40,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:40,778 INFO L89 Accepts]: Start accepts. Operand has 34 places, 19 transitions, 68 flow [2022-12-06 06:36:40,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:40,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:40,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 19 transitions, 68 flow [2022-12-06 06:36:40,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 19 transitions, 68 flow [2022-12-06 06:36:40,784 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:36:40,784 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 06:36:40,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 19 events. 0/19 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 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 06:36:40,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 19 transitions, 68 flow [2022-12-06 06:36:40,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-06 06:36:41,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [758] $Ultimate##0-->L766: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~x~0_39 1) (= v_~z~0_43 v_~__unbuffered_p0_EAX~0_69) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~z~0=v_~z~0_43, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_69, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~z~0=v_~z~0_43, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_39, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [698] $Ultimate##0-->L778: Formula: (and (= v_~__unbuffered_p1_EAX~0_28 v_~x~0_9) (= |v_P1Thread1of1ForFork2_~arg#1.base_5| |v_P1Thread1of1ForFork2_#in~arg#1.base_5|) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_5| |v_P1Thread1of1ForFork2_~arg#1.offset_5|)) InVars {P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_5|, ~x~0=v_~x~0_9, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_5|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_5|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_5|, ~x~0=v_~x~0_9, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 06:36:41,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L826: Formula: (let ((.cse1 (mod v_~y$w_buff0_used~0_412 256)) (.cse10 (mod v_~weak$$choice0~0_113 256)) (.cse21 (= (mod v_~y$w_buff0_used~0_411 256) 0)) (.cse7 (= (mod v_~y$r_buff0_thd3~0_232 256) 0))) (let ((.cse3 (not .cse7)) (.cse23 (not .cse21)) (.cse24 (= (mod v_~weak$$choice2~0_86 256) 0)) (.cse19 (= .cse10 0)) (.cse18 (= (mod v_~y$w_buff1_used~0_389 256) 0)) (.cse20 (select |v_#memory_int_417| |v_~#y~0.base_212|)) (.cse2 (= .cse1 0))) (let ((.cse4 (not .cse2)) (.cse8 (= (mod v_~weak$$choice1~0_134 256) 0)) (.cse16 (select .cse20 |v_~#y~0.offset_212|)) (.cse6 (not .cse18)) (.cse9 (not .cse19)) (.cse0 (not .cse24)) (.cse22 (and .cse3 .cse23)) (.cse26 (not (= (mod v_~y$w_buff1_used~0_388 256) 0))) (.cse5 (= (mod v_~y$r_buff1_thd3~0_235 256) 0))) (and (= (ite (= (ite .cse0 .cse1 (ite .cse2 .cse1 (ite (and .cse3 .cse4) 0 (ite (and .cse5 .cse4 .cse6 .cse7) (ite (or .cse8 .cse9) 1 0) .cse10)))) 0) 0 1) v_~y$w_buff0_used~0_411) (= v_~weak$$choice1~0_134 |v_P2Thread1of1ForFork0_#t~nondet9_42|) (let ((.cse11 (= |v_P2_#t~ite15_71| |v_P2Thread1of1ForFork0_#t~ite15_42|)) (.cse12 (= |v_P2_#t~ite12_75| |v_P2Thread1of1ForFork0_#t~ite12_42|)) (.cse13 (= |v_P2_#t~ite14_89| |v_P2Thread1of1ForFork0_#t~ite14_42|)) (.cse14 (= |v_P2_#t~ite16_69| |v_P2Thread1of1ForFork0_#t~ite16_42|)) (.cse15 (= |v_P2Thread1of1ForFork0_#t~mem13_42| |v_P2_#t~mem13_92|)) (.cse17 (= |v_P2Thread1of1ForFork0_#t~mem11_42| |v_P2_#t~mem11_76|))) (or (and (= |v_P2_#t~mem10_56| v_~__unbuffered_p2_EAX~0_129) .cse11 .cse12 .cse13 .cse2 .cse14 .cse15 (= .cse16 |v_P2_#t~mem10_56|) .cse17 (= |v_P2_#t~ite17_59| |v_P2Thread1of1ForFork0_#t~ite17_42|)) (and .cse4 (= |v_P2Thread1of1ForFork0_#t~mem10_42| |v_P2_#t~mem10_56|) (= |v_P2_#t~ite17_59| v_~__unbuffered_p2_EAX~0_129) (or (and (= |v_P2_#t~ite16_69| |v_P2_#t~ite17_59|) .cse7 (or (and (or (and (= |v_P2_#t~ite15_71| (ite .cse9 v_~y$w_buff1~0_215 v_~y$w_buff0~0_230)) .cse6 .cse13 .cse15) (and .cse18 (= |v_P2_#t~ite15_71| |v_P2_#t~ite14_89|) (or (and (= |v_P2_#t~ite14_89| v_~y$w_buff0~0_230) .cse15 .cse9) (and .cse19 (= |v_P2_#t~ite14_89| |v_P2_#t~mem13_92|) (= .cse16 |v_P2_#t~mem13_92|))))) (or .cse18 (not .cse5)) .cse12 .cse17 (= |v_P2_#t~ite15_71| |v_P2_#t~ite16_69|)) (and .cse11 .cse5 .cse6 .cse13 .cse15 (or (and (= .cse16 |v_P2_#t~mem11_76|) .cse9 (= |v_P2_#t~ite12_75| |v_P2_#t~mem11_76|)) (and .cse19 (= |v_P2_#t~ite12_75| (ite (not .cse8) v_~y$w_buff0~0_230 v_~y$w_buff1~0_215)) .cse17)) (= |v_P2_#t~ite16_69| |v_P2_#t~ite12_75|)))) (and .cse3 .cse11 .cse12 (= |v_P2_#t~ite17_59| v_~y$w_buff0~0_230) .cse13 .cse14 .cse15 .cse17))))) (= (store |v_#memory_int_417| |v_~#y~0.base_212| (store .cse20 |v_~#y~0.offset_212| |v_P2_#t~ite21_51|)) |v_#memory_int_416|) (= 0 v_~y$flush_delayed~0_74) (= v_~weak$$choice0~0_113 |v_P2Thread1of1ForFork0_#t~nondet6_42|) (= v_~y$mem_tmp~0_50 .cse16) (= (ite .cse0 v_~y$w_buff1_used~0_389 (ite .cse21 v_~y$w_buff1_used~0_389 (ite .cse22 0 (ite (and .cse5 .cse6 .cse7 .cse23) v_~weak$$choice0~0_113 0)))) v_~y$w_buff1_used~0_388) (= v_~z~0_51 1) (or (and (= |v_P2_#t~ite21_51| |v_P2_#t~mem20_56|) .cse24 (= |v_P2_#t~mem20_56| v_~__unbuffered_p2_EAX~0_129)) (and (= |v_P2Thread1of1ForFork0_#t~mem20_42| |v_P2_#t~mem20_56|) .cse0 (= |v_P2_#t~ite21_51| v_~y$mem_tmp~0_50))) (= v_~y$w_buff1~0_215 v_~y$w_buff1~0_214) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= v_~__unbuffered_p2_EAX$read_delayed~0_89 1) (= v_~weak$$choice2~0_86 |v_P2Thread1of1ForFork0_#t~nondet7_42|) (= v_~y$r_buff1_thd3~0_234 (ite .cse0 v_~y$r_buff1_thd3~0_235 (ite .cse21 v_~y$r_buff1_thd3~0_235 (let ((.cse25 (= (mod v_~y$r_buff0_thd3~0_231 256) 0))) (ite (and .cse23 (not .cse25)) 0 (ite (and .cse26 .cse5 .cse23 .cse25) (ite .cse9 v_~y$r_buff1_thd3~0_235 0) 0)))))) (= |v_~#y~0.offset_212| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_92) (= v_~y$w_buff0~0_229 v_~y$w_buff0~0_230) (= (ite .cse0 v_~y$r_buff0_thd3~0_232 (ite .cse21 v_~y$r_buff0_thd3~0_232 (ite .cse22 0 (ite (and .cse26 .cse5 .cse7 .cse23) v_~y$r_buff0_thd3~0_232 0)))) v_~y$r_buff0_thd3~0_231) (= |v_~#y~0.base_212| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_92) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23))))) InVars {~#y~0.offset=|v_~#y~0.offset_212|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_412, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_42|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_42|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_42|, ~#y~0.base=|v_~#y~0.base_212|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_42|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_42|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_42|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_235, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_42|, ~y$w_buff1~0=v_~y$w_buff1~0_215, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_232, ~y$w_buff0~0=v_~y$w_buff0~0_230, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_42|, #memory_int=|v_#memory_int_417|, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_42|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_42|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_42|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_389, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_42|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_23|, ~#y~0.offset=|v_~#y~0.offset_212|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_411, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_92, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_92, ~#y~0.base=|v_~#y~0.base_212|, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~weak$$choice1~0=v_~weak$$choice1~0_134, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_234, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_231, ~y$w_buff0~0=v_~y$w_buff0~0_229, ~y$flush_delayed~0=v_~y$flush_delayed~0_74, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_129, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_23|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~weak$$choice0~0=v_~weak$$choice0~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_214, #memory_int=|v_#memory_int_416|, ~z~0=v_~z~0_51, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_23|, ~weak$$choice2~0=v_~weak$$choice2~0_86, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_388} AuxVars[|v_P2_#t~ite21_51|, |v_P2_#t~mem13_92|, |v_P2_#t~ite15_71|, |v_P2_#t~ite17_59|, |v_P2_#t~mem11_76|, |v_P2_#t~ite14_89|, |v_P2_#t~ite16_69|, |v_P2_#t~mem20_56|, |v_P2_#t~ite12_75|, |v_P2_#t~mem10_56|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [760] $Ultimate##0-->L778: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_17| |v_P1Thread1of1ForFork2_~arg#1.offset_17|) (= v_~x~0_45 v_~__unbuffered_p1_EAX~0_69) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~x~0_45 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_17| |v_P1Thread1of1ForFork2_~arg#1.base_17|) (= v_~z~0_53 v_~__unbuffered_p0_EAX~0_75)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~z~0=v_~z~0_53, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_17|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_17|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_17|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_75, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~z~0=v_~z~0_53, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_17|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_17|, ~x~0=v_~x~0_45, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork2_~arg#1.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 06:36:43,262 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:36:43,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2487 [2022-12-06 06:36:43,265 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 16 transitions, 62 flow [2022-12-06 06:36:43,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 06:36:43,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:43,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:43,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:36:43,266 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash -955311978, now seen corresponding path program 1 times [2022-12-06 06:36:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:43,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203480175] [2022-12-06 06:36:43,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:43,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:44,239 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 06:36:44,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:44,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203480175] [2022-12-06 06:36:44,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203480175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:44,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:44,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:36:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691185734] [2022-12-06 06:36:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:44,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:36:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:44,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:36:44,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:36:44,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 06:36:44,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 16 transitions, 62 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:44,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:44,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 06:36:44,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:44,400 INFO L130 PetriNetUnfolder]: 185/301 cut-off events. [2022-12-06 06:36:44,400 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-12-06 06:36:44,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 301 events. 185/301 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 993 event pairs, 45 based on Foata normal form. 4/305 useless extension candidates. Maximal degree in co-relation 719. Up to 239 conditions per place. [2022-12-06 06:36:44,402 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 22 selfloop transitions, 9 changer transitions 0/31 dead transitions. [2022-12-06 06:36:44,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 165 flow [2022-12-06 06:36:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:36:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:36:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-06 06:36:44,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 06:36:44,403 INFO L175 Difference]: Start difference. First operand has 31 places, 16 transitions, 62 flow. Second operand 5 states and 32 transitions. [2022-12-06 06:36:44,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 165 flow [2022-12-06 06:36:44,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 137 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-06 06:36:44,405 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 104 flow [2022-12-06 06:36:44,405 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-06 06:36:44,407 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-06 06:36:44,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:44,407 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 104 flow [2022-12-06 06:36:44,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:44,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:44,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 104 flow [2022-12-06 06:36:44,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 104 flow [2022-12-06 06:36:44,415 INFO L130 PetriNetUnfolder]: 11/49 cut-off events. [2022-12-06 06:36:44,416 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 06:36:44,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 49 events. 11/49 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 158 event pairs, 1 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 105. Up to 18 conditions per place. [2022-12-06 06:36:44,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 104 flow [2022-12-06 06:36:44,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 06:36:44,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] $Ultimate##0-->L778: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd3~0_236 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_415 256) 0)) (.cse23 (mod v_~y$w_buff0_used~0_416 256)) (.cse24 (mod v_~weak$$choice0~0_115 256))) (let ((.cse26 (= (mod v_~weak$$choice2~0_88 256) 0)) (.cse25 (select |v_#memory_int_421| |v_~#y~0.base_214|)) (.cse19 (= .cse24 0)) (.cse12 (= .cse23 0)) (.cse21 (= (mod v_~y$w_buff1_used~0_393 256) 0)) (.cse4 (not .cse1)) (.cse22 (not .cse6))) (let ((.cse2 (and .cse4 .cse22)) (.cse5 (not (= (mod v_~y$w_buff1_used~0_392 256) 0))) (.cse3 (= (mod v_~y$r_buff1_thd3~0_239 256) 0)) (.cse7 (not .cse21)) (.cse18 (not .cse12)) (.cse9 (not .cse19)) (.cse20 (= (mod v_~weak$$choice1~0_136 256) 0)) (.cse17 (select .cse25 |v_~#y~0.offset_214|)) (.cse0 (not .cse26))) (and (= v_~x~0_47 v_~__unbuffered_p1_EAX~0_71) (= (ite .cse0 v_~y$r_buff0_thd3~0_236 (ite .cse1 v_~y$r_buff0_thd3~0_236 (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 .cse6) v_~y$r_buff0_thd3~0_236 0)))) v_~y$r_buff0_thd3~0_235) (= (ite .cse0 v_~y$w_buff1_used~0_393 (ite .cse1 v_~y$w_buff1_used~0_393 (ite .cse2 0 (ite (and .cse3 .cse7 .cse4 .cse6) v_~weak$$choice0~0_115 0)))) v_~y$w_buff1_used~0_392) (= (ite .cse0 v_~y$r_buff1_thd3~0_239 (ite .cse1 v_~y$r_buff1_thd3~0_239 (let ((.cse8 (= (mod v_~y$r_buff0_thd3~0_235 256) 0))) (ite (and .cse4 (not .cse8)) 0 (ite (and .cse3 .cse8 .cse4 .cse5) (ite .cse9 v_~y$r_buff1_thd3~0_239 0) 0))))) v_~y$r_buff1_thd3~0_238) (= |v_~#y~0.offset_214| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94) (= |v_P2Thread1of1ForFork0_#in~arg.base_25| v_P2Thread1of1ForFork0_~arg.base_25) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= 0 v_~y$flush_delayed~0_76) (= |v_~#y~0.base_214| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94) (= v_~weak$$choice2~0_88 |v_P2Thread1of1ForFork0_#t~nondet7_46|) (= v_~y$w_buff1~0_219 v_~y$w_buff1~0_218) (let ((.cse10 (= |v_P2Thread1of1ForFork0_#t~mem11_46| |v_P2_#t~mem11_78|)) (.cse11 (= |v_P2_#t~ite12_77| |v_P2Thread1of1ForFork0_#t~ite12_46|)) (.cse13 (= |v_P2_#t~ite16_71| |v_P2Thread1of1ForFork0_#t~ite16_46|)) (.cse14 (= |v_P2_#t~ite15_73| |v_P2Thread1of1ForFork0_#t~ite15_46|)) (.cse15 (= |v_P2Thread1of1ForFork0_#t~mem13_46| |v_P2_#t~mem13_94|)) (.cse16 (= |v_P2_#t~ite14_91| |v_P2Thread1of1ForFork0_#t~ite14_46|))) (or (and .cse10 .cse11 .cse12 .cse13 (= |v_P2_#t~mem10_58| v_~__unbuffered_p2_EAX~0_131) (= |v_P2_#t~ite17_61| |v_P2Thread1of1ForFork0_#t~ite17_46|) .cse14 .cse15 .cse16 (= |v_P2_#t~mem10_58| .cse17)) (and .cse18 (= |v_P2_#t~ite17_61| v_~__unbuffered_p2_EAX~0_131) (= |v_P2Thread1of1ForFork0_#t~mem10_46| |v_P2_#t~mem10_58|) (or (and (or (and .cse3 (= |v_P2_#t~ite16_71| |v_P2_#t~ite12_77|) .cse7 (or (and .cse10 .cse19 (= |v_P2_#t~ite12_77| (ite (not .cse20) v_~y$w_buff0~0_234 v_~y$w_buff1~0_219))) (and (= |v_P2_#t~ite12_77| |v_P2_#t~mem11_78|) (= |v_P2_#t~mem11_78| .cse17) .cse9)) .cse14 .cse15 .cse16) (and (or (not .cse3) .cse21) .cse10 (or (and (or (and (= |v_P2_#t~ite14_91| |v_P2_#t~mem13_94|) .cse19 (= |v_P2_#t~mem13_94| .cse17)) (and (= |v_P2_#t~ite14_91| v_~y$w_buff0~0_234) .cse9 .cse15)) .cse21 (= |v_P2_#t~ite15_73| |v_P2_#t~ite14_91|)) (and .cse7 (= |v_P2_#t~ite15_73| (ite .cse9 v_~y$w_buff1~0_219 v_~y$w_buff0~0_234)) .cse15 .cse16)) .cse11 (= |v_P2_#t~ite15_73| |v_P2_#t~ite16_71|))) (= |v_P2_#t~ite16_71| |v_P2_#t~ite17_61|) .cse6) (and .cse10 .cse11 .cse13 (= |v_P2_#t~ite17_61| v_~y$w_buff0~0_234) .cse14 .cse15 .cse22 .cse16))))) (= v_~y$w_buff0_used~0_415 (ite (= (ite .cse0 .cse23 (ite .cse12 .cse23 (ite (and .cse18 .cse22) 0 (ite (and .cse3 .cse7 .cse18 .cse6) (ite (or .cse9 .cse20) 1 0) .cse24)))) 0) 0 1)) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_19| |v_P1Thread1of1ForFork2_~arg#1.offset_19|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_25| v_P2Thread1of1ForFork0_~arg.offset_25) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~y$mem_tmp~0_52 .cse17) (= v_~z~0_55 v_~__unbuffered_p0_EAX~0_77) (= v_~__unbuffered_p2_EAX$read_delayed~0_91 1) (= v_~weak$$choice1~0_136 |v_P2Thread1of1ForFork0_#t~nondet9_46|) (= v_~y$w_buff0~0_234 v_~y$w_buff0~0_233) (= (store |v_#memory_int_421| |v_~#y~0.base_214| (store .cse25 |v_~#y~0.offset_214| |v_P2_#t~ite21_53|)) |v_#memory_int_420|) (or (and .cse26 (= |v_P2_#t~ite21_53| |v_P2_#t~mem20_58|) (= |v_P2_#t~mem20_58| v_~__unbuffered_p2_EAX~0_131)) (and .cse0 (= |v_P2Thread1of1ForFork0_#t~mem20_46| |v_P2_#t~mem20_58|) (= |v_P2_#t~ite21_53| v_~y$mem_tmp~0_52))) (= v_~z~0_55 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_19| |v_P1Thread1of1ForFork2_~arg#1.base_19|) (= v_~x~0_47 1) (= v_~weak$$choice0~0_115 |v_P2Thread1of1ForFork0_#t~nondet6_46|))))) InVars {~#y~0.offset=|v_~#y~0.offset_214|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_416, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_46|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_46|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_46|, ~#y~0.base=|v_~#y~0.base_214|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_19|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_239, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_234, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_46|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_46|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_46|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_19|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_46|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_46|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_46|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_46|, ~y$w_buff1~0=v_~y$w_buff1~0_219, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_46|, #memory_int=|v_#memory_int_421|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_393, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_46|} OutVars{~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_19|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~weak$$choice1~0=v_~weak$$choice1~0_136, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_238, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, ~y$flush_delayed~0=v_~y$flush_delayed~0_76, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_131, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_19|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_19|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, ~weak$$choice0~0=v_~weak$$choice0~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_218, ~x~0=v_~x~0_47, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_19|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_25|, ~#y~0.offset=|v_~#y~0.offset_214|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ~#y~0.base=|v_~#y~0.base_214|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_25, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_25|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_235, ~y$w_buff0~0=v_~y$w_buff0~0_233, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_25|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_25, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_91, #memory_int=|v_#memory_int_420|, ~z~0=v_~z~0_55, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_25|, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[|v_P2_#t~ite15_73|, |v_P2_#t~mem13_94|, |v_P2_#t~ite16_71|, |v_P2_#t~ite14_91|, |v_P2_#t~mem20_58|, |v_P2_#t~ite21_53|, |v_P2_#t~ite17_61|, |v_P2_#t~ite12_77|, |v_P2_#t~mem10_58|, |v_P2_#t~mem11_78|] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P1Thread1of1ForFork2_~arg#1.offset, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:36:48,835 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:36:48,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4429 [2022-12-06 06:36:48,836 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 114 flow [2022-12-06 06:36:48,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:48,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:48,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:48,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:36:48,837 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash -957130128, now seen corresponding path program 2 times [2022-12-06 06:36:48,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:48,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776163599] [2022-12-06 06:36:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:49,584 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 06:36:49,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:49,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776163599] [2022-12-06 06:36:49,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776163599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:49,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:49,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:36:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354714090] [2022-12-06 06:36:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:49,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:36:49,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:49,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:36:49,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:36:49,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 06:36:49,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 114 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:49,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:49,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 06:36:49,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:49,711 INFO L130 PetriNetUnfolder]: 175/291 cut-off events. [2022-12-06 06:36:49,711 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-06 06:36:49,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 291 events. 175/291 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 974 event pairs, 19 based on Foata normal form. 12/301 useless extension candidates. Maximal degree in co-relation 807. Up to 207 conditions per place. [2022-12-06 06:36:49,712 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 25 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2022-12-06 06:36:49,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 222 flow [2022-12-06 06:36:49,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:36:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:36:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-06 06:36:49,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 06:36:49,715 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 114 flow. Second operand 5 states and 33 transitions. [2022-12-06 06:36:49,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 222 flow [2022-12-06 06:36:49,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 218 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 06:36:49,717 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 173 flow [2022-12-06 06:36:49,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-06 06:36:49,718 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 06:36:49,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:49,718 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 173 flow [2022-12-06 06:36:49,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:49,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:49,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 173 flow [2022-12-06 06:36:49,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 173 flow [2022-12-06 06:36:49,730 INFO L130 PetriNetUnfolder]: 18/55 cut-off events. [2022-12-06 06:36:49,730 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-06 06:36:49,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 55 events. 18/55 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 158 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 179. Up to 28 conditions per place. [2022-12-06 06:36:49,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 173 flow [2022-12-06 06:36:49,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 06:36:49,732 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:36:49,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 06:36:49,732 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 173 flow [2022-12-06 06:36:49,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:49,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:49,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:49,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:36:49,733 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:49,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:49,733 INFO L85 PathProgramCache]: Analyzing trace with hash -957068686, now seen corresponding path program 1 times [2022-12-06 06:36:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:49,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788405224] [2022-12-06 06:36:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:50,569 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 06:36:50,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:50,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788405224] [2022-12-06 06:36:50,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788405224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:50,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:50,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:36:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205419654] [2022-12-06 06:36:50,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:50,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:36:50,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:50,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:36:50,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:36:50,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 06:36:50,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 173 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:50,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:50,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 06:36:50,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:50,715 INFO L130 PetriNetUnfolder]: 170/284 cut-off events. [2022-12-06 06:36:50,715 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2022-12-06 06:36:50,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 284 events. 170/284 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 976 event pairs, 16 based on Foata normal form. 2/286 useless extension candidates. Maximal degree in co-relation 964. Up to 197 conditions per place. [2022-12-06 06:36:50,717 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 28 selfloop transitions, 15 changer transitions 0/43 dead transitions. [2022-12-06 06:36:50,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 319 flow [2022-12-06 06:36:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:36:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:36:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-12-06 06:36:50,718 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3425925925925926 [2022-12-06 06:36:50,718 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 173 flow. Second operand 6 states and 37 transitions. [2022-12-06 06:36:50,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 319 flow [2022-12-06 06:36:50,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 301 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:36:50,719 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 240 flow [2022-12-06 06:36:50,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-06 06:36:50,720 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-06 06:36:50,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:50,720 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 240 flow [2022-12-06 06:36:50,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:50,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:50,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 240 flow [2022-12-06 06:36:50,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 240 flow [2022-12-06 06:36:50,730 INFO L130 PetriNetUnfolder]: 16/52 cut-off events. [2022-12-06 06:36:50,731 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-06 06:36:50,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 52 events. 16/52 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 155 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 196. Up to 25 conditions per place. [2022-12-06 06:36:50,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 240 flow [2022-12-06 06:36:50,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 06:36:50,798 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L778-->L790: Formula: (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$r_buff0_thd2~0_In_3 v_~y$r_buff1_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_19) (= v_~y$w_buff0_used~0_Out_2 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~y$r_buff1_thd3~0_Out_2 v_~y$r_buff0_thd3~0_In_11) (= v_~y$r_buff0_thd0~0_In_3 v_~y$r_buff1_thd0~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff1_used~0_Out_2 v_~y$w_buff0_used~0_In_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_In_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_3, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:36:51,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L778-->L790: Formula: (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$r_buff0_thd2~0_In_3 v_~y$r_buff1_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_19) (= v_~y$w_buff0_used~0_Out_2 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~y$r_buff1_thd3~0_Out_2 v_~y$r_buff0_thd3~0_In_11) (= v_~y$r_buff0_thd0~0_In_3 v_~y$r_buff1_thd0~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff1_used~0_Out_2 v_~y$w_buff0_used~0_In_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_In_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_3, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:36:51,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L778-->L790: Formula: (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$r_buff0_thd2~0_In_3 v_~y$r_buff1_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_19) (= v_~y$w_buff0_used~0_Out_2 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~y$r_buff1_thd3~0_Out_2 v_~y$r_buff0_thd3~0_In_11) (= v_~y$r_buff0_thd0~0_In_3 v_~y$r_buff1_thd0~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff1_used~0_Out_2 v_~y$w_buff0_used~0_In_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_In_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_3, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [697] L2-1-->L866: Formula: (let ((.cse7 (= (mod v_~y$r_buff0_thd0~0_51 256) 0))) (let ((.cse2 (= (mod v_~y$r_buff1_thd0~0_55 256) 0)) (.cse1 (= (mod v_~y$w_buff1_used~0_256 256) 0)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_271 256) 0))) (.cse9 (not .cse7)) (.cse6 (= (mod v_~y$w_buff0_used~0_272 256) 0))) (let ((.cse8 (not .cse6)) (.cse10 (and .cse11 .cse9)) (.cse3 (not .cse1)) (.cse5 (not .cse2)) (.cse0 (select |v_#memory_int_243| |v_~#y~0.base_154|))) (and (let ((.cse4 (= |v_ULTIMATE.start_main_#t~mem31#1_44| |v_ULTIMATE.start_main_#t~mem31#1_42|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_42| (select .cse0 |v_~#y~0.offset_154|)) (= |v_ULTIMATE.start_main_#t~mem31#1_42| |v_ULTIMATE.start_main_#t~ite32#1_39|) (or .cse1 .cse2)) (and .cse3 .cse4 (= v_~y$w_buff1~0_135 |v_ULTIMATE.start_main_#t~ite32#1_39|) .cse5)) (or .cse6 .cse7) (= |v_ULTIMATE.start_main_#t~ite33#1_34| |v_ULTIMATE.start_main_#t~ite32#1_39|)) (and (= |v_ULTIMATE.start_main_#t~ite33#1_34| v_~y$w_buff0~0_147) (= |v_ULTIMATE.start_main_#t~ite32#1_39| |v_ULTIMATE.start_main_#t~ite32#1_41|) .cse4 .cse8 .cse9))) (= v_~y$r_buff0_thd0~0_50 (ite .cse10 0 v_~y$r_buff0_thd0~0_51)) (= v_~y$w_buff0_used~0_271 (ite (and .cse8 .cse9) 0 v_~y$w_buff0_used~0_272)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_255 256) 0)) .cse5) (and .cse11 (not (= (mod v_~y$r_buff0_thd0~0_50 256) 0)))) 0 v_~y$r_buff1_thd0~0_55) v_~y$r_buff1_thd0~0_54) (= (ite (or .cse10 (and .cse3 .cse5)) 0 v_~y$w_buff1_used~0_256) v_~y$w_buff1_used~0_255) (= |v_#memory_int_242| (store |v_#memory_int_243| |v_~#y~0.base_154| (store .cse0 |v_~#y~0.offset_154| |v_ULTIMATE.start_main_#t~ite33#1_34|))))))) InVars {~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_272, ~y$w_buff1~0=v_~y$w_buff1~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_44|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_147, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_41|, #memory_int=|v_#memory_int_243|, ~#y~0.base=|v_~#y~0.base_154|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_256} OutVars{~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_271, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_33|, ~y$w_buff0~0=v_~y$w_buff0~0_147, #memory_int=|v_#memory_int_242|, ~#y~0.base=|v_~#y~0.base_154|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_255} AuxVars[|v_ULTIMATE.start_main_#t~ite33#1_34|, |v_ULTIMATE.start_main_#t~ite32#1_39|, |v_ULTIMATE.start_main_#t~mem31#1_42|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:36:52,425 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L790: Formula: (let ((.cse23 (mod v_~y$w_buff0_used~0_427 256))) (let ((.cse24 (mod v_~weak$$choice0~0_119 256)) (.cse21 (= .cse23 0)) (.cse15 (= (mod v_~y$w_buff1_used~0_404 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd3~0_246 256) 0)) (.cse22 (= (mod v_~weak$$choice2~0_92 256) 0))) (let ((.cse9 (select |v_#memory_int_431| |v_~#y~0.base_218|)) (.cse0 (not .cse22)) (.cse7 (not .cse4)) (.cse6 (not .cse15)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_250 256) 0)) (.cse20 (not .cse21)) (.cse14 (= (mod v_~weak$$choice1~0_140 256) 0)) (.cse18 (not (= .cse24 0)))) (let ((.cse8 (ite (= (ite .cse0 .cse23 (ite .cse21 .cse23 (ite (and .cse20 .cse7) 0 (ite (and .cse6 .cse4 .cse5 .cse20) (ite (or .cse14 .cse18) 1 0) .cse24)))) 0) 0 1)) (.cse17 (select .cse9 |v_~#y~0.offset_218|))) (and (= v_~y$r_buff0_thd1~0_39 v_~y$r_buff1_thd1~0_43) (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|) (= 0 v_~y$flush_delayed~0_80) (= v_P0Thread1of1ForFork1_~arg.offset_27 |v_P0Thread1of1ForFork1_#in~arg.offset_27|) (= v_~weak$$choice1~0_140 |v_P2Thread1of1ForFork0_#t~nondet9_54|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_402 256) 0)) (not (= (mod v_~y$w_buff0_used~0_425 256) 0)))) 1 0)) (= v_~__unbuffered_p2_EAX$read_delayed~0_95 1) (= |v_~#y~0.base_218| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) (= v_~y$w_buff1~0_226 v_~y$w_buff0~0_243) (= (ite .cse0 v_~y$r_buff0_thd3~0_246 (let ((.cse1 (= (mod .cse8 256) 0))) (ite .cse1 v_~y$r_buff0_thd3~0_246 (let ((.cse3 (not .cse1))) (let ((.cse2 (and .cse3 .cse7))) (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 (not (= (mod (ite .cse0 v_~y$w_buff1_used~0_404 (ite .cse1 v_~y$w_buff1_used~0_404 (ite .cse2 0 (ite (and .cse6 .cse3 .cse4 .cse5) v_~weak$$choice0~0_119 0)))) 256) 0))) v_~y$r_buff0_thd3~0_246 0))))))) v_~y$r_buff0_thd3~0_245) (= v_~y$w_buff0_used~0_425 1) (= v_~z~0_59 v_~__unbuffered_p0_EAX~0_81) (= v_~x~0_51 v_~__unbuffered_p1_EAX~0_75) (= v_~weak$$choice2~0_92 |v_P2Thread1of1ForFork0_#t~nondet7_54|) (= v_~x~0_51 1) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_23| 0)) (= v_~y$r_buff0_thd2~0_148 v_~y$r_buff1_thd2~0_124) (= v_~y$w_buff0~0_241 1) (= |v_#memory_int_430| (store |v_#memory_int_431| |v_~#y~0.base_218| (store .cse9 |v_~#y~0.offset_218| |v_P2_#t~ite21_58|))) (= v_~z~0_59 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_23| |v_P1Thread1of1ForFork2_~arg#1.offset_23|) (= |v_~#y~0.offset_218| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (let ((.cse16 (= |v_P2_#t~ite12_82| |v_P2Thread1of1ForFork0_#t~ite12_54|)) (.cse10 (= |v_P2_#t~ite14_96| |v_P2Thread1of1ForFork0_#t~ite14_54|)) (.cse11 (= |v_P2Thread1of1ForFork0_#t~mem11_54| |v_P2_#t~mem11_83|)) (.cse12 (= |v_P2_#t~ite15_78| |v_P2Thread1of1ForFork0_#t~ite15_54|)) (.cse13 (= |v_P2Thread1of1ForFork0_#t~mem13_54| |v_P2_#t~mem13_99|)) (.cse19 (= |v_P2_#t~ite16_76| |v_P2Thread1of1ForFork0_#t~ite16_54|))) (or (and (= |v_P2Thread1of1ForFork0_#t~mem10_54| |v_P2_#t~mem10_63|) (= |v_P2_#t~ite17_66| v_~__unbuffered_p2_EAX~0_135) (or (and (= |v_P2_#t~ite16_76| |v_P2_#t~ite17_66|) .cse4 (or (and .cse6 .cse10 (= |v_P2_#t~ite16_76| |v_P2_#t~ite12_82|) .cse11 .cse12 .cse5 .cse13 (= |v_P2_#t~ite12_82| (ite (not .cse14) v_~y$w_buff0~0_243 v_~y$w_buff1~0_228))) (and (or .cse15 (not .cse5)) .cse16 .cse11 (or (and (= |v_P2_#t~ite15_78| |v_P2_#t~ite14_96|) (= |v_P2_#t~mem13_99| .cse17) .cse15 (= |v_P2_#t~ite14_96| |v_P2_#t~mem13_99|)) (and .cse6 .cse10 .cse13 (= |v_P2_#t~ite15_78| (ite .cse18 v_~y$w_buff1~0_228 v_~y$w_buff0~0_243)))) (= |v_P2_#t~ite15_78| |v_P2_#t~ite16_76|)))) (and .cse16 .cse10 .cse11 .cse12 (= |v_P2_#t~ite17_66| v_~y$w_buff0~0_243) .cse13 .cse19 .cse7)) .cse20) (and (= |v_P2_#t~mem10_63| v_~__unbuffered_p2_EAX~0_135) .cse16 (= |v_P2_#t~ite17_66| |v_P2Thread1of1ForFork0_#t~ite17_54|) .cse10 .cse21 .cse11 .cse12 .cse13 .cse19 (= |v_P2_#t~mem10_63| .cse17)))) (= v_~y$r_buff1_thd0~0_102 v_~y$r_buff0_thd0~0_94) (= v_~y$r_buff0_thd3~0_245 v_~y$r_buff1_thd3~0_248) (= v_~y$w_buff1_used~0_402 .cse8) (or (and (= |v_P2_#t~ite21_58| v_~y$mem_tmp~0_56) .cse0 (= |v_P2Thread1of1ForFork0_#t~mem20_54| |v_P2_#t~mem20_63|)) (and (= |v_P2_#t~mem20_63| v_~__unbuffered_p2_EAX~0_135) (= |v_P2_#t~ite21_58| |v_P2_#t~mem20_63|) .cse22)) (= v_~y$r_buff0_thd2~0_147 1) (= v_~weak$$choice0~0_119 |v_P2Thread1of1ForFork0_#t~nondet6_54|) (= v_~y$mem_tmp~0_56 .cse17) (= |v_P0Thread1of1ForFork1_#in~arg.base_27| v_P0Thread1of1ForFork1_~arg.base_27) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_23| |v_P1Thread1of1ForFork2_~arg#1.base_23|)))))) InVars {~#y~0.offset=|v_~#y~0.offset_218|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_427, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_54|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_54|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_54|, ~#y~0.base=|v_~#y~0.base_218|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_23|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_250, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_246, ~y$w_buff0~0=v_~y$w_buff0~0_243, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_54|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_54|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_54|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_23|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_54|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_54|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_54|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_54|, ~y$w_buff1~0=v_~y$w_buff1~0_228, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_54|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_148, #memory_int=|v_#memory_int_431|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_404, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_54|} OutVars{~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_23|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_27, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_81, ~y$mem_tmp~0=v_~y$mem_tmp~0_56, ~weak$$choice1~0=v_~weak$$choice1~0_140, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_248, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_75, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_80, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_135, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_23|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_23|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~weak$$choice0~0=v_~weak$$choice0~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_226, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_51, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_23|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_29|, ~#y~0.offset=|v_~#y~0.offset_218|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_425, ~#y~0.base=|v_~#y~0.base_218|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_43, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_29|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_245, ~y$w_buff0~0=v_~y$w_buff0~0_241, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_29|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #memory_int=|v_#memory_int_430|, ~z~0=v_~z~0_59, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_402} AuxVars[|v_P2_#t~ite12_82|, |v_P2_#t~mem11_83|, |v_P2_#t~mem13_99|, |v_P2_#t~ite21_58|, |v_P2_#t~mem10_63|, |v_P2_#t~ite15_78|, |v_P2_#t~ite17_66|, |v_P2_#t~ite14_96|, |v_P2_#t~mem20_63|, |v_P2_#t~ite16_76|] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork0_#t~ite21, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P1Thread1of1ForFork2_~arg#1.offset, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX$read_delayed~0, ~y$r_buff1_thd2~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, ~y$r_buff0_thd2~0, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:36:56,910 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:36:56,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6192 [2022-12-06 06:36:56,912 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 268 flow [2022-12-06 06:36:56,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:56,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:56,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:56,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:36:56,912 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash -957067508, now seen corresponding path program 1 times [2022-12-06 06:36:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:56,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289779231] [2022-12-06 06:36:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:57,850 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 06:36:57,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:57,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289779231] [2022-12-06 06:36:57,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289779231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:57,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:57,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:36:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93458200] [2022-12-06 06:36:57,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:57,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:36:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:57,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:36:57,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:36:57,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:36:57,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 268 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:57,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:57,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:36:57,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:58,060 INFO L130 PetriNetUnfolder]: 152/254 cut-off events. [2022-12-06 06:36:58,061 INFO L131 PetriNetUnfolder]: For 705/705 co-relation queries the response was YES. [2022-12-06 06:36:58,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 254 events. 152/254 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 852 event pairs, 75 based on Foata normal form. 4/254 useless extension candidates. Maximal degree in co-relation 1012. Up to 196 conditions per place. [2022-12-06 06:36:58,063 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 27 selfloop transitions, 14 changer transitions 0/41 dead transitions. [2022-12-06 06:36:58,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 380 flow [2022-12-06 06:36:58,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:36:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:36:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 06:36:58,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30833333333333335 [2022-12-06 06:36:58,064 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 268 flow. Second operand 5 states and 37 transitions. [2022-12-06 06:36:58,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 380 flow [2022-12-06 06:36:58,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 325 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 06:36:58,067 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 257 flow [2022-12-06 06:36:58,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-06 06:36:58,068 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-06 06:36:58,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:58,068 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 257 flow [2022-12-06 06:36:58,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:58,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:58,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 257 flow [2022-12-06 06:36:58,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 257 flow [2022-12-06 06:36:58,080 INFO L130 PetriNetUnfolder]: 15/52 cut-off events. [2022-12-06 06:36:58,080 INFO L131 PetriNetUnfolder]: For 129/136 co-relation queries the response was YES. [2022-12-06 06:36:58,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 52 events. 15/52 cut-off events. For 129/136 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 167 event pairs, 1 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 200. Up to 24 conditions per place. [2022-12-06 06:36:58,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 257 flow [2022-12-06 06:36:58,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-06 06:36:58,082 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:36:58,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 06:36:58,082 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 257 flow [2022-12-06 06:36:58,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:58,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:58,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:58,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:36:58,083 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:58,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash -957062920, now seen corresponding path program 1 times [2022-12-06 06:36:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:58,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549462763] [2022-12-06 06:36:58,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:58,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:58,874 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 06:36:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:58,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549462763] [2022-12-06 06:36:58,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549462763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:58,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:58,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:36:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503393163] [2022-12-06 06:36:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:58,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:36:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:36:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:36:58,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:36:58,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 257 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:58,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:58,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:36:58,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:59,012 INFO L130 PetriNetUnfolder]: 156/262 cut-off events. [2022-12-06 06:36:59,012 INFO L131 PetriNetUnfolder]: For 749/749 co-relation queries the response was YES. [2022-12-06 06:36:59,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 262 events. 156/262 cut-off events. For 749/749 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 884 event pairs, 69 based on Foata normal form. 4/264 useless extension candidates. Maximal degree in co-relation 1032. Up to 219 conditions per place. [2022-12-06 06:36:59,014 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 30 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2022-12-06 06:36:59,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 365 flow [2022-12-06 06:36:59,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:36:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:36:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 06:36:59,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30833333333333335 [2022-12-06 06:36:59,015 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 257 flow. Second operand 5 states and 37 transitions. [2022-12-06 06:36:59,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 365 flow [2022-12-06 06:36:59,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 341 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:36:59,018 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 274 flow [2022-12-06 06:36:59,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-06 06:36:59,019 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-06 06:36:59,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:59,019 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 274 flow [2022-12-06 06:36:59,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:59,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:59,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 274 flow [2022-12-06 06:36:59,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 274 flow [2022-12-06 06:36:59,031 INFO L130 PetriNetUnfolder]: 15/52 cut-off events. [2022-12-06 06:36:59,031 INFO L131 PetriNetUnfolder]: For 141/146 co-relation queries the response was YES. [2022-12-06 06:36:59,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 52 events. 15/52 cut-off events. For 141/146 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 162 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 204. Up to 24 conditions per place. [2022-12-06 06:36:59,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 274 flow [2022-12-06 06:36:59,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 06:36:59,034 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:36:59,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 06:36:59,036 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 274 flow [2022-12-06 06:36:59,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 06:36:59,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:59,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:59,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:36:59,036 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash -957061959, now seen corresponding path program 1 times [2022-12-06 06:36:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:59,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411481413] [2022-12-06 06:36:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:36:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:36:59,153 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 06:36:59,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:36:59,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411481413] [2022-12-06 06:36:59,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411481413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:36:59,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:36:59,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:36:59,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198267239] [2022-12-06 06:36:59,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:36:59,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:36:59,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:36:59,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:36:59,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:36:59,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:36:59,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 06:36:59,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:36:59,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:36:59,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:36:59,236 INFO L130 PetriNetUnfolder]: 95/178 cut-off events. [2022-12-06 06:36:59,236 INFO L131 PetriNetUnfolder]: For 564/564 co-relation queries the response was YES. [2022-12-06 06:36:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 178 events. 95/178 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 580 event pairs, 25 based on Foata normal form. 7/185 useless extension candidates. Maximal degree in co-relation 712. Up to 165 conditions per place. [2022-12-06 06:36:59,237 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 33 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2022-12-06 06:36:59,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 357 flow [2022-12-06 06:36:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:36:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:36:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 06:36:59,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 06:36:59,239 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 274 flow. Second operand 3 states and 30 transitions. [2022-12-06 06:36:59,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 357 flow [2022-12-06 06:36:59,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 321 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-06 06:36:59,242 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 239 flow [2022-12-06 06:36:59,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2022-12-06 06:36:59,243 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-06 06:36:59,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:36:59,243 INFO L89 Accepts]: Start accepts. Operand has 40 places, 34 transitions, 239 flow [2022-12-06 06:36:59,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:36:59,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:59,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 34 transitions, 239 flow [2022-12-06 06:36:59,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 239 flow [2022-12-06 06:36:59,260 INFO L130 PetriNetUnfolder]: 45/118 cut-off events. [2022-12-06 06:36:59,260 INFO L131 PetriNetUnfolder]: For 169/169 co-relation queries the response was YES. [2022-12-06 06:36:59,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 118 events. 45/118 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 486 event pairs, 18 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 382. Up to 57 conditions per place. [2022-12-06 06:36:59,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 34 transitions, 239 flow [2022-12-06 06:36:59,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 06:36:59,982 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:36:59,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 739 [2022-12-06 06:36:59,983 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 243 flow [2022-12-06 06:36:59,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 06:36:59,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:36:59,983 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:36:59,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:36:59,983 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:36:59,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:36:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash 459902803, now seen corresponding path program 1 times [2022-12-06 06:36:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:36:59,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729225323] [2022-12-06 06:36:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:36:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:00,132 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 06:37:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:00,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729225323] [2022-12-06 06:37:00,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729225323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:00,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:00,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:37:00,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402198050] [2022-12-06 06:37:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:00,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:00,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:00,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:00,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:37:00,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:00,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:00,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:37:00,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:00,213 INFO L130 PetriNetUnfolder]: 36/86 cut-off events. [2022-12-06 06:37:00,213 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-12-06 06:37:00,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 86 events. 36/86 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 228 event pairs, 3 based on Foata normal form. 13/99 useless extension candidates. Maximal degree in co-relation 368. Up to 56 conditions per place. [2022-12-06 06:37:00,214 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 27 selfloop transitions, 7 changer transitions 2/36 dead transitions. [2022-12-06 06:37:00,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 315 flow [2022-12-06 06:37:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:37:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:37:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 06:37:00,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-06 06:37:00,215 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 243 flow. Second operand 4 states and 37 transitions. [2022-12-06 06:37:00,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 315 flow [2022-12-06 06:37:00,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 287 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 06:37:00,216 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 178 flow [2022-12-06 06:37:00,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-06 06:37:00,217 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-06 06:37:00,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:00,217 INFO L89 Accepts]: Start accepts. Operand has 41 places, 28 transitions, 178 flow [2022-12-06 06:37:00,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:00,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:00,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 178 flow [2022-12-06 06:37:00,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 178 flow [2022-12-06 06:37:00,228 INFO L130 PetriNetUnfolder]: 17/59 cut-off events. [2022-12-06 06:37:00,228 INFO L131 PetriNetUnfolder]: For 92/96 co-relation queries the response was YES. [2022-12-06 06:37:00,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 59 events. 17/59 cut-off events. For 92/96 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 164 event pairs, 1 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 203. Up to 31 conditions per place. [2022-12-06 06:37:00,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 178 flow [2022-12-06 06:37:00,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-06 06:37:00,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] $Ultimate##0-->L833: Formula: (let ((.cse37 (mod v_~y$w_buff0_used~0_421 256)) (.cse38 (mod v_~weak$$choice0~0_117 256))) (let ((.cse25 (= .cse38 0)) (.cse29 (= 0 (mod v_~y$w_buff1_used~0_398 256))) (.cse21 (= .cse37 0)) (.cse30 (= (mod v_~y$r_buff0_thd3~0_241 256) 0)) (.cse32 (= (mod v_~weak$$choice2~0_90 256) 0))) (let ((.cse33 (not .cse32)) (.cse31 (not .cse30)) (.cse27 (= (mod v_~y$r_buff1_thd3~0_244 256) 0)) (.cse23 (not .cse21)) (.cse28 (not .cse29)) (.cse26 (not .cse25)) (.cse24 (= (mod v_~weak$$choice1~0_138 256) 0))) (let ((.cse2 (ite (= (ite .cse33 .cse37 (ite .cse21 .cse37 (ite (and .cse31 .cse23) 0 (ite (and .cse27 .cse23 .cse28 .cse30) (ite (or .cse26 .cse24) 1 0) .cse38)))) 0) 0 1))) (let ((.cse13 (= (mod .cse2 256) 0))) (let ((.cse9 (not .cse13))) (let ((.cse36 (and .cse31 .cse9))) (let ((.cse6 (ite .cse33 v_~y$w_buff1_used~0_398 (ite .cse13 v_~y$w_buff1_used~0_398 (ite .cse36 0 (ite (and .cse9 .cse27 .cse28 .cse30) v_~weak$$choice0~0_117 0)))))) (let ((.cse14 (= (mod .cse6 256) 0))) (let ((.cse4 (not .cse14))) (let ((.cse34 (ite .cse33 v_~y$r_buff0_thd3~0_241 (ite .cse13 v_~y$r_buff0_thd3~0_241 (ite .cse36 0 (ite (and .cse4 .cse9 .cse27 .cse30) v_~y$r_buff0_thd3~0_241 0)))))) (let ((.cse12 (= (mod .cse34 256) 0))) (let ((.cse11 (not .cse12))) (let ((.cse1 (and .cse9 .cse11))) (let ((.cse8 (ite .cse33 v_~y$r_buff1_thd3~0_244 (ite .cse13 v_~y$r_buff1_thd3~0_244 (ite .cse1 0 (ite (and .cse4 .cse12 .cse9 .cse27) (ite .cse26 v_~y$r_buff1_thd3~0_244 0) 0)))))) (let ((.cse7 (not (= (mod v_~y$w_buff0_used~0_419 256) 0))) (.cse35 (select |v_#memory_int_426| |v_~#y~0.base_216|)) (.cse15 (= (mod .cse8 256) 0))) (let ((.cse5 (not .cse15)) (.cse0 (select .cse35 |v_~#y~0.offset_216|)) (.cse3 (and .cse7 .cse11))) (and (= v_~y$mem_tmp~0_54 .cse0) (= v_~z~0_57 1) (= v_~y$w_buff0_used~0_419 (ite .cse1 0 .cse2)) (= v_~y$w_buff1_used~0_396 (ite (or .cse3 (and .cse4 .cse5)) 0 .cse6)) (= (ite (or (and .cse7 (not (= (mod v_~y$r_buff0_thd3~0_239 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_396 256) 0)) .cse5)) 0 .cse8) v_~y$r_buff1_thd3~0_242) (let ((.cse10 (= |v_P2Thread1of1ForFork0_#t~mem22_62| |v_P2_#t~mem22_60|))) (or (and .cse9 .cse10 .cse11 (= |v_P2_#t~ite24_55| v_~y$w_buff0~0_237) (= |v_P2_#t~ite23_55| |v_P2Thread1of1ForFork0_#t~ite23_62|)) (and (or .cse12 .cse13) (or (and .cse4 (= v_~y$w_buff1~0_222 |v_P2_#t~ite23_55|) .cse10 .cse5) (and (= |v_P2_#t~ite21_56| |v_P2_#t~mem22_60|) (or .cse14 .cse15) (= |v_P2_#t~ite23_55| |v_P2_#t~mem22_60|))) (= |v_P2_#t~ite24_55| |v_P2_#t~ite23_55|)))) (= v_~z~0_57 v_~__unbuffered_p0_EAX~0_79) (= v_~__unbuffered_p2_EAX$read_delayed~0_93 1) (= v_~x~0_49 v_~__unbuffered_p1_EAX~0_73) (let ((.cse16 (= |v_P2Thread1of1ForFork0_#t~mem13_50| |v_P2_#t~mem13_97|)) (.cse17 (= |v_P2_#t~ite12_80| |v_P2Thread1of1ForFork0_#t~ite12_50|)) (.cse18 (= |v_P2_#t~ite14_94| |v_P2Thread1of1ForFork0_#t~ite14_50|)) (.cse19 (= |v_P2Thread1of1ForFork0_#t~mem11_50| |v_P2_#t~mem11_81|)) (.cse20 (= |v_P2_#t~ite15_76| |v_P2Thread1of1ForFork0_#t~ite15_50|)) (.cse22 (= |v_P2_#t~ite16_74| |v_P2Thread1of1ForFork0_#t~ite16_50|))) (or (and .cse16 (= .cse0 |v_P2_#t~mem10_61|) .cse17 .cse18 (= |v_P2_#t~mem10_61| v_~__unbuffered_p2_EAX~0_133) (= |v_P2_#t~ite17_64| |v_P2Thread1of1ForFork0_#t~ite17_50|) .cse19 .cse20 .cse21 .cse22) (and (= |v_P2_#t~ite17_64| v_~__unbuffered_p2_EAX~0_133) .cse23 (or (and (or (and .cse16 (or (and (= |v_P2_#t~ite12_80| (ite (not .cse24) v_~y$w_buff0~0_238 v_~y$w_buff1~0_223)) .cse19 .cse25) (and .cse26 (= |v_P2_#t~ite12_80| |v_P2_#t~mem11_81|) (= .cse0 |v_P2_#t~mem11_81|))) .cse27 .cse18 (= |v_P2_#t~ite16_74| |v_P2_#t~ite12_80|) .cse28 .cse20) (and .cse17 (= |v_P2_#t~ite15_76| |v_P2_#t~ite16_74|) (or .cse29 (not .cse27)) (or (and .cse16 (= |v_P2_#t~ite15_76| (ite .cse26 v_~y$w_buff1~0_223 v_~y$w_buff0~0_238)) .cse18 .cse28) (and (or (and .cse16 .cse26 (= |v_P2_#t~ite14_94| v_~y$w_buff0~0_238)) (and (= |v_P2_#t~ite14_94| |v_P2_#t~mem13_97|) (= .cse0 |v_P2_#t~mem13_97|) .cse25)) .cse29 (= |v_P2_#t~ite15_76| |v_P2_#t~ite14_94|))) .cse19)) (= |v_P2_#t~ite16_74| |v_P2_#t~ite17_64|) .cse30) (and .cse31 .cse16 .cse17 .cse18 (= |v_P2_#t~ite17_64| v_~y$w_buff0~0_238) .cse19 .cse20 .cse22)) (= |v_P2Thread1of1ForFork0_#t~mem10_50| |v_P2_#t~mem10_61|)))) (or (and .cse32 (= |v_P2_#t~mem20_61| v_~__unbuffered_p2_EAX~0_133) (= |v_P2_#t~ite21_56| |v_P2_#t~mem20_61|)) (and (= |v_P2Thread1of1ForFork0_#t~mem20_50| |v_P2_#t~mem20_61|) .cse33 (= |v_P2_#t~ite21_56| v_~y$mem_tmp~0_54))) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= v_~weak$$choice2~0_90 |v_P2Thread1of1ForFork0_#t~nondet7_50|) (= (ite .cse3 0 .cse34) v_~y$r_buff0_thd3~0_239) (= v_~x~0_49 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_21| |v_P1Thread1of1ForFork2_~arg#1.offset_21|) (= 0 v_~y$flush_delayed~0_78) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_21| |v_P1Thread1of1ForFork2_~arg#1.base_21|) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~weak$$choice0~0_117 |v_P2Thread1of1ForFork0_#t~nondet6_50|) (= v_~y$w_buff0~0_238 v_~y$w_buff0~0_237) (= |v_~#y~0.offset_216| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_96) (= |v_~#y~0.base_216| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_96) (= |v_P2Thread1of1ForFork0_#in~arg.base_27| v_P2Thread1of1ForFork0_~arg.base_27) (= v_~weak$$choice1~0_138 |v_P2Thread1of1ForFork0_#t~nondet9_50|) (= (store |v_#memory_int_426| |v_~#y~0.base_216| (store .cse35 |v_~#y~0.offset_216| |v_P2_#t~ite24_55|)) |v_#memory_int_424|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_27| v_P2Thread1of1ForFork0_~arg.offset_27) (= v_~y$w_buff1~0_223 v_~y$w_buff1~0_222))))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_216|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_421, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_50|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_50|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_50|, ~#y~0.base=|v_~#y~0.base_216|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_21|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_244, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ~y$w_buff0~0=v_~y$w_buff0~0_238, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_62|, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_50|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_50|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_50|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_21|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_50|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_50|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_50|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_50|, ~y$w_buff1~0=v_~y$w_buff1~0_223, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_50|, #memory_int=|v_#memory_int_426|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_62|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_398, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_50|} OutVars{~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_96, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_96, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_21|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_79, ~y$mem_tmp~0=v_~y$mem_tmp~0_54, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_242, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_33|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_133, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_21|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_21|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~weak$$choice0~0=v_~weak$$choice0~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_222, ~x~0=v_~x~0_49, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_21|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_27|, ~#y~0.offset=|v_~#y~0.offset_216|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_419, ~#y~0.base=|v_~#y~0.base_216|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_27, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_27|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_239, ~y$w_buff0~0=v_~y$w_buff0~0_237, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_27|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_27, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_93, #memory_int=|v_#memory_int_424|, ~z~0=v_~z~0_57, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_27|, ~weak$$choice2~0=v_~weak$$choice2~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_396} AuxVars[|v_P2_#t~mem10_61|, |v_P2_#t~ite24_55|, |v_P2_#t~ite23_55|, |v_P2_#t~mem13_97|, |v_P2_#t~mem11_81|, |v_P2_#t~mem20_61|, |v_P2_#t~ite14_94|, |v_P2_#t~ite16_74|, |v_P2_#t~ite17_64|, |v_P2_#t~ite12_80|, |v_P2_#t~mem22_60|, |v_P2_#t~ite21_56|, |v_P2_#t~ite15_76|] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P1Thread1of1ForFork2_~arg#1.offset, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [767] L778-->L797: Formula: (let ((.cse1 (= (mod v_~y$w_buff0_used~0_459 256) 0)) (.cse0 (not (= (mod v_~y$w_buff0_used~0_457 256) 0))) (.cse2 (not (= (mod v_~y$r_buff0_thd2~0_171 256) 0)))) (and (= v_~y$r_buff0_thd0~0_107 v_~y$r_buff1_thd0~0_115) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_34| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_34|) (= v_~y$r_buff0_thd2~0_169 (ite .cse0 0 1)) (= v_~y$w_buff0~0_265 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_34| (ite .cse1 1 0)) (= v_~y$w_buff0_used~0_457 0) (= v_~y$w_buff1_used~0_427 (ite (or (and (not .cse1) .cse2) .cse0) 0 v_~y$w_buff0_used~0_459)) (= v_~y$r_buff1_thd2~0_135 (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_169 256) 0)) .cse0) (and (not (= (mod v_~y$w_buff1_used~0_427 256) 0)) .cse2)) 0 v_~y$r_buff0_thd2~0_171)) (= (store |v_#memory_int_454| |v_~#y~0.base_229| (store (select |v_#memory_int_454| |v_~#y~0.base_229|) |v_~#y~0.offset_229| v_~y$w_buff0~0_265)) |v_#memory_int_453|) (= v_~y$r_buff0_thd3~0_265 v_~y$r_buff1_thd3~0_271) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_34| 0)) (= v_~y$r_buff0_thd1~0_50 v_~y$r_buff1_thd1~0_54) (= v_~y$w_buff1~0_243 v_~y$w_buff0~0_266))) InVars {~#y~0.offset=|v_~#y~0.offset_229|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_266, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_171, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, #memory_int=|v_#memory_int_454|, ~#y~0.base=|v_~#y~0.base_229|} OutVars{~#y~0.offset=|v_~#y~0.offset_229|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_457, ~#y~0.base=|v_~#y~0.base_229|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_271, ~y$w_buff1~0=v_~y$w_buff1~0_243, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_27|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_34|, ~y$w_buff0~0=v_~y$w_buff0~0_265, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_169, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, #memory_int=|v_#memory_int_453|, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_49|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_427, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_49|} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2_#t~ite5#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem3#1] [2022-12-06 06:37:03,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [700] L855-3-->L2-1: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_73) 1 0) 0) 0 1) v_~main$tmp_guard0~0_26)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [766] L778-->L866: Formula: (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_104 256) 0))) (let ((.cse4 (not .cse5)) (.cse3 (not (= (mod v_~y$w_buff0_used~0_451 256) 0)))) (let ((.cse0 (and .cse4 .cse3)) (.cse2 (= (mod v_~y$w_buff0_used~0_453 256) 0)) (.cse1 (select |v_#memory_int_450| |v_~#y~0.base_227|))) (and (= v_~y$r_buff0_thd2~0_166 v_~y$r_buff1_thd2~0_133) (= v_~y$w_buff0~0_261 1) (= v_~y$r_buff0_thd1~0_48 v_~y$r_buff1_thd1~0_52) (= (ite .cse0 0 v_~y$r_buff0_thd0~0_104) v_~y$r_buff0_thd0~0_103) (= (store |v_#memory_int_450| |v_~#y~0.base_227| (store .cse1 |v_~#y~0.offset_227| |v_ULTIMATE.start_main_#t~ite33#1_85|)) |v_#memory_int_449|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_32| (ite .cse2 1 0)) (= v_~y$r_buff0_thd2~0_165 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_32| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_32|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_32| 0)) (= v_~y$r_buff1_thd0~0_111 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_103 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_423 256) 0)))) 0 v_~y$r_buff0_thd0~0_104)) (= v_~y$r_buff0_thd3~0_263 v_~y$r_buff1_thd3~0_269) (= v_~y$w_buff1_used~0_423 (ite (or .cse0 (and .cse4 (not .cse2))) 0 v_~y$w_buff0_used~0_453)) (= (ite .cse4 0 1) v_~y$w_buff0_used~0_451) (or (and .cse4 (= |v_ULTIMATE.start_main_#t~mem31#1_107| |v_ULTIMATE.start_main_#t~mem31#1_105|) (= |v_ULTIMATE.start_main_#t~ite32#1_104| |v_ULTIMATE.start_main_#t~ite32#1_102|) (= |v_ULTIMATE.start_main_#t~ite33#1_85| v_~y$w_buff0~0_261)) (and (= |v_ULTIMATE.start_main_#t~mem31#1_105| (select .cse1 |v_~#y~0.offset_227|)) .cse5 (= |v_ULTIMATE.start_main_#t~mem31#1_105| |v_ULTIMATE.start_main_#t~ite32#1_102|) (= |v_ULTIMATE.start_main_#t~ite33#1_85| |v_ULTIMATE.start_main_#t~ite32#1_102|))) (= v_~y$w_buff1~0_241 v_~y$w_buff0~0_262))))) InVars {~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_453, ~#y~0.base=|v_~#y~0.base_227|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_107|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_262, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_263, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_104|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_166, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, #memory_int=|v_#memory_int_450|} OutVars{~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_451, ~#y~0.base=|v_~#y~0.base_227|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_269, ~y$w_buff1~0=v_~y$w_buff1~0_241, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_103, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_84|, ~y$w_buff0~0=v_~y$w_buff0~0_261, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_263, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_165, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, #memory_int=|v_#memory_int_449|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_423} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_102|, |v_ULTIMATE.start_main_#t~mem31#1_105|, |v_ULTIMATE.start_main_#t~ite33#1_85|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:37:04,066 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] L855-3-->L866: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_126 256) 0))) (let ((.cse1 (not .cse3)) (.cse5 (not (= (mod v_~y$w_buff0_used~0_495 256) 0)))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (select |v_#memory_int_488| |v_~#y~0.base_243|)) (.cse2 (= (mod v_~y$w_buff0_used~0_496 256) 0))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_201 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_72) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_44| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_44|) (= (ite (or .cse0 (and .cse1 (not .cse2))) 0 v_~y$w_buff0_used~0_496) v_~y$w_buff1_used~0_461) (or (and (= |v_ULTIMATE.start_main_#t~ite32#1_126| |v_ULTIMATE.start_main_#t~ite32#1_124|) .cse1 (= |v_ULTIMATE.start_main_#t~mem31#1_129| |v_ULTIMATE.start_main_#t~mem31#1_127|) (= |v_ULTIMATE.start_main_#t~ite33#1_101| v_~y$w_buff0~0_291)) (and (= |v_ULTIMATE.start_main_#t~ite33#1_101| |v_ULTIMATE.start_main_#t~ite32#1_124|) .cse3 (= (select .cse4 |v_~#y~0.offset_243|) |v_ULTIMATE.start_main_#t~mem31#1_127|) (= |v_ULTIMATE.start_main_#t~mem31#1_127| |v_ULTIMATE.start_main_#t~ite32#1_124|))) (= v_~y$r_buff0_thd0~0_125 (ite .cse0 0 v_~y$r_buff0_thd0~0_126)) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_44| 0)) (= v_~y$r_buff0_thd1~0_60 v_~y$r_buff1_thd1~0_64) (= v_~y$w_buff1~0_265 v_~y$w_buff0~0_292) (= (store |v_#memory_int_488| |v_~#y~0.base_243| (store .cse4 |v_~#y~0.offset_243| |v_ULTIMATE.start_main_#t~ite33#1_101|)) |v_#memory_int_487|) (= v_~y$w_buff0~0_291 1) (= v_~y$r_buff0_thd2~0_196 v_~y$r_buff1_thd2~0_151) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= v_~y$r_buff0_thd2~0_195 1) (= v_~y$r_buff1_thd0~0_133 (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0)) .cse5)) 0 v_~y$r_buff0_thd0~0_126)) (= (mod v_~main$tmp_guard0~0_72 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= v_~y$w_buff0_used~0_495 (ite .cse1 0 1)) (= v_~y$r_buff0_thd3~0_283 v_~y$r_buff1_thd3~0_291) (= (ite .cse2 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_44|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| 0)))))) InVars {~#y~0.offset=|v_~#y~0.offset_243|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_496, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_129|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_126, ~y$w_buff0~0=v_~y$w_buff0~0_292, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_283, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_196, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_126|, #memory_int=|v_#memory_int_488|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_201, ~#y~0.base=|v_~#y~0.base_243|} OutVars{~#y~0.offset=|v_~#y~0.offset_243|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_495, ~#y~0.base=|v_~#y~0.base_243|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_291, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_65|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_44|, ~y$w_buff0~0=v_~y$w_buff0~0_291, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_283, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_61|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_79|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_72, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_100|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_195, #memory_int=|v_#memory_int_487|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_201, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_461, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_124|, |v_ULTIMATE.start_main_#t~mem31#1_127|, |v_ULTIMATE.start_main_#t~ite33#1_101|] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ~y$w_buff0_used~0, ~main$tmp_guard0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet30#1, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [627] L790-->L797: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_50 256) 0))) (let ((.cse11 (= (mod v_~y$w_buff0_used~0_194 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd2~0_43 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_189 256) 0)) (.cse6 (not (= (mod v_~y$w_buff0_used~0_193 256) 0))) (.cse1 (not .cse10))) (let ((.cse4 (and .cse6 .cse1)) (.cse2 (not .cse8)) (.cse3 (not .cse9)) (.cse5 (select |v_#memory_int_169| |v_~#y~0.base_112|)) (.cse0 (not .cse11))) (and (= v_~y$w_buff0_used~0_193 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_194)) (= v_~y$w_buff1_used~0_188 (ite (or (and .cse2 .cse3) .cse4) 0 v_~y$w_buff1_used~0_189)) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_50) v_~y$r_buff0_thd2~0_49) (= (store |v_#memory_int_169| |v_~#y~0.base_112| (store .cse5 |v_~#y~0.offset_112| |v_P1_#t~ite5#1_27|)) |v_#memory_int_168|) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse6 (not (= (mod v_~y$r_buff0_thd2~0_49 256) 0)))) 0 v_~y$r_buff1_thd2~0_43) v_~y$r_buff1_thd2~0_42) (let ((.cse7 (= |v_P1Thread1of1ForFork2_#t~mem3#1_1| |v_P1_#t~mem3#1_36|))) (or (and (or (and .cse2 (= |v_P1_#t~ite4#1_29| v_~y$w_buff1~0_82) .cse7 .cse3) (and (= (select .cse5 |v_~#y~0.offset_112|) |v_P1_#t~mem3#1_36|) (or .cse8 .cse9) (= |v_P1_#t~ite4#1_29| |v_P1_#t~mem3#1_36|))) (or .cse10 .cse11) (= |v_P1_#t~ite4#1_29| |v_P1_#t~ite5#1_27|)) (and .cse0 (= |v_P1_#t~ite5#1_27| v_~y$w_buff0~0_77) (= |v_P1_#t~ite4#1_29| |v_P1Thread1of1ForFork2_#t~ite4#1_1|) .cse1 .cse7))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_194, ~y$w_buff1~0=v_~y$w_buff1~0_82, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, #memory_int=|v_#memory_int_169|, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_1|, ~#y~0.base=|v_~#y~0.base_112|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_193, ~y$w_buff1~0=v_~y$w_buff1~0_82, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, #memory_int=|v_#memory_int_168|, ~#y~0.base=|v_~#y~0.base_112|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[|v_P1_#t~ite4#1_29|, |v_P1_#t~ite5#1_27|, |v_P1_#t~mem3#1_36|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem3#1] [2022-12-06 06:37:05,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] $Ultimate##0-->L833: Formula: (let ((.cse28 (mod v_~y$w_buff0_used~0_471 256))) (let ((.cse29 (mod v_~weak$$choice0~0_121 256)) (.cse7 (= .cse28 0)) (.cse10 (= (mod v_~y$w_buff1_used~0_437 256) 0)) (.cse14 (= (mod v_~y$r_buff0_thd3~0_271 256) 0)) (.cse22 (= (mod v_~weak$$choice2~0_94 256) 0))) (let ((.cse23 (not .cse22)) (.cse15 (not .cse14)) (.cse9 (= (mod v_~y$r_buff1_thd3~0_277 256) 0)) (.cse11 (not .cse10)) (.cse8 (not .cse7)) (.cse13 (= (mod v_~weak$$choice1~0_142 256) 0)) (.cse12 (not (= .cse29 0)))) (let ((.cse20 (ite (= (ite .cse23 .cse28 (ite .cse7 .cse28 (ite (and .cse8 .cse15) 0 (ite (and .cse9 .cse11 .cse14 .cse8) (ite (or .cse13 .cse12) 1 0) .cse29)))) 0) 0 1))) (let ((.cse16 (= (mod .cse20 256) 0))) (let ((.cse18 (not .cse16))) (let ((.cse24 (ite .cse23 v_~y$r_buff0_thd3~0_271 (ite .cse16 v_~y$r_buff0_thd3~0_271 (let ((.cse27 (and .cse15 .cse18))) (ite .cse27 0 (ite (and (not (= (mod (ite .cse23 v_~y$w_buff1_used~0_437 (ite .cse16 v_~y$w_buff1_used~0_437 (ite .cse27 0 (ite (and .cse9 .cse11 .cse14 .cse18) v_~weak$$choice0~0_121 0)))) 256) 0)) .cse9 .cse14 .cse18) v_~y$r_buff0_thd3~0_271 0))))))) (let ((.cse26 (= (mod .cse24 256) 0))) (let ((.cse21 (select |v_#memory_int_463| |v_~#y~0.base_233|)) (.cse25 (not (= (mod v_~y$w_buff0_used~0_469 256) 0))) (.cse17 (not .cse26))) (let ((.cse19 (and .cse25 .cse17)) (.cse3 (select .cse21 |v_~#y~0.offset_233|))) (and (let ((.cse0 (= |v_P2_#t~ite15_82| |v_P2Thread1of1ForFork0_#t~ite15_58|)) (.cse1 (= |v_P2Thread1of1ForFork0_#t~mem13_58| |v_P2_#t~mem13_103|)) (.cse2 (= |v_P2Thread1of1ForFork0_#t~mem11_58| |v_P2_#t~mem11_87|)) (.cse4 (= |v_P2_#t~ite16_80| |v_P2Thread1of1ForFork0_#t~ite16_58|)) (.cse5 (= |v_P2_#t~ite12_86| |v_P2Thread1of1ForFork0_#t~ite12_58|)) (.cse6 (= |v_P2Thread1of1ForFork0_#t~ite14_58| |v_P2_#t~ite14_100|))) (or (and .cse0 .cse1 (= |v_P2_#t~mem10_67| v_~__unbuffered_p2_EAX~0_139) (= |v_P2_#t~ite17_70| |v_P2Thread1of1ForFork0_#t~ite17_58|) .cse2 (= .cse3 |v_P2_#t~mem10_67|) .cse4 .cse5 .cse6 .cse7) (and (= |v_P2Thread1of1ForFork0_#t~mem10_58| |v_P2_#t~mem10_67|) (= |v_P2_#t~ite17_70| v_~__unbuffered_p2_EAX~0_139) .cse8 (or (and (or (and (= |v_P2_#t~ite15_82| |v_P2_#t~ite16_80|) .cse2 .cse5 (or (not .cse9) .cse10) (or (and .cse1 .cse11 (= |v_P2_#t~ite15_82| (ite .cse12 v_~y$w_buff1~0_248 v_~y$w_buff0~0_274)) .cse6) (and (= |v_P2_#t~mem13_103| |v_P2_#t~ite14_100|) (= .cse3 |v_P2_#t~mem13_103|) .cse10 (= |v_P2_#t~ite15_82| |v_P2_#t~ite14_100|)))) (and (= |v_P2_#t~ite12_86| (ite (not .cse13) v_~y$w_buff0~0_274 v_~y$w_buff1~0_248)) .cse0 .cse9 .cse1 .cse2 .cse11 (= |v_P2_#t~ite16_80| |v_P2_#t~ite12_86|) .cse6)) (= |v_P2_#t~ite16_80| |v_P2_#t~ite17_70|) .cse14) (and (= |v_P2_#t~ite17_70| v_~y$w_buff0~0_274) .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse6))))) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38| (ite .cse16 1 0)) (= v_~x~0_53 v_~__unbuffered_p1_EAX~0_77) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_38|) (= v_~y$r_buff0_thd0~0_111 v_~y$r_buff1_thd0~0_119) (= 0 v_~y$flush_delayed~0_82) (= v_~y$r_buff0_thd2~0_182 v_~y$r_buff1_thd2~0_143) (= v_~weak$$choice1~0_142 |v_P2Thread1of1ForFork0_#t~nondet9_58|) (= v_~y$w_buff0_used~0_469 (ite .cse17 0 1)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_31| v_P2Thread1of1ForFork0_~arg.offset_31) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_25| |v_P1Thread1of1ForFork2_~arg#1.base_25|) (= v_~y$r_buff0_thd1~0_54 v_~y$r_buff1_thd1~0_58) (= v_P0Thread1of1ForFork1_~arg.offset_29 |v_P0Thread1of1ForFork1_#in~arg.offset_29|) (= v_~y$w_buff1_used~0_435 (ite (or (and .cse17 .cse18) .cse19) 0 .cse20)) (= |v_~#y~0.offset_233| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_102) (= v_~y$r_buff0_thd2~0_181 1) (= v_~__unbuffered_p2_EAX$read_delayed~0_97 1) (= v_~weak$$choice2~0_94 |v_P2Thread1of1ForFork0_#t~nondet7_58|) (= v_~x~0_53 1) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_38| 0)) (= (store |v_#memory_int_463| |v_~#y~0.base_233| (store .cse21 |v_~#y~0.offset_233| |v_P2_#t~ite24_66|)) |v_#memory_int_461|) (or (and .cse22 (= |v_P2_#t~mem20_67| v_~__unbuffered_p2_EAX~0_139) (= |v_P2_#t~ite21_62| |v_P2_#t~mem20_67|)) (and (= |v_P2_#t~ite21_62| v_~y$mem_tmp~0_58) (= |v_P2Thread1of1ForFork0_#t~mem20_58| |v_P2_#t~mem20_67|) .cse23)) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_102 |v_~#y~0.base_233|) (= v_~z~0_61 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_29| v_P0Thread1of1ForFork1_~arg.base_29) (= v_~weak$$choice0~0_121 |v_P2Thread1of1ForFork0_#t~nondet6_58|) (= |v_P2Thread1of1ForFork0_#in~arg.base_31| v_P2Thread1of1ForFork0_~arg.base_31) (= (ite .cse19 0 .cse24) v_~y$r_buff0_thd3~0_269) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_25| |v_P1Thread1of1ForFork2_~arg#1.offset_25|) (= v_~y$w_buff1~0_247 v_~y$w_buff0~0_274) (= v_~y$w_buff0~0_273 1) (= (ite (or (and (not (= 0 (mod v_~y$w_buff1_used~0_435 256))) .cse17) (and (not (= (mod v_~y$r_buff0_thd3~0_269 256) 0)) .cse25)) 0 .cse24) v_~y$r_buff1_thd3~0_275) (= .cse3 v_~y$mem_tmp~0_58) (= v_~z~0_61 v_~__unbuffered_p0_EAX~0_83) (or (and (= |v_P2_#t~ite21_62| |v_P2_#t~mem22_71|) (= |v_P2_#t~ite24_66| |v_P2_#t~ite23_66|) (= |v_P2_#t~ite23_66| |v_P2_#t~mem22_71|) .cse26) (and .cse17 (= |v_P2_#t~ite23_66| |v_P2Thread1of1ForFork0_#t~ite23_80|) (= |v_P2_#t~ite24_66| v_~y$w_buff0~0_273) (= |v_P2Thread1of1ForFork0_#t~mem22_80| |v_P2_#t~mem22_71|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_233|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_471, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_58|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_58|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_58|, ~#y~0.base=|v_~#y~0.base_233|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_277, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_271, ~y$w_buff0~0=v_~y$w_buff0~0_274, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_80|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_58|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_58|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_58|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_25|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_58|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_58|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_58|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_58|, ~y$w_buff1~0=v_~y$w_buff1~0_248, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_111, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_58|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_182, #memory_int=|v_#memory_int_463|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_80|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_437, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_58|} OutVars{~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_102, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_102, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_25|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_29, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_83, ~y$mem_tmp~0=v_~y$mem_tmp~0_58, ~weak$$choice1~0=v_~weak$$choice1~0_142, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_275, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_77, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_38|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_42|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_82, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_139, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_25|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_25|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, ~weak$$choice0~0=v_~weak$$choice0~0_121, ~y$w_buff1~0=v_~y$w_buff1~0_247, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_181, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_119, ~x~0=v_~x~0_53, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_25|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_31|, ~#y~0.offset=|v_~#y~0.offset_233|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_469, ~#y~0.base=|v_~#y~0.base_233|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_58, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_31, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_31|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_269, ~y$w_buff0~0=v_~y$w_buff0~0_273, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_31|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_31, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_38|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_97, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_143, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_111, #memory_int=|v_#memory_int_461|, ~z~0=v_~z~0_61, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_31|, ~weak$$choice2~0=v_~weak$$choice2~0_94, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_435} AuxVars[|v_P2_#t~ite21_62|, |v_P2_#t~mem13_103|, |v_P2_#t~ite24_66|, |v_P2_#t~ite23_66|, |v_P2_#t~mem20_67|, |v_P2_#t~ite14_100|, |v_P2_#t~ite15_82|, |v_P2_#t~ite17_70|, |v_P2_#t~ite16_80|, |v_P2_#t~mem22_71|, |v_P2_#t~mem11_87|, |v_P2_#t~ite12_86|, |v_P2_#t~mem10_67|] AssignedVars[P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P2Thread1of1ForFork0_#t~ite24, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, P1Thread1of1ForFork2_~arg#1.offset, P2Thread1of1ForFork0_#t~mem10, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, ~x~0, P1Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, ~y$r_buff1_thd1~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~mem11, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX$read_delayed~0, ~y$r_buff1_thd2~0, P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite12, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [627] L790-->L797: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_50 256) 0))) (let ((.cse11 (= (mod v_~y$w_buff0_used~0_194 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd2~0_43 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_189 256) 0)) (.cse6 (not (= (mod v_~y$w_buff0_used~0_193 256) 0))) (.cse1 (not .cse10))) (let ((.cse4 (and .cse6 .cse1)) (.cse2 (not .cse8)) (.cse3 (not .cse9)) (.cse5 (select |v_#memory_int_169| |v_~#y~0.base_112|)) (.cse0 (not .cse11))) (and (= v_~y$w_buff0_used~0_193 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_194)) (= v_~y$w_buff1_used~0_188 (ite (or (and .cse2 .cse3) .cse4) 0 v_~y$w_buff1_used~0_189)) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_50) v_~y$r_buff0_thd2~0_49) (= (store |v_#memory_int_169| |v_~#y~0.base_112| (store .cse5 |v_~#y~0.offset_112| |v_P1_#t~ite5#1_27|)) |v_#memory_int_168|) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse6 (not (= (mod v_~y$r_buff0_thd2~0_49 256) 0)))) 0 v_~y$r_buff1_thd2~0_43) v_~y$r_buff1_thd2~0_42) (let ((.cse7 (= |v_P1Thread1of1ForFork2_#t~mem3#1_1| |v_P1_#t~mem3#1_36|))) (or (and (or (and .cse2 (= |v_P1_#t~ite4#1_29| v_~y$w_buff1~0_82) .cse7 .cse3) (and (= (select .cse5 |v_~#y~0.offset_112|) |v_P1_#t~mem3#1_36|) (or .cse8 .cse9) (= |v_P1_#t~ite4#1_29| |v_P1_#t~mem3#1_36|))) (or .cse10 .cse11) (= |v_P1_#t~ite4#1_29| |v_P1_#t~ite5#1_27|)) (and .cse0 (= |v_P1_#t~ite5#1_27| v_~y$w_buff0~0_77) (= |v_P1_#t~ite4#1_29| |v_P1Thread1of1ForFork2_#t~ite4#1_1|) .cse1 .cse7))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_194, ~y$w_buff1~0=v_~y$w_buff1~0_82, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, #memory_int=|v_#memory_int_169|, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_1|, ~#y~0.base=|v_~#y~0.base_112|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_193, ~y$w_buff1~0=v_~y$w_buff1~0_82, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, #memory_int=|v_#memory_int_168|, ~#y~0.base=|v_~#y~0.base_112|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[|v_P1_#t~ite4#1_29|, |v_P1_#t~ite5#1_27|, |v_P1_#t~mem3#1_36|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem3#1] [2022-12-06 06:37:09,160 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:37:09,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8944 [2022-12-06 06:37:09,161 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 181 flow [2022-12-06 06:37:09,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:09,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:09,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:09,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:37:09,161 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1368035239, now seen corresponding path program 1 times [2022-12-06 06:37:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:09,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591809003] [2022-12-06 06:37:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:09,291 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 06:37:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:09,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591809003] [2022-12-06 06:37:09,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591809003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:09,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:09,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:37:09,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527435144] [2022-12-06 06:37:09,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:09,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:37:09,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:09,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:37:09,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:37:09,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:37:09,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 06:37:09,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:09,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:37:09,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:09,348 INFO L130 PetriNetUnfolder]: 12/37 cut-off events. [2022-12-06 06:37:09,349 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 06:37:09,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 37 events. 12/37 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 66 event pairs, 0 based on Foata normal form. 7/44 useless extension candidates. Maximal degree in co-relation 165. Up to 22 conditions per place. [2022-12-06 06:37:09,349 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 14 selfloop transitions, 10 changer transitions 1/25 dead transitions. [2022-12-06 06:37:09,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 25 transitions, 207 flow [2022-12-06 06:37:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:37:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:37:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-12-06 06:37:09,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28 [2022-12-06 06:37:09,350 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 181 flow. Second operand 5 states and 28 transitions. [2022-12-06 06:37:09,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 25 transitions, 207 flow [2022-12-06 06:37:09,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 149 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-12-06 06:37:09,351 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 118 flow [2022-12-06 06:37:09,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 06:37:09,351 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-06 06:37:09,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:09,351 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 118 flow [2022-12-06 06:37:09,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:09,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:09,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 118 flow [2022-12-06 06:37:09,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 118 flow [2022-12-06 06:37:09,357 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-06 06:37:09,357 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-06 06:37:09,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 29 events. 8/29 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 42 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 82. Up to 13 conditions per place. [2022-12-06 06:37:09,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 118 flow [2022-12-06 06:37:09,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-06 06:37:09,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] $Ultimate##0-->L797: Formula: (let ((.cse25 (mod v_~y$w_buff0_used~0_477 256))) (let ((.cse26 (mod v_~weak$$choice0~0_123 256)) (.cse15 (= .cse25 0)) (.cse21 (= (mod v_~y$w_buff1_used~0_443 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd3~0_276 256) 0)) (.cse11 (= 0 (mod v_~weak$$choice2~0_96 256)))) (let ((.cse0 (not .cse11)) (.cse7 (not .cse4)) (.cse6 (not .cse21)) (.cse3 (= (mod v_~y$r_buff1_thd3~0_282 256) 0)) (.cse23 (not .cse15)) (.cse22 (= (mod v_~weak$$choice1~0_144 256) 0)) (.cse20 (not (= .cse26 0)))) (let ((.cse12 (ite (= (ite .cse0 .cse25 (ite .cse15 .cse25 (ite (and .cse7 .cse23) 0 (ite (and .cse6 .cse3 .cse4 .cse23) (ite (or .cse22 .cse20) 1 0) .cse26)))) 0) 0 1))) (let ((.cse24 (select |v_#memory_int_469| |v_~#y~0.base_235|)) (.cse1 (= (mod .cse12 256) 0))) (let ((.cse8 (not (= (mod v_~y$w_buff0_used~0_475 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd2~0_187 256) 0))) (.cse5 (not .cse1)) (.cse9 (select .cse24 |v_~#y~0.offset_235|))) (and (= 0 v_~y$flush_delayed~0_84) (= v_~y$r_buff0_thd0~0_113 v_~y$r_buff1_thd0~0_121) (= v_~weak$$choice1~0_144 |v_P2Thread1of1ForFork0_#t~nondet9_62|) (= v_~z~0_63 v_~__unbuffered_p0_EAX~0_85) (= (ite .cse0 v_~y$r_buff0_thd3~0_276 (ite .cse1 v_~y$r_buff0_thd3~0_276 (let ((.cse2 (and .cse7 .cse5))) (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 (not (= (mod (ite .cse0 v_~y$w_buff1_used~0_443 (ite .cse1 v_~y$w_buff1_used~0_443 (ite .cse2 0 (ite (and .cse6 .cse3 .cse4 .cse5) v_~weak$$choice0~0_123 0)))) 256) 0))) v_~y$r_buff0_thd3~0_276 0))))) v_~y$r_buff0_thd3~0_275) (= v_~y$w_buff0~0_277 1) (= v_~z~0_63 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_40| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_40|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_40| 0)) (= v_~weak$$choice2~0_96 |v_P2Thread1of1ForFork0_#t~nondet7_62|) (= v_~__unbuffered_p2_EAX$read_delayed~0_99 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_27| |v_P1Thread1of1ForFork2_~arg#1.offset_27|) (= v_~y$w_buff1~0_251 v_~y$w_buff0~0_278) (= v_~y$r_buff0_thd2~0_185 (ite .cse8 0 1)) (= v_~y$r_buff0_thd1~0_56 v_~y$r_buff1_thd1~0_60) (= v_~y$w_buff0_used~0_475 0) (= .cse9 v_~y$mem_tmp~0_60) (= v_~y$r_buff0_thd3~0_275 v_~y$r_buff1_thd3~0_281) (= v_~x~0_55 v_~__unbuffered_p1_EAX~0_79) (= (ite (or (and .cse10 (not (= (mod v_~y$w_buff1_used~0_441 256) 0))) (and .cse8 (not (= (mod v_~y$r_buff0_thd2~0_185 256) 0)))) 0 v_~y$r_buff0_thd2~0_187) v_~y$r_buff1_thd2~0_145) (or (and (= |v_P2_#t~mem20_69| v_~__unbuffered_p2_EAX~0_141) .cse11 (= |v_P2_#t~ite21_64| |v_P2_#t~mem20_69|)) (and .cse0 (= |v_P2Thread1of1ForFork0_#t~mem20_62| |v_P2_#t~mem20_69|) (= |v_P2_#t~ite21_64| v_~y$mem_tmp~0_60))) (= |v_P2Thread1of1ForFork0_#in~arg.base_33| v_P2Thread1of1ForFork0_~arg.base_33) (= (ite (or .cse8 (and .cse10 .cse5)) 0 .cse12) v_~y$w_buff1_used~0_441) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_104 |v_~#y~0.base_235|) (let ((.cse19 (= |v_P2_#t~ite16_82| |v_P2Thread1of1ForFork0_#t~ite16_62|)) (.cse16 (= |v_P2_#t~ite12_88| |v_P2Thread1of1ForFork0_#t~ite12_62|)) (.cse13 (= |v_P2_#t~ite15_84| |v_P2Thread1of1ForFork0_#t~ite15_62|)) (.cse14 (= |v_P2Thread1of1ForFork0_#t~mem11_62| |v_P2_#t~mem11_89|)) (.cse17 (= |v_P2Thread1of1ForFork0_#t~mem13_62| |v_P2_#t~mem13_105|)) (.cse18 (= |v_P2Thread1of1ForFork0_#t~ite14_62| |v_P2_#t~ite14_102|))) (or (and (= |v_P2_#t~mem10_69| v_~__unbuffered_p2_EAX~0_141) .cse13 .cse14 (= .cse9 |v_P2_#t~mem10_69|) .cse15 .cse16 .cse17 .cse18 (= |v_P2_#t~ite17_72| |v_P2Thread1of1ForFork0_#t~ite17_62|) .cse19) (and (= |v_P2Thread1of1ForFork0_#t~mem10_62| |v_P2_#t~mem10_69|) (= |v_P2_#t~ite17_72| v_~__unbuffered_p2_EAX~0_141) (or (and (= |v_P2_#t~ite17_72| v_~y$w_buff0~0_278) .cse7 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and (or (and .cse14 (or (and .cse6 (= |v_P2_#t~ite15_84| (ite .cse20 v_~y$w_buff1~0_252 v_~y$w_buff0~0_278)) .cse17 .cse18) (and (= |v_P2_#t~mem13_105| |v_P2_#t~ite14_102|) (= |v_P2_#t~ite15_84| |v_P2_#t~ite14_102|) .cse21 (= .cse9 |v_P2_#t~mem13_105|))) (or (not .cse3) .cse21) (= |v_P2_#t~ite15_84| |v_P2_#t~ite16_82|) .cse16) (and .cse6 .cse13 .cse3 .cse14 (= |v_P2_#t~ite12_88| (ite (not .cse22) v_~y$w_buff0~0_278 v_~y$w_buff1~0_252)) .cse17 .cse18 (= |v_P2_#t~ite16_82| |v_P2_#t~ite12_88|))) .cse4 (= |v_P2_#t~ite16_82| |v_P2_#t~ite17_72|))) .cse23))) (= (store |v_#memory_int_469| |v_~#y~0.base_235| (store .cse24 |v_~#y~0.offset_235| v_~y$w_buff0~0_277)) |v_#memory_int_467|) (= v_~weak$$choice0~0_123 |v_P2Thread1of1ForFork0_#t~nondet6_62|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_33| v_P2Thread1of1ForFork0_~arg.offset_33) (= v_P0Thread1of1ForFork1_~arg.offset_31 |v_P0Thread1of1ForFork1_#in~arg.offset_31|) (= |v_~#y~0.offset_235| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_104) (= |v_P0Thread1of1ForFork1_#in~arg.base_31| v_P0Thread1of1ForFork1_~arg.base_31) (= v_~x~0_55 1) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_40|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_27| |v_P1Thread1of1ForFork2_~arg#1.base_27|)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_235|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_477, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_62|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_62|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_62|, ~#y~0.base=|v_~#y~0.base_235|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_27|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_282, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, ~y$w_buff0~0=v_~y$w_buff0~0_278, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_276, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_56, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_62|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_62|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_62|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_27|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_62|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_62|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_62|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_62|, ~y$w_buff1~0=v_~y$w_buff1~0_252, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_62|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_187, #memory_int=|v_#memory_int_469|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_443, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_62|} OutVars{~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_104, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_104, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_27|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_31, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~y$mem_tmp~0=v_~y$mem_tmp~0_60, ~weak$$choice1~0=v_~weak$$choice1~0_144, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_281, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_40|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_56, ~y$flush_delayed~0=v_~y$flush_delayed~0_84, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_141, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_57|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_27|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_57|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_27|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, ~weak$$choice0~0=v_~weak$$choice0~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_251, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_185, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~x~0=v_~x~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_27|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_33|, ~#y~0.offset=|v_~#y~0.offset_235|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_475, ~#y~0.base=|v_~#y~0.base_235|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_60, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_33, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_33|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, ~y$w_buff0~0=v_~y$w_buff0~0_277, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_275, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_33|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_33, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_40|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_99, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_145, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, #memory_int=|v_#memory_int_467|, ~z~0=v_~z~0_63, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_33|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_441} AuxVars[|v_P2_#t~ite15_84|, |v_P2_#t~mem13_105|, |v_P2_#t~ite14_102|, |v_P2_#t~ite16_82|, |v_P2_#t~mem20_69|, |v_P2_#t~ite21_64|, |v_P2_#t~ite17_72|, |v_P2_#t~ite12_88|, |v_P2_#t~mem10_69|, |v_P2_#t~mem11_89|] AssignedVars[P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2_#t~ite5#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, P1Thread1of1ForFork2_#t~ite4#1, P1Thread1of1ForFork2_~arg#1.offset, P2Thread1of1ForFork0_#t~mem10, P1Thread1of1ForFork2_#t~mem3#1, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, ~x~0, P1Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, ~y$r_buff1_thd1~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~mem11, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX$read_delayed~0, ~y$r_buff1_thd2~0, P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:37:13,220 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:37:13,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3870 [2022-12-06 06:37:13,221 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 112 flow [2022-12-06 06:37:13,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 06:37:13,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:13,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:13,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:37:13,222 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:13,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash 462714682, now seen corresponding path program 1 times [2022-12-06 06:37:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:13,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939774039] [2022-12-06 06:37:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:37:13,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:37:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:37:13,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:37:13,324 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:37:13,325 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:37:13,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:37:13,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:37:13,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:37:13,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:37:13,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:37:13,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:37:13,329 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:13,332 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:37:13,332 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:37:13,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:37:13 BasicIcfg [2022-12-06 06:37:13,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:37:13,401 INFO L158 Benchmark]: Toolchain (without parser) took 45119.75ms. Allocated memory was 203.4MB in the beginning and 726.7MB in the end (delta: 523.2MB). Free memory was 164.7MB in the beginning and 589.4MB in the end (delta: -424.7MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. [2022-12-06 06:37:13,401 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 180.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:37:13,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.58ms. Allocated memory is still 203.4MB. Free memory was 164.7MB in the beginning and 136.9MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:37:13,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.87ms. Allocated memory is still 203.4MB. Free memory was 136.9MB in the beginning and 134.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:37:13,402 INFO L158 Benchmark]: Boogie Preprocessor took 29.15ms. Allocated memory is still 203.4MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:37:13,402 INFO L158 Benchmark]: RCFGBuilder took 869.25ms. Allocated memory is still 203.4MB. Free memory was 132.2MB in the beginning and 171.1MB in the end (delta: -38.8MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. [2022-12-06 06:37:13,402 INFO L158 Benchmark]: TraceAbstraction took 43746.50ms. Allocated memory was 203.4MB in the beginning and 726.7MB in the end (delta: 523.2MB). Free memory was 170.0MB in the beginning and 589.4MB in the end (delta: -419.4MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. [2022-12-06 06:37:13,403 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 180.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 417.58ms. Allocated memory is still 203.4MB. Free memory was 164.7MB in the beginning and 136.9MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.87ms. Allocated memory is still 203.4MB. Free memory was 136.9MB in the beginning and 134.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.15ms. Allocated memory is still 203.4MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 869.25ms. Allocated memory is still 203.4MB. Free memory was 132.2MB in the beginning and 171.1MB in the end (delta: -38.8MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. * TraceAbstraction took 43746.50ms. Allocated memory was 203.4MB in the beginning and 726.7MB in the end (delta: 523.2MB). Free memory was 170.0MB in the beginning and 589.4MB in the end (delta: -419.4MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 132 PlacesBefore, 35 PlacesAfterwards, 124 TransitionsBefore, 26 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1373, independent: 1317, independent conditional: 1317, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1373, independent: 1317, independent conditional: 0, independent unconditional: 1317, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1373, independent: 1317, independent conditional: 0, independent unconditional: 1317, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1373, independent: 1317, independent conditional: 0, independent unconditional: 1317, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1129, independent: 1095, independent conditional: 0, independent unconditional: 1095, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1129, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 254, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1373, independent: 222, independent conditional: 0, independent unconditional: 222, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1129, unknown conditional: 0, unknown unconditional: 1129] , Statistics on independence cache: Total cache size (in pairs): 1635, Positive cache size: 1601, Positive conditional cache size: 0, Positive unconditional cache size: 1601, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, independent: 47, independent conditional: 3, independent unconditional: 44, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 147, dependent conditional: 12, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 64, unknown conditional: 5, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 47, Positive conditional cache size: 3, Positive unconditional cache size: 44, Negative cache size: 17, Negative conditional cache size: 2, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 47, independent conditional: 47, 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: 65, independent: 47, independent conditional: 3, independent unconditional: 44, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 47, independent conditional: 0, independent unconditional: 47, 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: 65, independent: 47, independent conditional: 0, independent unconditional: 47, 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: 5, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 5, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 50, Positive conditional cache size: 3, Positive unconditional cache size: 47, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 32 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 107, independent: 76, independent conditional: 16, independent unconditional: 60, dependent: 31, dependent conditional: 2, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 11, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 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] ], Cache Queries: [ total: 107, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 65, Positive conditional cache size: 3, Positive unconditional cache size: 62, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 22, independent conditional: 4, independent unconditional: 18, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 36, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 66, Positive conditional cache size: 3, Positive unconditional cache size: 63, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 34 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 16 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 37, independent conditional: 12, independent unconditional: 25, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 27, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 84, Positive conditional cache size: 3, Positive unconditional cache size: 81, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 40, independent conditional: 22, independent unconditional: 18, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 40, independent conditional: 22, independent unconditional: 18, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 40, independent conditional: 22, independent unconditional: 18, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 31, independent conditional: 16, independent unconditional: 15, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 10, unknown conditional: 7, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 93, Positive conditional cache size: 9, Positive unconditional cache size: 84, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 40, independent conditional: 40, 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: 56, independent: 40, independent conditional: 30, independent unconditional: 10, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 40, independent conditional: 30, independent unconditional: 10, 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: 56, independent: 40, independent conditional: 30, independent unconditional: 10, 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: 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: 56, independent: 38, independent conditional: 28, independent unconditional: 10, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 95, Positive conditional cache size: 11, Positive unconditional cache size: 84, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 41 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 163, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 163, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 117, Positive conditional cache size: 21, Positive unconditional cache size: 96, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 44, independent conditional: 44, 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: 66, independent: 44, independent conditional: 24, independent unconditional: 20, 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: 66, independent: 44, independent conditional: 24, independent unconditional: 20, 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: 66, independent: 44, independent conditional: 24, independent unconditional: 20, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 66, independent: 42, independent conditional: 23, independent unconditional: 19, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 119, Positive conditional cache size: 22, Positive unconditional cache size: 97, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 59, independent conditional: 26, independent unconditional: 33, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 59, independent conditional: 26, independent unconditional: 33, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 59, independent conditional: 26, independent unconditional: 33, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 58, independent conditional: 25, independent unconditional: 33, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 120, Positive conditional cache size: 23, Positive unconditional cache size: 97, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 40 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 128, Positive conditional cache size: 23, Positive unconditional cache size: 105, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 38 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 26 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 141, Positive conditional cache size: 32, Positive unconditional cache size: 109, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 30 PlacesBefore, 27 PlacesAfterwards, 22 TransitionsBefore, 19 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 148, Positive conditional cache size: 34, Positive unconditional cache size: 114, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1940, ((void *)0), P0, ((void *)0))=-1, t1940={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t1941; [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1941, ((void *)0), P1, ((void *)0))=0, t1940={7:0}, t1941={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] 0 pthread_t t1942; [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1942, ((void *)0), P2, ((void *)0))=1, t1940={7:0}, t1941={8:0}, t1942={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 [L825] 3 z = 1 [L762] 3 __unbuffered_p0_EAX = z [L765] 3 x = 1 [L777] 3 __unbuffered_p1_EAX = x [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 1 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd2 = (_Bool)1 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 3 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 851]: 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, 153 locations, 6 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: 43.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 2 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=10, InterpolantAutomatonStates: 55, 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, 5.2s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 1295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 06:37:13,447 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...