/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/thin002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:46:16,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:46:16,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:46:16,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:46:16,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:46:16,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:46:16,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:46:16,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:46:16,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:46:16,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:46:16,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:46:16,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:46:16,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:46:16,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:46:16,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:46:16,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:46:16,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:46:16,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:46:16,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:46:16,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:46:16,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:46:16,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:46:16,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:46:16,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:46:16,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:46:16,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:46:16,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:46:16,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:46:16,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:46:16,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:46:16,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:46:16,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:46:16,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:46:16,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:46:16,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:46:16,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:46:16,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:46:16,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:46:16,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:46:16,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:46:16,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:46:16,592 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:46:16,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:46:16,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:46:16,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:46:16,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:46:16,620 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:46:16,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:46:16,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:46:16,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:46:16,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:46:16,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:46:16,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:46:16,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:46:16,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:46:16,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:46:16,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:46:16,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:46:16,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:46:16,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:46:16,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:46:16,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:46:16,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:46:16,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:46:16,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:46:16,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:46:16,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:46:16,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:46:16,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:46:16,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:46:16,624 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:46:16,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:46:16,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:46:16,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:46:16,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:46:16,927 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:46:16,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2022-12-06 06:46:17,981 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:46:18,272 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:46:18,272 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2022-12-06 06:46:18,294 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd5c5682/844dd507124643e98c3a6ff23bf2bdd0/FLAGad4866471 [2022-12-06 06:46:18,306 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd5c5682/844dd507124643e98c3a6ff23bf2bdd0 [2022-12-06 06:46:18,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:46:18,308 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:46:18,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:46:18,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:46:18,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:46:18,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47bc08ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18, skipping insertion in model container [2022-12-06 06:46:18,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:46:18,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:46:18,500 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/thin002_power.opt.i[951,964] [2022-12-06 06:46:18,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:46:18,712 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:46:18,722 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/thin002_power.opt.i[951,964] [2022-12-06 06:46:18,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:46:18,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:46:18,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:46:18,831 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:46:18,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18 WrapperNode [2022-12-06 06:46:18,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:46:18,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:46:18,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:46:18,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:46:18,837 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:46:18" (1/1) ... [2022-12-06 06:46:18,864 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:46:18" (1/1) ... [2022-12-06 06:46:18,890 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2022-12-06 06:46:18,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:46:18,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:46:18,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:46:18,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:46:18,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,924 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:46:18,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:46:18,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:46:18,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:46:18,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (1/1) ... [2022-12-06 06:46:18,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:46:18,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:46:18,989 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:46:18,997 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:46:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:46:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:46:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:46:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:46:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:46:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:46:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:46:19,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:46:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:46:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:46:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:46:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:46:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:46:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:46:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:46:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:46:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:46:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:46:19,028 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:46:19,182 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:46:19,183 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:46:19,634 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:46:19,887 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:46:19,888 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:46:19,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:46:19 BoogieIcfgContainer [2022-12-06 06:46:19,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:46:19,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:46:19,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:46:19,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:46:19,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:46:18" (1/3) ... [2022-12-06 06:46:19,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b8ade2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:46:19, skipping insertion in model container [2022-12-06 06:46:19,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:46:18" (2/3) ... [2022-12-06 06:46:19,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b8ade2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:46:19, skipping insertion in model container [2022-12-06 06:46:19,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:46:19" (3/3) ... [2022-12-06 06:46:19,898 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2022-12-06 06:46:19,912 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:46:19,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:46:19,912 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:46:19,979 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:46:20,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-12-06 06:46:20,082 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-06 06:46:20,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:46:20,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 06:46:20,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-12-06 06:46:20,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2022-12-06 06:46:20,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:20,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-06 06:46:20,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2022-12-06 06:46:20,155 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-06 06:46:20,155 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:46:20,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 06:46:20,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-06 06:46:20,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 2750 [2022-12-06 06:46:29,348 INFO L203 LiptonReduction]: Total number of compositions: 118 [2022-12-06 06:46:29,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:46:29,373 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;@e5180a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:46:29,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:46:29,394 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:46:29,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:46:29,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:29,395 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:29,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:29,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash -334226780, now seen corresponding path program 1 times [2022-12-06 06:46:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:29,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153913306] [2022-12-06 06:46:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:29,767 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:46:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:29,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153913306] [2022-12-06 06:46:29,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153913306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:29,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:29,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:46:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925500123] [2022-12-06 06:46:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:29,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:46:29,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:29,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:46:29,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:46:29,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 06:46:29,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:29,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:29,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 06:46:29,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:30,551 INFO L130 PetriNetUnfolder]: 3251/4517 cut-off events. [2022-12-06 06:46:30,551 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-06 06:46:30,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9130 conditions, 4517 events. 3251/4517 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23094 event pairs, 1172 based on Foata normal form. 0/4072 useless extension candidates. Maximal degree in co-relation 9118. Up to 2809 conditions per place. [2022-12-06 06:46:30,577 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 32 selfloop transitions, 2 changer transitions 6/43 dead transitions. [2022-12-06 06:46:30,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 181 flow [2022-12-06 06:46:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:46:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:46:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 06:46:30,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-06 06:46:30,587 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 54 transitions. [2022-12-06 06:46:30,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 181 flow [2022-12-06 06:46:30,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:46:30,592 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 62 flow [2022-12-06 06:46:30,594 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-06 06:46:30,597 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 06:46:30,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:30,598 INFO L89 Accepts]: Start accepts. Operand has 39 places, 25 transitions, 62 flow [2022-12-06 06:46:30,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:30,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:30,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 62 flow [2022-12-06 06:46:30,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 62 flow [2022-12-06 06:46:30,615 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 06:46:30,616 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:46:30,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:46:30,616 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 62 flow [2022-12-06 06:46:30,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 06:46:30,723 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:46:30,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 06:46:30,726 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-06 06:46:30,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:30,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:30,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:30,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:46:30,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:30,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:30,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1194257849, now seen corresponding path program 1 times [2022-12-06 06:46:30,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:30,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124757766] [2022-12-06 06:46:30,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:30,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:30,951 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:46:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:30,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124757766] [2022-12-06 06:46:30,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124757766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:30,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:30,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:46:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461915006] [2022-12-06 06:46:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:30,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:46:30,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:30,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:46:30,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:46:30,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:46:30,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:30,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:30,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:46:30,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:31,298 INFO L130 PetriNetUnfolder]: 2006/2822 cut-off events. [2022-12-06 06:46:31,299 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 06:46:31,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5909 conditions, 2822 events. 2006/2822 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13656 event pairs, 350 based on Foata normal form. 36/2845 useless extension candidates. Maximal degree in co-relation 5899. Up to 2413 conditions per place. [2022-12-06 06:46:31,314 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 31 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-12-06 06:46:31,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 152 flow [2022-12-06 06:46:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:46:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:46:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:46:31,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 06:46:31,315 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:46:31,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 152 flow [2022-12-06 06:46:31,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:46:31,322 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 66 flow [2022-12-06 06:46:31,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-06 06:46:31,323 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -6 predicate places. [2022-12-06 06:46:31,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:31,323 INFO L89 Accepts]: Start accepts. Operand has 37 places, 25 transitions, 66 flow [2022-12-06 06:46:31,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:31,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:31,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-06 06:46:31,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 66 flow [2022-12-06 06:46:31,328 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 06:46:31,328 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:46:31,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:46:31,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-06 06:46:31,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 06:46:31,384 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:46:31,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 06:46:31,386 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2022-12-06 06:46:31,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:31,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:31,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:31,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:46:31,387 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:31,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:31,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1632713869, now seen corresponding path program 1 times [2022-12-06 06:46:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:31,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5410283] [2022-12-06 06:46:31,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:31,548 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:46:31,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:31,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5410283] [2022-12-06 06:46:31,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5410283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:31,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:31,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:46:31,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536303917] [2022-12-06 06:46:31,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:31,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:46:31,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:31,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:46:31,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:46:31,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:46:31,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:31,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:31,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:46:31,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:31,955 INFO L130 PetriNetUnfolder]: 1854/2832 cut-off events. [2022-12-06 06:46:31,955 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-06 06:46:31,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5906 conditions, 2832 events. 1854/2832 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 15230 event pairs, 440 based on Foata normal form. 48/2867 useless extension candidates. Maximal degree in co-relation 5895. Up to 1991 conditions per place. [2022-12-06 06:46:31,976 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 35 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-06 06:46:31,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 177 flow [2022-12-06 06:46:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:46:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:46:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 06:46:31,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-06 06:46:31,980 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 3 states and 47 transitions. [2022-12-06 06:46:31,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 177 flow [2022-12-06 06:46:31,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:46:31,982 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 70 flow [2022-12-06 06:46:31,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 06:46:31,983 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2022-12-06 06:46:31,984 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:31,984 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 70 flow [2022-12-06 06:46:31,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:31,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:31,985 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 70 flow [2022-12-06 06:46:31,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 70 flow [2022-12-06 06:46:31,990 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 06:46:31,991 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:46:31,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 25 events. 0/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:46:31,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 70 flow [2022-12-06 06:46:31,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 06:46:31,993 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:46:31,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:46:31,994 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 70 flow [2022-12-06 06:46:31,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:31,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:31,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:31,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:46:31,995 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2053009705, now seen corresponding path program 1 times [2022-12-06 06:46:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:31,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311805168] [2022-12-06 06:46:31,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:32,143 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:46:32,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:32,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311805168] [2022-12-06 06:46:32,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311805168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:32,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:32,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:46:32,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200596294] [2022-12-06 06:46:32,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:32,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:46:32,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:46:32,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:46:32,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:46:32,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:32,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:32,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:46:32,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:32,784 INFO L130 PetriNetUnfolder]: 2975/4364 cut-off events. [2022-12-06 06:46:32,784 INFO L131 PetriNetUnfolder]: For 726/726 co-relation queries the response was YES. [2022-12-06 06:46:32,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9700 conditions, 4364 events. 2975/4364 cut-off events. For 726/726 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 23934 event pairs, 1025 based on Foata normal form. 128/4466 useless extension candidates. Maximal degree in co-relation 9688. Up to 1502 conditions per place. [2022-12-06 06:46:32,798 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 49 selfloop transitions, 3 changer transitions 3/57 dead transitions. [2022-12-06 06:46:32,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 259 flow [2022-12-06 06:46:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:46:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:46:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:46:32,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 06:46:32,800 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 70 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:46:32,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 57 transitions, 259 flow [2022-12-06 06:46:32,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:46:32,802 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 80 flow [2022-12-06 06:46:32,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2022-12-06 06:46:32,802 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2022-12-06 06:46:32,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:32,802 INFO L89 Accepts]: Start accepts. Operand has 41 places, 25 transitions, 80 flow [2022-12-06 06:46:32,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:32,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:32,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 25 transitions, 80 flow [2022-12-06 06:46:32,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 25 transitions, 80 flow [2022-12-06 06:46:32,820 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 06:46:32,820 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-12-06 06:46:32,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 25 events. 0/25 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:46:32,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 25 transitions, 80 flow [2022-12-06 06:46:32,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 06:46:32,847 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:46:32,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:46:32,851 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 78 flow [2022-12-06 06:46:32,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:32,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:32,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:32,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:46:32,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash -371521117, now seen corresponding path program 1 times [2022-12-06 06:46:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:32,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183159636] [2022-12-06 06:46:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:33,050 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:46:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:33,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183159636] [2022-12-06 06:46:33,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183159636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:33,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:33,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:46:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967094442] [2022-12-06 06:46:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:33,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:46:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:33,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:46:33,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:46:33,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:46:33,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:33,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:33,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:46:33,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:33,296 INFO L130 PetriNetUnfolder]: 1264/1932 cut-off events. [2022-12-06 06:46:33,297 INFO L131 PetriNetUnfolder]: For 955/955 co-relation queries the response was YES. [2022-12-06 06:46:33,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4725 conditions, 1932 events. 1264/1932 cut-off events. For 955/955 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9041 event pairs, 358 based on Foata normal form. 16/1946 useless extension candidates. Maximal degree in co-relation 4711. Up to 1302 conditions per place. [2022-12-06 06:46:33,306 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 30 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-06 06:46:33,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 171 flow [2022-12-06 06:46:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:46:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:46:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 06:46:33,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 06:46:33,308 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 78 flow. Second operand 3 states and 39 transitions. [2022-12-06 06:46:33,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 171 flow [2022-12-06 06:46:33,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 154 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:46:33,309 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 74 flow [2022-12-06 06:46:33,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-06 06:46:33,310 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 06:46:33,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:33,310 INFO L89 Accepts]: Start accepts. Operand has 39 places, 24 transitions, 74 flow [2022-12-06 06:46:33,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:33,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:33,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 74 flow [2022-12-06 06:46:33,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 24 transitions, 74 flow [2022-12-06 06:46:33,316 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 06:46:33,316 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:46:33,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 24 events. 0/24 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:46:33,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 74 flow [2022-12-06 06:46:33,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-06 06:46:33,372 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:46:33,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 06:46:33,373 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 74 flow [2022-12-06 06:46:33,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:33,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:33,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:33,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:46:33,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:33,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:33,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1471551417, now seen corresponding path program 1 times [2022-12-06 06:46:33,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:33,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577759320] [2022-12-06 06:46:33,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:33,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:33,500 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:46:33,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:33,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577759320] [2022-12-06 06:46:33,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577759320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:33,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:33,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:46:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373270398] [2022-12-06 06:46:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:33,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:46:33,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:33,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:46:33,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:46:33,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:46:33,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:33,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:33,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:46:33,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:33,884 INFO L130 PetriNetUnfolder]: 2114/3071 cut-off events. [2022-12-06 06:46:33,884 INFO L131 PetriNetUnfolder]: For 964/964 co-relation queries the response was YES. [2022-12-06 06:46:33,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7121 conditions, 3071 events. 2114/3071 cut-off events. For 964/964 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14353 event pairs, 806 based on Foata normal form. 72/3118 useless extension candidates. Maximal degree in co-relation 7108. Up to 1137 conditions per place. [2022-12-06 06:46:33,895 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 39 selfloop transitions, 3 changer transitions 7/50 dead transitions. [2022-12-06 06:46:33,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 237 flow [2022-12-06 06:46:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:46:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:46:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:46:33,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2022-12-06 06:46:33,897 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 74 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:46:33,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 237 flow [2022-12-06 06:46:33,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:46:33,899 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 84 flow [2022-12-06 06:46:33,899 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2022-12-06 06:46:33,899 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2022-12-06 06:46:33,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:33,899 INFO L89 Accepts]: Start accepts. Operand has 42 places, 24 transitions, 84 flow [2022-12-06 06:46:33,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:33,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:33,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 24 transitions, 84 flow [2022-12-06 06:46:33,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 24 transitions, 84 flow [2022-12-06 06:46:33,905 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 06:46:33,905 INFO L131 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2022-12-06 06:46:33,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 24 events. 0/24 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:46:33,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 24 transitions, 84 flow [2022-12-06 06:46:33,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 06:46:33,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:46:33,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 06:46:33,970 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 82 flow [2022-12-06 06:46:33,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:33,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:33,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:33,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:46:33,971 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:33,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2039092720, now seen corresponding path program 1 times [2022-12-06 06:46:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:33,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359031094] [2022-12-06 06:46:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:34,125 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:46:34,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:34,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359031094] [2022-12-06 06:46:34,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359031094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:34,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:34,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:46:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825217921] [2022-12-06 06:46:34,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:34,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:46:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:34,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:46:34,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:46:34,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:46:34,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 82 flow. Second operand has 4 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:46:34,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:34,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:46:34,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:34,380 INFO L130 PetriNetUnfolder]: 1395/2053 cut-off events. [2022-12-06 06:46:34,380 INFO L131 PetriNetUnfolder]: For 1922/1922 co-relation queries the response was YES. [2022-12-06 06:46:34,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 2053 events. 1395/2053 cut-off events. For 1922/1922 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8270 event pairs, 610 based on Foata normal form. 64/2117 useless extension candidates. Maximal degree in co-relation 4978. Up to 789 conditions per place. [2022-12-06 06:46:34,387 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 26 selfloop transitions, 3 changer transitions 15/44 dead transitions. [2022-12-06 06:46:34,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 233 flow [2022-12-06 06:46:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:46:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:46:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:46:34,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:46:34,388 INFO L175 Difference]: Start difference. First operand has 41 places, 23 transitions, 82 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:46:34,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 233 flow [2022-12-06 06:46:34,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 205 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 06:46:34,390 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 80 flow [2022-12-06 06:46:34,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2022-12-06 06:46:34,391 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2022-12-06 06:46:34,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:34,391 INFO L89 Accepts]: Start accepts. Operand has 41 places, 23 transitions, 80 flow [2022-12-06 06:46:34,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:34,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:34,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 23 transitions, 80 flow [2022-12-06 06:46:34,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 80 flow [2022-12-06 06:46:34,396 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 06:46:34,396 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 06:46:34,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 23 events. 0/23 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:46:34,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 23 transitions, 80 flow [2022-12-06 06:46:34,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:46:34,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [829] $Ultimate##0-->L790: Formula: (and (= v_~x~0_40 v_~__unbuffered_p1_EAX~0_72) (= |v_P1Thread1of1ForFork2_#in~arg.base_15| v_P1Thread1of1ForFork2_~arg.base_15) (= |v_P1Thread1of1ForFork2_#in~arg.offset_15| v_P1Thread1of1ForFork2_~arg.offset_15) (= v_~y~0_43 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_15|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_15|, ~x~0=v_~x~0_40} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_15|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_15, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_15|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_40} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, ~y~0] and [804] $Ultimate##0-->L802: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_5| |v_P2Thread1of1ForFork3_~arg#1.offset_5|) (= v_~y~0_17 v_~__unbuffered_p2_EAX~0_45) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_5| |v_P2Thread1of1ForFork3_~arg#1.base_5|)) InVars {P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_5|, ~y~0=v_~y~0_17, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_5|} OutVars{P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_5|, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_5|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_5|, ~y~0=v_~y~0_17, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg#1.offset, P2Thread1of1ForFork3_~arg#1.base, ~__unbuffered_p2_EAX~0] [2022-12-06 06:46:34,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [828] $Ultimate##0-->L775: Formula: (and (= v_~x~0_34 1) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|) (= v_~a~0_37 v_~__unbuffered_p0_EAX~0_72)) InVars {~a~0=v_~a~0_37, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|} OutVars{~a~0=v_~a~0_37, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~x~0=v_~x~0_34, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [830] $Ultimate##0-->L802: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_19| |v_P2Thread1of1ForFork3_~arg#1.offset_19|) (= v_~y~0_45 v_~__unbuffered_p2_EAX~0_77) (= |v_P1Thread1of1ForFork2_#in~arg.offset_17| v_P1Thread1of1ForFork2_~arg.offset_17) (= v_~y~0_45 1) (= v_~x~0_42 v_~__unbuffered_p1_EAX~0_74) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_19| |v_P2Thread1of1ForFork3_~arg#1.base_19|) (= |v_P1Thread1of1ForFork2_#in~arg.base_17| v_P1Thread1of1ForFork2_~arg.base_17)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_19|, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_19|, ~x~0=v_~x~0_42} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_17, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_17, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_77, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_19|, ~y~0=v_~y~0_45, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_19|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork3_~arg#1.offset, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork3_~arg#1.base, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-06 06:46:35,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [832] $Ultimate##0-->L851: Formula: (let ((.cse2 (= (mod v_~z$w_buff0_used~0_475 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd4~0_266 256) 0)) (.cse25 (mod v_~z$w_buff0_used~0_476 256)) (.cse26 (mod v_~weak$$choice0~0_105 256))) (let ((.cse20 (= .cse26 0)) (.cse24 (= .cse25 0)) (.cse22 (= 0 (mod v_~z$w_buff1_used~0_422 256))) (.cse1 (= (mod v_~weak$$choice2~0_80 256) 0)) (.cse11 (select |v_#memory_int_489| |v_~#z~0.base_236|)) (.cse14 (not .cse5)) (.cse6 (not .cse2))) (let ((.cse4 (not (= (mod v_~z$w_buff1_used~0_421 256) 0))) (.cse3 (and .cse14 .cse6)) (.cse8 (select .cse11 |v_~#z~0.offset_236|)) (.cse0 (not .cse1)) (.cse12 (not .cse22)) (.cse7 (= (mod v_~z$r_buff1_thd4~0_258 256) 0)) (.cse23 (not .cse24)) (.cse10 (not .cse20)) (.cse21 (= (mod v_~weak$$choice1~0_132 256) 0))) (and (or (and (= |v_P3_#t~ite21_66| v_~z$mem_tmp~0_66) .cse0 (= |v_P3Thread1of1ForFork1_#t~mem20_54| |v_P3_#t~mem20_69|)) (and (= |v_P3_#t~ite21_66| |v_P3_#t~mem20_69|) (= v_~__unbuffered_p3_EAX~0_155 |v_P3_#t~mem20_69|) .cse1)) (= v_~weak$$choice2~0_80 |v_P3Thread1of1ForFork1_#t~nondet7_54|) (= v_~weak$$choice0~0_105 |v_P3Thread1of1ForFork1_#t~nondet6_54|) (= (ite .cse0 v_~z$r_buff0_thd4~0_266 (ite .cse2 v_~z$r_buff0_thd4~0_266 (ite .cse3 0 (ite (and .cse4 .cse5 .cse6 .cse7) v_~z$r_buff0_thd4~0_266 0)))) v_~z$r_buff0_thd4~0_265) (= v_~weak$$choice1~0_132 |v_P3Thread1of1ForFork1_#t~nondet9_54|) (= v_~z$mem_tmp~0_66 .cse8) (= v_~z$flush_delayed~0_82 0) (= v_~__unbuffered_p3_EAX$read_delayed_var~0.base_98 |v_~#z~0.base_236|) (= v_~z$w_buff0~0_268 v_~z$w_buff0~0_267) (= (ite .cse0 v_~z$r_buff1_thd4~0_258 (ite .cse2 v_~z$r_buff1_thd4~0_258 (let ((.cse9 (= (mod v_~z$r_buff0_thd4~0_265 256) 0))) (ite (and (not .cse9) .cse6) 0 (ite (and .cse4 .cse9 .cse6 .cse7) (ite .cse10 v_~z$r_buff1_thd4~0_258 0) 0))))) v_~z$r_buff1_thd4~0_257) (= v_P3Thread1of1ForFork1_~arg.base_29 |v_P3Thread1of1ForFork1_#in~arg.base_29|) (= (store |v_#memory_int_489| |v_~#z~0.base_236| (store .cse11 |v_~#z~0.offset_236| |v_P3_#t~ite21_66|)) |v_#memory_int_488|) (= (ite .cse0 v_~z$w_buff1_used~0_422 (ite .cse2 v_~z$w_buff1_used~0_422 (ite .cse3 0 (ite (and .cse5 .cse6 .cse12 .cse7) v_~weak$$choice0~0_105 0)))) v_~z$w_buff1_used~0_421) (= v_~a~0_47 1) (let ((.cse13 (= |v_P3_#t~ite16_78| |v_P3Thread1of1ForFork1_#t~ite16_54|)) (.cse15 (= |v_P3Thread1of1ForFork1_#t~mem11_54| |v_P3_#t~mem11_89|)) (.cse16 (= |v_P3_#t~ite14_94| |v_P3Thread1of1ForFork1_#t~ite14_54|)) (.cse17 (= |v_P3_#t~ite12_88| |v_P3Thread1of1ForFork1_#t~ite12_54|)) (.cse18 (= |v_P3_#t~ite15_86| |v_P3Thread1of1ForFork1_#t~ite15_54|)) (.cse19 (= |v_P3Thread1of1ForFork1_#t~mem13_54| |v_P3_#t~mem13_95|))) (or (and (= |v_P3_#t~ite17_70| v_~__unbuffered_p3_EAX~0_155) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |v_P3_#t~ite17_70| v_~z$w_buff0~0_268) .cse19) (and (= |v_P3_#t~ite17_70| |v_P3_#t~ite16_78|) .cse5 (or (and (or (and .cse20 .cse15 (= |v_P3_#t~ite12_88| (ite (not .cse21) v_~z$w_buff0~0_268 v_~z$w_buff1~0_238))) (and (= |v_P3_#t~ite12_88| |v_P3_#t~mem11_89|) (= .cse8 |v_P3_#t~mem11_89|) .cse10)) .cse16 (= |v_P3_#t~ite12_88| |v_P3_#t~ite16_78|) .cse12 .cse7 .cse18 .cse19) (and (or .cse22 (not .cse7)) (or (and (or (and .cse20 (= .cse8 |v_P3_#t~mem13_95|) (= |v_P3_#t~ite14_94| |v_P3_#t~mem13_95|)) (and (= |v_P3_#t~ite14_94| v_~z$w_buff0~0_268) .cse10 .cse19)) .cse22 (= |v_P3_#t~ite14_94| |v_P3_#t~ite15_86|)) (and (= |v_P3_#t~ite15_86| (ite .cse10 v_~z$w_buff1~0_238 v_~z$w_buff0~0_268)) .cse16 .cse12 .cse19)) .cse15 (= |v_P3_#t~ite15_86| |v_P3_#t~ite16_78|) .cse17)))) .cse23 (= |v_P3Thread1of1ForFork1_#t~mem10_54| |v_P3_#t~mem10_59|)) (and .cse13 .cse15 .cse16 .cse17 (= v_~__unbuffered_p3_EAX~0_155 |v_P3_#t~mem10_59|) .cse18 (= .cse8 |v_P3_#t~mem10_59|) .cse19 .cse24 (= |v_P3_#t~ite17_70| |v_P3Thread1of1ForFork1_#t~ite17_53|)))) (= v_~z$w_buff1~0_238 v_~z$w_buff1~0_237) (= v_~__unbuffered_p3_EAX$read_delayed~0_97 1) (= (ite (= (ite .cse0 .cse25 (ite .cse24 .cse25 (ite (and .cse14 .cse23) 0 (ite (and .cse5 .cse12 .cse7 .cse23) (ite (or .cse10 .cse21) 1 0) .cse26)))) 0) 0 1) v_~z$w_buff0_used~0_475) (= |v_~#z~0.offset_236| v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_98) (= v_P3Thread1of1ForFork1_~arg.offset_29 |v_P3Thread1of1ForFork1_#in~arg.offset_29|))))) InVars {~#z~0.base=|v_~#z~0.base_236|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_258, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_476, ~z$w_buff0~0=v_~z$w_buff0~0_268, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_422, ~z$w_buff1~0=v_~z$w_buff1~0_238, P3Thread1of1ForFork1_#t~mem20=|v_P3Thread1of1ForFork1_#t~mem20_54|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_29|, ~#z~0.offset=|v_~#z~0.offset_236|, P3Thread1of1ForFork1_#t~mem13=|v_P3Thread1of1ForFork1_#t~mem13_54|, P3Thread1of1ForFork1_#t~nondet6=|v_P3Thread1of1ForFork1_#t~nondet6_54|, P3Thread1of1ForFork1_#t~mem11=|v_P3Thread1of1ForFork1_#t~mem11_54|, P3Thread1of1ForFork1_#t~nondet7=|v_P3Thread1of1ForFork1_#t~nondet7_54|, P3Thread1of1ForFork1_#t~mem10=|v_P3Thread1of1ForFork1_#t~mem10_54|, P3Thread1of1ForFork1_#t~nondet9=|v_P3Thread1of1ForFork1_#t~nondet9_54|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_29|, P3Thread1of1ForFork1_#t~ite16=|v_P3Thread1of1ForFork1_#t~ite16_54|, P3Thread1of1ForFork1_#t~ite17=|v_P3Thread1of1ForFork1_#t~ite17_53|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_266, #memory_int=|v_#memory_int_489|, P3Thread1of1ForFork1_#t~ite14=|v_P3Thread1of1ForFork1_#t~ite14_54|, P3Thread1of1ForFork1_#t~ite15=|v_P3Thread1of1ForFork1_#t~ite15_54|, P3Thread1of1ForFork1_#t~ite12=|v_P3Thread1of1ForFork1_#t~ite12_54|} OutVars{~#z~0.base=|v_~#z~0.base_236|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_257, ~z$w_buff1~0=v_~z$w_buff1~0_237, P3Thread1of1ForFork1_#t~mem8=|v_P3Thread1of1ForFork1_#t~mem8_29|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_29, ~a~0=v_~a~0_47, ~weak$$choice1~0=v_~weak$$choice1~0_132, P3Thread1of1ForFork1_#t~ite18=|v_P3Thread1of1ForFork1_#t~ite18_29|, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_97, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_29|, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_155, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_265, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_29, ~z$mem_tmp~0=v_~z$mem_tmp~0_66, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_475, ~z$w_buff0~0=v_~z$w_buff0~0_267, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_421, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_29|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_29|, ~#z~0.offset=|v_~#z~0.offset_236|, ~weak$$choice0~0=v_~weak$$choice0~0_105, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_98, #memory_int=|v_#memory_int_488|, ~weak$$choice2~0=v_~weak$$choice2~0_80, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_29|} AuxVars[|v_P3_#t~ite17_70|, |v_P3_#t~mem20_69|, |v_P3_#t~ite14_94|, |v_P3_#t~mem11_89|, |v_P3_#t~ite21_66|, |v_P3_#t~mem13_95|, |v_P3_#t~ite16_78|, |v_P3_#t~ite15_86|, |v_P3_#t~ite12_88|, |v_P3_#t~mem10_59|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1_#t~mem8, P3Thread1of1ForFork1_~arg.base, ~a~0, ~weak$$choice1~0, P3Thread1of1ForFork1_#t~ite18, ~__unbuffered_p3_EAX$read_delayed~0, P3Thread1of1ForFork1_#t~ite16, ~__unbuffered_p3_EAX$read_delayed_var~0.offset, P3Thread1of1ForFork1_#t~ite17, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite14, P3Thread1of1ForFork1_#t~ite15, P3Thread1of1ForFork1_#t~ite12, P3Thread1of1ForFork1_~arg.offset, ~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1_#t~mem19, ~z$flush_delayed~0, P3Thread1of1ForFork1_#t~mem20, P3Thread1of1ForFork1_#t~mem13, ~weak$$choice0~0, P3Thread1of1ForFork1_#t~nondet6, P3Thread1of1ForFork1_#t~mem11, P3Thread1of1ForFork1_#t~nondet7, P3Thread1of1ForFork1_#t~mem10, ~__unbuffered_p3_EAX$read_delayed_var~0.base, P3Thread1of1ForFork1_#t~nondet9, #memory_int, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~ite21] and [831] $Ultimate##0-->L802: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_25 |v_P0Thread1of1ForFork0_#in~arg.offset_25|) (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~y~0_47 v_~__unbuffered_p2_EAX~0_79) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_21| |v_P2Thread1of1ForFork3_~arg#1.offset_21|) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_21| |v_P2Thread1of1ForFork3_~arg#1.base_21|) (= v_P0Thread1of1ForFork0_~arg.base_25 |v_P0Thread1of1ForFork0_#in~arg.base_25|) (= v_~a~0_45 v_~__unbuffered_p0_EAX~0_78) (= v_~y~0_47 1) (= v_~x~0_44 v_~__unbuffered_p1_EAX~0_76) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19) (= v_~x~0_44 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~a~0=v_~a~0_45, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_21|, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_21|} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_21|, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_21|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_25, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, ~a~0=v_~a~0_45, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_78, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_47, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_21|, ~x~0=v_~x~0_44, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_25} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork3_~arg#1.offset, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork3_~arg#1.base, ~__unbuffered_p2_EAX~0, ~y~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] [2022-12-06 06:46:36,841 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:46:36,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2450 [2022-12-06 06:46:36,842 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 72 flow [2022-12-06 06:46:36,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:46:36,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:36,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:36,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:46:36,842 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1634761698, now seen corresponding path program 1 times [2022-12-06 06:46:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:36,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736645820] [2022-12-06 06:46:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:38,066 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:46:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:38,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736645820] [2022-12-06 06:46:38,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736645820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:38,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:38,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:46:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975160578] [2022-12-06 06:46:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:38,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:46:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:38,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:46:38,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:46:38,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:46:38,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 19 transitions, 72 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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:46:38,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:38,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:46:38,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:38,226 INFO L130 PetriNetUnfolder]: 395/589 cut-off events. [2022-12-06 06:46:38,226 INFO L131 PetriNetUnfolder]: For 510/510 co-relation queries the response was YES. [2022-12-06 06:46:38,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 589 events. 395/589 cut-off events. For 510/510 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2002 event pairs, 83 based on Foata normal form. 8/597 useless extension candidates. Maximal degree in co-relation 1364. Up to 525 conditions per place. [2022-12-06 06:46:38,229 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 27 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2022-12-06 06:46:38,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 166 flow [2022-12-06 06:46:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:46:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:46:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-06 06:46:38,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-06 06:46:38,230 INFO L175 Difference]: Start difference. First operand has 37 places, 19 transitions, 72 flow. Second operand 5 states and 35 transitions. [2022-12-06 06:46:38,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 166 flow [2022-12-06 06:46:38,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 144 flow, removed 4 selfloop flow, removed 8 redundant places. [2022-12-06 06:46:38,231 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 86 flow [2022-12-06 06:46:38,232 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=50, 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=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-12-06 06:46:38,232 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2022-12-06 06:46:38,232 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:38,232 INFO L89 Accepts]: Start accepts. Operand has 35 places, 23 transitions, 86 flow [2022-12-06 06:46:38,233 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:38,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:38,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 86 flow [2022-12-06 06:46:38,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 86 flow [2022-12-06 06:46:38,238 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2022-12-06 06:46:38,239 INFO L131 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2022-12-06 06:46:38,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 30 events. 4/30 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 62. Up to 9 conditions per place. [2022-12-06 06:46:38,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 86 flow [2022-12-06 06:46:38,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 06:46:38,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] $Ultimate##0-->L802: Formula: (let ((.cse10 (mod v_~weak$$choice0~0_107 256)) (.cse1 (mod v_~z$w_buff0_used~0_480 256)) (.cse6 (= (mod v_~z$r_buff0_thd4~0_270 256) 0)) (.cse13 (= (mod v_~z$w_buff0_used~0_479 256) 0))) (let ((.cse26 (= (mod v_~z$w_buff1_used~0_426 256) 0)) (.cse15 (not .cse13)) (.cse3 (not .cse6)) (.cse12 (= (mod v_~weak$$choice2~0_82 256) 0)) (.cse2 (= .cse1 0)) (.cse25 (= .cse10 0)) (.cse11 (select |v_#memory_int_493| |v_~#z~0.base_238|))) (let ((.cse16 (not (= (mod v_~z$w_buff1_used~0_425 256) 0))) (.cse8 (= (mod v_~weak$$choice1~0_134 256) 0)) (.cse18 (select .cse11 |v_~#z~0.offset_238|)) (.cse9 (not .cse25)) (.cse4 (not .cse2)) (.cse0 (not .cse12)) (.cse14 (and .cse15 .cse3)) (.cse5 (not .cse26)) (.cse7 (= (mod v_~z$r_buff1_thd4~0_262 256) 0))) (and (= v_~z$w_buff0_used~0_479 (ite (= (ite .cse0 .cse1 (ite .cse2 .cse1 (ite (and .cse3 .cse4) 0 (ite (and .cse5 .cse6 .cse4 .cse7) (ite (or .cse8 .cse9) 1 0) .cse10)))) 0) 0 1)) (= v_~a~0_49 v_~__unbuffered_p0_EAX~0_80) (= v_~weak$$choice0~0_107 |v_P3Thread1of1ForFork1_#t~nondet6_58|) (= v_~a~0_49 1) (= (store |v_#memory_int_493| |v_~#z~0.base_238| (store .cse11 |v_~#z~0.offset_238| |v_P3_#t~ite21_68|)) |v_#memory_int_492|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_21| v_P1Thread1of1ForFork2_~arg.offset_21) (= v_P0Thread1of1ForFork0_~arg.base_27 |v_P0Thread1of1ForFork0_#in~arg.base_27|) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_23| |v_P2Thread1of1ForFork3_~arg#1.offset_23|) (or (and .cse0 (= |v_P3_#t~ite21_68| v_~z$mem_tmp~0_68) (= |v_P3Thread1of1ForFork1_#t~mem20_58| |v_P3_#t~mem20_71|)) (and (= v_~__unbuffered_p3_EAX~0_157 |v_P3_#t~mem20_71|) .cse12 (= |v_P3_#t~ite21_68| |v_P3_#t~mem20_71|))) (= |v_~#z~0.base_238| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_100) (= v_P3Thread1of1ForFork1_~arg.base_31 |v_P3Thread1of1ForFork1_#in~arg.base_31|) (= v_~__unbuffered_p3_EAX$read_delayed~0_99 1) (= v_~z$w_buff0~0_272 v_~z$w_buff0~0_271) (= v_~z$r_buff0_thd4~0_269 (ite .cse0 v_~z$r_buff0_thd4~0_270 (ite .cse13 v_~z$r_buff0_thd4~0_270 (ite .cse14 0 (ite (and .cse15 .cse16 .cse6 .cse7) v_~z$r_buff0_thd4~0_270 0))))) (= v_~z$r_buff1_thd4~0_261 (ite .cse0 v_~z$r_buff1_thd4~0_262 (ite .cse13 v_~z$r_buff1_thd4~0_262 (let ((.cse17 (= (mod v_~z$r_buff0_thd4~0_269 256) 0))) (ite (and .cse15 (not .cse17)) 0 (ite (and .cse15 .cse16 .cse17 .cse7) (ite .cse9 v_~z$r_buff1_thd4~0_262 0) 0)))))) (= |v_P1Thread1of1ForFork2_#in~arg.base_21| v_P1Thread1of1ForFork2_~arg.base_21) (= v_P3Thread1of1ForFork1_~arg.offset_31 |v_P3Thread1of1ForFork1_#in~arg.offset_31|) (= v_~weak$$choice2~0_82 |v_P3Thread1of1ForFork1_#t~nondet7_58|) (= v_~z$flush_delayed~0_84 0) (= v_~y~0_49 1) (= v_~x~0_46 v_~__unbuffered_p1_EAX~0_78) (= v_~z$w_buff1~0_242 v_~z$w_buff1~0_241) (= .cse18 v_~z$mem_tmp~0_68) (= v_P0Thread1of1ForFork0_~arg.offset_27 |v_P0Thread1of1ForFork0_#in~arg.offset_27|) (= v_~weak$$choice1~0_134 |v_P3Thread1of1ForFork1_#t~nondet9_58|) (= v_~x~0_46 1) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_23| |v_P2Thread1of1ForFork3_~arg#1.base_23|) (let ((.cse19 (= |v_P3_#t~ite12_90| |v_P3Thread1of1ForFork1_#t~ite12_58|)) (.cse20 (= |v_P3_#t~ite16_80| |v_P3Thread1of1ForFork1_#t~ite16_58|)) (.cse21 (= |v_P3Thread1of1ForFork1_#t~mem11_58| |v_P3_#t~mem11_91|)) (.cse22 (= |v_P3Thread1of1ForFork1_#t~mem13_58| |v_P3_#t~mem13_97|)) (.cse23 (= |v_P3_#t~ite14_96| |v_P3Thread1of1ForFork1_#t~ite14_58|)) (.cse24 (= |v_P3_#t~ite15_88| |v_P3Thread1of1ForFork1_#t~ite15_58|))) (or (and (= |v_P3_#t~ite17_72| |v_P3Thread1of1ForFork1_#t~ite17_57|) (= v_~__unbuffered_p3_EAX~0_157 |v_P3_#t~mem10_61|) .cse19 .cse20 (= .cse18 |v_P3_#t~mem10_61|) .cse21 .cse22 .cse23 .cse24 .cse2) (and (or (and (= |v_P3_#t~ite17_72| |v_P3_#t~ite16_80|) (or (and .cse5 (or (and (= .cse18 |v_P3_#t~mem11_91|) (= |v_P3_#t~ite12_90| |v_P3_#t~mem11_91|) .cse9) (and .cse25 .cse21 (= |v_P3_#t~ite12_90| (ite (not .cse8) v_~z$w_buff0~0_272 v_~z$w_buff1~0_242)))) .cse7 .cse22 (= |v_P3_#t~ite12_90| |v_P3_#t~ite16_80|) .cse23 .cse24) (and (= |v_P3_#t~ite15_88| |v_P3_#t~ite16_80|) .cse19 (or (and (or (and .cse22 (= |v_P3_#t~ite14_96| v_~z$w_buff0~0_272) .cse9) (and (= |v_P3_#t~ite14_96| |v_P3_#t~mem13_97|) .cse25 (= .cse18 |v_P3_#t~mem13_97|))) .cse26 (= |v_P3_#t~ite14_96| |v_P3_#t~ite15_88|)) (and .cse5 (= |v_P3_#t~ite15_88| (ite .cse9 v_~z$w_buff1~0_242 v_~z$w_buff0~0_272)) .cse22 .cse23)) (or (not .cse7) .cse26) .cse21)) .cse6) (and .cse3 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= |v_P3_#t~ite17_72| v_~z$w_buff0~0_272))) (= |v_P3Thread1of1ForFork1_#t~mem10_58| |v_P3_#t~mem10_61|) (= |v_P3_#t~ite17_72| v_~__unbuffered_p3_EAX~0_157) .cse4))) (= v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_100 |v_~#z~0.offset_238|) (= v_~z$w_buff1_used~0_425 (ite .cse0 v_~z$w_buff1_used~0_426 (ite .cse13 v_~z$w_buff1_used~0_426 (ite .cse14 0 (ite (and .cse5 .cse15 .cse6 .cse7) v_~weak$$choice0~0_107 0))))) (= v_~y~0_49 v_~__unbuffered_p2_EAX~0_81))))) InVars {~#z~0.base=|v_~#z~0.base_238|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_262, ~z$w_buff1~0=v_~z$w_buff1~0_242, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_27|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_31|, P3Thread1of1ForFork1_#t~ite16=|v_P3Thread1of1ForFork1_#t~ite16_58|, P3Thread1of1ForFork1_#t~ite17=|v_P3Thread1of1ForFork1_#t~ite17_57|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_270, P3Thread1of1ForFork1_#t~ite14=|v_P3Thread1of1ForFork1_#t~ite14_58|, P3Thread1of1ForFork1_#t~ite15=|v_P3Thread1of1ForFork1_#t~ite15_58|, P3Thread1of1ForFork1_#t~ite12=|v_P3Thread1of1ForFork1_#t~ite12_58|, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_480, ~z$w_buff0~0=v_~z$w_buff0~0_272, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_27|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_426, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_23|, P3Thread1of1ForFork1_#t~mem20=|v_P3Thread1of1ForFork1_#t~mem20_58|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_31|, ~#z~0.offset=|v_~#z~0.offset_238|, P3Thread1of1ForFork1_#t~mem13=|v_P3Thread1of1ForFork1_#t~mem13_58|, P3Thread1of1ForFork1_#t~nondet6=|v_P3Thread1of1ForFork1_#t~nondet6_58|, P3Thread1of1ForFork1_#t~mem11=|v_P3Thread1of1ForFork1_#t~mem11_58|, P3Thread1of1ForFork1_#t~nondet7=|v_P3Thread1of1ForFork1_#t~nondet7_58|, P3Thread1of1ForFork1_#t~mem10=|v_P3Thread1of1ForFork1_#t~mem10_58|, P3Thread1of1ForFork1_#t~nondet9=|v_P3Thread1of1ForFork1_#t~nondet9_58|, #memory_int=|v_#memory_int_493|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|} OutVars{~#z~0.base=|v_~#z~0.base_238|, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_23|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_27, ~a~0=v_~a~0_49, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~weak$$choice1~0=v_~weak$$choice1~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_99, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_157, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_269, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_23|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_27, ~z$mem_tmp~0=v_~z$mem_tmp~0_68, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_425, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_31|, ~z$flush_delayed~0=v_~z$flush_delayed~0_84, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_31|, ~weak$$choice0~0=v_~weak$$choice0~0_107, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_261, ~z$w_buff1~0=v_~z$w_buff1~0_241, P3Thread1of1ForFork1_#t~mem8=|v_P3Thread1of1ForFork1_#t~mem8_31|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_31, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_27|, P3Thread1of1ForFork1_#t~ite18=|v_P3Thread1of1ForFork1_#t~ite18_31|, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_100, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_31, ~y~0=v_~y~0_49, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_479, ~z$w_buff0~0=v_~z$w_buff0~0_271, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_23|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_27|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_23|, ~#z~0.offset=|v_~#z~0.offset_238|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_21, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_100, #memory_int=|v_#memory_int_492|, ~weak$$choice2~0=v_~weak$$choice2~0_82, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_31|} AuxVars[|v_P3_#t~ite16_80|, |v_P3_#t~ite12_90|, |v_P3_#t~ite21_68|, |v_P3_#t~mem10_61|, |v_P3_#t~ite17_72|, |v_P3_#t~mem13_97|, |v_P3_#t~mem20_71|, |v_P3_#t~ite15_88|, |v_P3_#t~mem11_91|, |v_P3_#t~ite14_96|] AssignedVars[P2Thread1of1ForFork3_~arg#1.offset, ~z$r_buff1_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork1_~arg.base, ~a~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P3Thread1of1ForFork1_#t~ite18, ~__unbuffered_p3_EAX$read_delayed~0, P3Thread1of1ForFork1_#t~ite16, ~__unbuffered_p3_EAX$read_delayed_var~0.offset, P3Thread1of1ForFork1_#t~ite17, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite14, P3Thread1of1ForFork1_#t~ite15, ~__unbuffered_p2_EAX~0, P3Thread1of1ForFork1_#t~ite12, P3Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork0_~arg.offset, ~z$mem_tmp~0, P1Thread1of1ForFork2_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork1_#t~mem19, ~z$flush_delayed~0, P3Thread1of1ForFork1_#t~mem20, P3Thread1of1ForFork1_#t~mem13, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, P3Thread1of1ForFork1_#t~nondet6, P3Thread1of1ForFork1_#t~mem11, P3Thread1of1ForFork1_#t~nondet7, P3Thread1of1ForFork1_#t~mem10, ~__unbuffered_p3_EAX$read_delayed_var~0.base, P3Thread1of1ForFork1_#t~nondet9, #memory_int, ~weak$$choice2~0, ~x~0, P3Thread1of1ForFork1_#t~ite21] and [684] L851-->L858: Formula: (let ((.cse4 (= (mod v_~z$r_buff0_thd4~0_104 256) 0))) (let ((.cse5 (= (mod v_~z$w_buff0_used~0_194 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_173 256) 0)) (.cse8 (= 0 (mod v_~z$r_buff1_thd4~0_92 256))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_193 256) 0))) (.cse11 (not .cse4))) (let ((.cse2 (and .cse1 .cse11)) (.cse0 (not .cse8)) (.cse3 (not .cse7)) (.cse10 (not .cse5)) (.cse6 (select |v_#memory_int_169| |v_~#z~0.base_114|))) (and (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_172 256) 0)) .cse0) (and (not (= (mod v_~z$r_buff0_thd4~0_103 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_92) v_~z$r_buff1_thd4~0_91) (= v_~z$r_buff0_thd4~0_103 (ite .cse2 0 v_~z$r_buff0_thd4~0_104)) (= (ite (or (and .cse0 .cse3) .cse2) 0 v_~z$w_buff1_used~0_173) v_~z$w_buff1_used~0_172) (let ((.cse9 (= |v_P3_#t~mem22_36| |v_P3Thread1of1ForFork1_#t~mem22_1|))) (or (and (or .cse4 .cse5) (or (and (= (select .cse6 |v_~#z~0.offset_114|) |v_P3_#t~mem22_36|) (or .cse7 .cse8) (= |v_P3_#t~ite23_33| |v_P3_#t~mem22_36|)) (and (= |v_P3_#t~ite23_33| v_~z$w_buff1~0_72) .cse0 .cse3 .cse9)) (= |v_P3_#t~ite23_33| |v_P3_#t~ite24_23|)) (and .cse10 (= |v_P3_#t~ite23_33| |v_P3Thread1of1ForFork1_#t~ite23_1|) (= |v_P3_#t~ite24_23| v_~z$w_buff0~0_81) .cse9 .cse11))) (= v_~z$w_buff0_used~0_193 (ite (and .cse10 .cse11) 0 v_~z$w_buff0_used~0_194)) (= |v_#memory_int_168| (store |v_#memory_int_169| |v_~#z~0.base_114| (store .cse6 |v_~#z~0.offset_114| |v_P3_#t~ite24_23|))))))) InVars {~#z~0.base=|v_~#z~0.base_114|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_92, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_194, ~z$w_buff0~0=v_~z$w_buff0~0_81, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_173, #memory_int=|v_#memory_int_169|, ~z$w_buff1~0=v_~z$w_buff1~0_72, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_1|, ~#z~0.offset=|v_~#z~0.offset_114|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_1|} OutVars{~#z~0.base=|v_~#z~0.base_114|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_193, ~z$w_buff0~0=v_~z$w_buff0~0_81, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_103, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_172, #memory_int=|v_#memory_int_168|, ~z$w_buff1~0=v_~z$w_buff1~0_72, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_1|, ~#z~0.offset=|v_~#z~0.offset_114|} AuxVars[|v_P3_#t~ite23_33|, |v_P3_#t~ite24_23|, |v_P3_#t~mem22_36|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, #memory_int, P3Thread1of1ForFork1_#t~ite24, P3Thread1of1ForFork1_#t~ite23, P3Thread1of1ForFork1_#t~mem22] [2022-12-06 06:46:41,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [676] L802-->L815: Formula: (and (= v_~z$r_buff0_thd3~0_55 1) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_3| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_3|) (= v_~z$r_buff0_thd3~0_56 v_~z$r_buff1_thd3~0_46) (= v_~z$r_buff0_thd0~0_42 v_~z$r_buff1_thd0~0_40) (= v_~z$w_buff0~0_106 v_~z$w_buff1~0_98) (= v_~z$w_buff0_used~0_223 1) (= v_~z$r_buff0_thd4~0_127 v_~z$r_buff1_thd4~0_117) (= v_~z$w_buff0~0_105 1) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_17) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_3| 0)) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_202 256) 0)) (not (= 0 (mod v_~z$w_buff0_used~0_223 256))))) 1 0)) (= v_~z$r_buff0_thd1~0_15 v_~z$r_buff1_thd1~0_17) (= v_~z$w_buff0_used~0_224 v_~z$w_buff1_used~0_202)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_42, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_224, ~z$w_buff0~0=v_~z$w_buff0~0_106, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_127, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_117, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_223, ~z$w_buff0~0=v_~z$w_buff0~0_105, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_46, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_202, ~z$w_buff1~0=v_~z$w_buff1~0_98, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_42, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_40, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_127, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_55, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_3|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] and [684] L851-->L858: Formula: (let ((.cse4 (= (mod v_~z$r_buff0_thd4~0_104 256) 0))) (let ((.cse5 (= (mod v_~z$w_buff0_used~0_194 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_173 256) 0)) (.cse8 (= 0 (mod v_~z$r_buff1_thd4~0_92 256))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_193 256) 0))) (.cse11 (not .cse4))) (let ((.cse2 (and .cse1 .cse11)) (.cse0 (not .cse8)) (.cse3 (not .cse7)) (.cse10 (not .cse5)) (.cse6 (select |v_#memory_int_169| |v_~#z~0.base_114|))) (and (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_172 256) 0)) .cse0) (and (not (= (mod v_~z$r_buff0_thd4~0_103 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_92) v_~z$r_buff1_thd4~0_91) (= v_~z$r_buff0_thd4~0_103 (ite .cse2 0 v_~z$r_buff0_thd4~0_104)) (= (ite (or (and .cse0 .cse3) .cse2) 0 v_~z$w_buff1_used~0_173) v_~z$w_buff1_used~0_172) (let ((.cse9 (= |v_P3_#t~mem22_36| |v_P3Thread1of1ForFork1_#t~mem22_1|))) (or (and (or .cse4 .cse5) (or (and (= (select .cse6 |v_~#z~0.offset_114|) |v_P3_#t~mem22_36|) (or .cse7 .cse8) (= |v_P3_#t~ite23_33| |v_P3_#t~mem22_36|)) (and (= |v_P3_#t~ite23_33| v_~z$w_buff1~0_72) .cse0 .cse3 .cse9)) (= |v_P3_#t~ite23_33| |v_P3_#t~ite24_23|)) (and .cse10 (= |v_P3_#t~ite23_33| |v_P3Thread1of1ForFork1_#t~ite23_1|) (= |v_P3_#t~ite24_23| v_~z$w_buff0~0_81) .cse9 .cse11))) (= v_~z$w_buff0_used~0_193 (ite (and .cse10 .cse11) 0 v_~z$w_buff0_used~0_194)) (= |v_#memory_int_168| (store |v_#memory_int_169| |v_~#z~0.base_114| (store .cse6 |v_~#z~0.offset_114| |v_P3_#t~ite24_23|))))))) InVars {~#z~0.base=|v_~#z~0.base_114|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_92, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_194, ~z$w_buff0~0=v_~z$w_buff0~0_81, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_173, #memory_int=|v_#memory_int_169|, ~z$w_buff1~0=v_~z$w_buff1~0_72, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_1|, ~#z~0.offset=|v_~#z~0.offset_114|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_1|} OutVars{~#z~0.base=|v_~#z~0.base_114|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_193, ~z$w_buff0~0=v_~z$w_buff0~0_81, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_103, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_172, #memory_int=|v_#memory_int_168|, ~z$w_buff1~0=v_~z$w_buff1~0_72, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_1|, ~#z~0.offset=|v_~#z~0.offset_114|} AuxVars[|v_P3_#t~ite23_33|, |v_P3_#t~ite24_23|, |v_P3_#t~mem22_36|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, #memory_int, P3Thread1of1ForFork1_#t~ite24, P3Thread1of1ForFork1_#t~ite23, P3Thread1of1ForFork1_#t~mem22] [2022-12-06 06:46:46,991 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:46:46,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8760 [2022-12-06 06:46:46,992 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 99 flow [2022-12-06 06:46:46,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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:46:46,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:46,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:46,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:46:46,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:46,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1632714799, now seen corresponding path program 1 times [2022-12-06 06:46:46,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:46,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152868698] [2022-12-06 06:46:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:46,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:48,143 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:46:48,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:48,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152868698] [2022-12-06 06:46:48,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152868698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:48,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:48,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:46:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535314832] [2022-12-06 06:46:48,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:48,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:46:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:48,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:46:48,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:46:48,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:46:48,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 99 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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:46:48,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:48,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:46:48,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:48,302 INFO L130 PetriNetUnfolder]: 380/578 cut-off events. [2022-12-06 06:46:48,303 INFO L131 PetriNetUnfolder]: For 340/340 co-relation queries the response was YES. [2022-12-06 06:46:48,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 578 events. 380/578 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2191 event pairs, 184 based on Foata normal form. 16/588 useless extension candidates. Maximal degree in co-relation 1439. Up to 423 conditions per place. [2022-12-06 06:46:48,306 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 27 selfloop transitions, 7 changer transitions 1/35 dead transitions. [2022-12-06 06:46:48,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 197 flow [2022-12-06 06:46:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:46:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:46:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 06:46:48,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2022-12-06 06:46:48,309 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 99 flow. Second operand 5 states and 37 transitions. [2022-12-06 06:46:48,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 197 flow [2022-12-06 06:46:48,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 182 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 06:46:48,315 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 109 flow [2022-12-06 06:46:48,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2022-12-06 06:46:48,315 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 06:46:48,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:48,315 INFO L89 Accepts]: Start accepts. Operand has 39 places, 23 transitions, 109 flow [2022-12-06 06:46:48,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:48,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:48,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 23 transitions, 109 flow [2022-12-06 06:46:48,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 109 flow [2022-12-06 06:46:48,323 INFO L130 PetriNetUnfolder]: 6/38 cut-off events. [2022-12-06 06:46:48,324 INFO L131 PetriNetUnfolder]: For 35/36 co-relation queries the response was YES. [2022-12-06 06:46:48,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 38 events. 6/38 cut-off events. For 35/36 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 103 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 102. Up to 13 conditions per place. [2022-12-06 06:46:48,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 109 flow [2022-12-06 06:46:48,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 06:46:48,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [676] L802-->L815: Formula: (and (= v_~z$r_buff0_thd3~0_55 1) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_3| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_3|) (= v_~z$r_buff0_thd3~0_56 v_~z$r_buff1_thd3~0_46) (= v_~z$r_buff0_thd0~0_42 v_~z$r_buff1_thd0~0_40) (= v_~z$w_buff0~0_106 v_~z$w_buff1~0_98) (= v_~z$w_buff0_used~0_223 1) (= v_~z$r_buff0_thd4~0_127 v_~z$r_buff1_thd4~0_117) (= v_~z$w_buff0~0_105 1) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_17) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_3| 0)) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_202 256) 0)) (not (= 0 (mod v_~z$w_buff0_used~0_223 256))))) 1 0)) (= v_~z$r_buff0_thd1~0_15 v_~z$r_buff1_thd1~0_17) (= v_~z$w_buff0_used~0_224 v_~z$w_buff1_used~0_202)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_42, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_224, ~z$w_buff0~0=v_~z$w_buff0~0_106, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_127, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_117, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_223, ~z$w_buff0~0=v_~z$w_buff0~0_105, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_46, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_202, ~z$w_buff1~0=v_~z$w_buff1~0_98, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_42, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_40, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_127, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_55, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_3|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] and [647] L887-->L893: Formula: (let ((.cse3 (= (mod v_~z$r_buff0_thd0~0_35 256) 0))) (let ((.cse10 (not .cse3)) (.cse1 (not (= (mod v_~z$w_buff0_used~0_199 256) 0))) (.cse9 (= (mod v_~z$w_buff1_used~0_181 256) 0)) (.cse8 (= (mod v_~z$r_buff1_thd0~0_31 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_200 256) 0))) (let ((.cse7 (select |v_#memory_int_177| |v_~#z~0.base_120|)) (.cse11 (not .cse4)) (.cse0 (not .cse8)) (.cse6 (not .cse9)) (.cse2 (and .cse10 .cse1))) (and (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_180 256) 0)) .cse0) (and (not (= (mod v_~z$r_buff0_thd0~0_34 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_31) v_~z$r_buff1_thd0~0_30) (= (ite .cse2 0 v_~z$r_buff0_thd0~0_35) v_~z$r_buff0_thd0~0_34) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~mem33#1_33| |v_ULTIMATE.start_main_#t~mem33#1_29|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite34#1_28| |v_ULTIMATE.start_main_#t~ite35#1_32|) (or (and (= |v_ULTIMATE.start_main_#t~ite34#1_28| v_~z$w_buff1~0_78) .cse0 .cse5 .cse6) (and (= |v_ULTIMATE.start_main_#t~ite34#1_28| |v_ULTIMATE.start_main_#t~mem33#1_33|) (= (select .cse7 |v_~#z~0.offset_120|) |v_ULTIMATE.start_main_#t~mem33#1_33|) (or .cse8 .cse9)))) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite35#1_32| v_~z$w_buff0~0_83) .cse5 .cse11 (= |v_ULTIMATE.start_main_#t~ite34#1_28| |v_ULTIMATE.start_main_#t~ite34#1_24|)))) (= (store |v_#memory_int_177| |v_~#z~0.base_120| (store .cse7 |v_~#z~0.offset_120| |v_ULTIMATE.start_main_#t~ite35#1_32|)) |v_#memory_int_176|) (= v_~z$w_buff0_used~0_199 (ite (and .cse10 .cse11) 0 v_~z$w_buff0_used~0_200)) (= v_~z$w_buff1_used~0_180 (ite (or (and .cse0 .cse6) .cse2) 0 v_~z$w_buff1_used~0_181)))))) InVars {~#z~0.base=|v_~#z~0.base_120|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_35, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_29|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_200, ~z$w_buff0~0=v_~z$w_buff0~0_83, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_31, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_181, #memory_int=|v_#memory_int_177|, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~#z~0.offset=|v_~#z~0.offset_120|} OutVars{~#z~0.base=|v_~#z~0.base_120|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_28|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_34, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_199, ~z$w_buff0~0=v_~z$w_buff0~0_83, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_30, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_180, #memory_int=|v_#memory_int_176|, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~#z~0.offset=|v_~#z~0.offset_120|} AuxVars[|v_ULTIMATE.start_main_#t~mem33#1_33|, |v_ULTIMATE.start_main_#t~ite34#1_28|, |v_ULTIMATE.start_main_#t~ite35#1_32|] AssignedVars[ULTIMATE.start_main_#t~ite35#1, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, #memory_int] [2022-12-06 06:46:49,110 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:46:49,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 796 [2022-12-06 06:46:49,111 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 111 flow [2022-12-06 06:46:49,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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:46:49,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:49,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:49,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:46:49,111 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1632714892, now seen corresponding path program 1 times [2022-12-06 06:46:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:49,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458140056] [2022-12-06 06:46:49,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:49,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:49,250 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:46:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:49,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458140056] [2022-12-06 06:46:49,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458140056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:49,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:49,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:46:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567286709] [2022-12-06 06:46:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:49,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:46:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:49,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:46:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:46:49,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:46:49,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:46:49,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:49,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:46:49,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:49,329 INFO L130 PetriNetUnfolder]: 274/423 cut-off events. [2022-12-06 06:46:49,329 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-06 06:46:49,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 423 events. 274/423 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1404 event pairs, 100 based on Foata normal form. 5/427 useless extension candidates. Maximal degree in co-relation 1277. Up to 410 conditions per place. [2022-12-06 06:46:49,332 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 24 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2022-12-06 06:46:49,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 198 flow [2022-12-06 06:46:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:46:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:46:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 06:46:49,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 06:46:49,333 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 111 flow. Second operand 3 states and 30 transitions. [2022-12-06 06:46:49,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 198 flow [2022-12-06 06:46:49,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 152 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-06 06:46:49,335 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 108 flow [2022-12-06 06:46:49,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 06:46:49,336 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -10 predicate places. [2022-12-06 06:46:49,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:49,336 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 108 flow [2022-12-06 06:46:49,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:49,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:49,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 108 flow [2022-12-06 06:46:49,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 108 flow [2022-12-06 06:46:49,357 INFO L130 PetriNetUnfolder]: 119/247 cut-off events. [2022-12-06 06:46:49,358 INFO L131 PetriNetUnfolder]: For 7/14 co-relation queries the response was YES. [2022-12-06 06:46:49,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 247 events. 119/247 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1129 event pairs, 54 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 547. Up to 148 conditions per place. [2022-12-06 06:46:49,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 108 flow [2022-12-06 06:46:49,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-06 06:46:49,360 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:46:49,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 06:46:49,361 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 108 flow [2022-12-06 06:46:49,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:46:49,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:49,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:49,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:46:49,361 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:49,361 INFO L85 PathProgramCache]: Analyzing trace with hash -859999160, now seen corresponding path program 1 times [2022-12-06 06:46:49,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:49,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612406829] [2022-12-06 06:46:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:50,369 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:46:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:50,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612406829] [2022-12-06 06:46:50,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612406829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:50,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:50,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:46:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102857765] [2022-12-06 06:46:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:50,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:46:50,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:50,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:46:50,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:46:50,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:46:50,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 108 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:50,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:50,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:46:50,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:50,546 INFO L130 PetriNetUnfolder]: 283/439 cut-off events. [2022-12-06 06:46:50,547 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-06 06:46:50,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 439 events. 283/439 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1495 event pairs, 121 based on Foata normal form. 7/445 useless extension candidates. Maximal degree in co-relation 1364. Up to 342 conditions per place. [2022-12-06 06:46:50,548 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 35 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2022-12-06 06:46:50,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 268 flow [2022-12-06 06:46:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:46:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:46:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-06 06:46:50,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091 [2022-12-06 06:46:50,549 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 108 flow. Second operand 5 states and 34 transitions. [2022-12-06 06:46:50,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 268 flow [2022-12-06 06:46:50,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:46:50,552 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 137 flow [2022-12-06 06:46:50,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-06 06:46:50,552 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -6 predicate places. [2022-12-06 06:46:50,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:50,552 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 137 flow [2022-12-06 06:46:50,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:50,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:50,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 137 flow [2022-12-06 06:46:50,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 137 flow [2022-12-06 06:46:50,567 INFO L130 PetriNetUnfolder]: 92/192 cut-off events. [2022-12-06 06:46:50,567 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 06:46:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 192 events. 92/192 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 797 event pairs, 42 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 448. Up to 145 conditions per place. [2022-12-06 06:46:50,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 137 flow [2022-12-06 06:46:50,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 06:46:50,569 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:46:50,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 06:46:50,570 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 137 flow [2022-12-06 06:46:50,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:50,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:50,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:50,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:46:50,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:50,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash -857234580, now seen corresponding path program 1 times [2022-12-06 06:46:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:50,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112130558] [2022-12-06 06:46:50,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:50,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:50,711 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:46:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112130558] [2022-12-06 06:46:50,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112130558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:50,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:50,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:46:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262702391] [2022-12-06 06:46:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:50,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:46:50,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:50,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:46:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:46:50,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:46:50,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:50,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:50,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:46:50,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:50,819 INFO L130 PetriNetUnfolder]: 166/283 cut-off events. [2022-12-06 06:46:50,820 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-06 06:46:50,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 283 events. 166/283 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 942 event pairs, 28 based on Foata normal form. 13/296 useless extension candidates. Maximal degree in co-relation 979. Up to 248 conditions per place. [2022-12-06 06:46:50,821 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 29 selfloop transitions, 9 changer transitions 0/38 dead transitions. [2022-12-06 06:46:50,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 261 flow [2022-12-06 06:46:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:46:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:46:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 06:46:50,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-06 06:46:50,823 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 137 flow. Second operand 4 states and 37 transitions. [2022-12-06 06:46:50,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 261 flow [2022-12-06 06:46:50,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 235 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 06:46:50,824 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 173 flow [2022-12-06 06:46:50,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-06 06:46:50,825 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2022-12-06 06:46:50,826 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:50,826 INFO L89 Accepts]: Start accepts. Operand has 38 places, 32 transitions, 173 flow [2022-12-06 06:46:50,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:50,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:50,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 173 flow [2022-12-06 06:46:50,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 173 flow [2022-12-06 06:46:50,845 INFO L130 PetriNetUnfolder]: 67/173 cut-off events. [2022-12-06 06:46:50,845 INFO L131 PetriNetUnfolder]: For 71/75 co-relation queries the response was YES. [2022-12-06 06:46:50,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 173 events. 67/173 cut-off events. For 71/75 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 768 event pairs, 9 based on Foata normal form. 1/173 useless extension candidates. Maximal degree in co-relation 549. Up to 98 conditions per place. [2022-12-06 06:46:50,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 173 flow [2022-12-06 06:46:50,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 06:46:50,847 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:46:50,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:46:50,848 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 173 flow [2022-12-06 06:46:50,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:46:50,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:50,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:50,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:46:50,848 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:50,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash -775040922, now seen corresponding path program 1 times [2022-12-06 06:46:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:50,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859699640] [2022-12-06 06:46:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:51,754 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:46:51,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:51,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859699640] [2022-12-06 06:46:51,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859699640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:51,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:51,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:46:51,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734511046] [2022-12-06 06:46:51,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:51,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:46:51,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:51,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:46:51,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:46:51,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:46:51,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 173 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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:46:51,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:51,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:46:51,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:51,841 INFO L130 PetriNetUnfolder]: 159/272 cut-off events. [2022-12-06 06:46:51,842 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2022-12-06 06:46:51,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 272 events. 159/272 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 898 event pairs, 46 based on Foata normal form. 4/276 useless extension candidates. Maximal degree in co-relation 1069. Up to 238 conditions per place. [2022-12-06 06:46:51,843 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 37 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2022-12-06 06:46:51,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 329 flow [2022-12-06 06:46:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:46:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:46:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 06:46:51,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2022-12-06 06:46:51,844 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 173 flow. Second operand 4 states and 29 transitions. [2022-12-06 06:46:51,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 329 flow [2022-12-06 06:46:51,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 297 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 06:46:51,845 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 176 flow [2022-12-06 06:46:51,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-06 06:46:51,845 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-12-06 06:46:51,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:51,845 INFO L89 Accepts]: Start accepts. Operand has 40 places, 33 transitions, 176 flow [2022-12-06 06:46:51,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:51,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:51,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 176 flow [2022-12-06 06:46:51,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 176 flow [2022-12-06 06:46:51,859 INFO L130 PetriNetUnfolder]: 60/147 cut-off events. [2022-12-06 06:46:51,859 INFO L131 PetriNetUnfolder]: For 78/80 co-relation queries the response was YES. [2022-12-06 06:46:51,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 147 events. 60/147 cut-off events. For 78/80 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 580 event pairs, 10 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 431. Up to 91 conditions per place. [2022-12-06 06:46:51,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 176 flow [2022-12-06 06:46:51,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 06:46:51,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [838] $Ultimate##0-->L858: Formula: (let ((.cse28 (mod v_~z$w_buff0_used~0_571 256))) (let ((.cse29 (mod v_~weak$$choice0~0_119 256)) (.cse26 (= .cse28 0)) (.cse19 (= (mod v_~z$w_buff1_used~0_503 256) 0)) (.cse22 (= (mod v_~z$r_buff0_thd4~0_327 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_94 256) 0))) (let ((.cse0 (not .cse1)) (.cse23 (not .cse22)) (.cse12 (not .cse19)) (.cse25 (not .cse26)) (.cse18 (= (mod v_~z$r_buff1_thd4~0_318 256) 0)) (.cse15 (= (mod v_~weak$$choice1~0_146 256) 0)) (.cse20 (not (= .cse29 0)))) (let ((.cse9 (ite (= (ite .cse0 .cse28 (ite .cse26 .cse28 (ite (and .cse23 .cse25) 0 (ite (and .cse12 .cse25 .cse22 .cse18) (ite (or .cse15 .cse20) 1 0) .cse29)))) 0) 0 1))) (let ((.cse7 (= (mod .cse9 256) 0))) (let ((.cse8 (not .cse7))) (let ((.cse3 (ite .cse0 v_~z$r_buff0_thd4~0_327 (ite .cse7 v_~z$r_buff0_thd4~0_327 (let ((.cse27 (and .cse23 .cse8))) (ite .cse27 0 (ite (and (not (= (mod (ite .cse0 v_~z$w_buff1_used~0_503 (ite .cse7 v_~z$w_buff1_used~0_503 (ite .cse27 0 (ite (and .cse12 .cse8 .cse22 .cse18) v_~weak$$choice0~0_119 0)))) 256) 0)) .cse8 .cse22 .cse18) v_~z$r_buff0_thd4~0_327 0))))))) (let ((.cse11 (= (mod .cse3 256) 0))) (let ((.cse4 (select |v_#memory_int_579| |v_~#z~0.base_276|)) (.cse5 (not .cse11)) (.cse6 (not (= (mod v_~z$w_buff0_used~0_569 256) 0)))) (let ((.cse2 (and .cse5 .cse6)) (.cse10 (select .cse4 |v_~#z~0.offset_276|))) (and (or (and (= |v_P3Thread1of1ForFork1_#t~mem20_82| |v_P3_#t~mem20_84|) .cse0 (= |v_P3_#t~ite21_81| v_~z$mem_tmp~0_80)) (and .cse1 (= v_~__unbuffered_p3_EAX~0_179 |v_P3_#t~mem20_84|) (= |v_P3_#t~ite21_81| |v_P3_#t~mem20_84|))) (= (ite .cse2 0 .cse3) v_~z$r_buff0_thd4~0_325) (= v_P0Thread1of1ForFork0_~arg.base_39 |v_P0Thread1of1ForFork0_#in~arg.base_39|) (= v_~a~0_61 1) (= v_~__unbuffered_p3_EAX$read_delayed~0_111 1) (= v_~z$r_buff0_thd3~0_222 v_~z$r_buff1_thd3~0_157) (= |v_~#z~0.base_276| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_122) (= v_~x~0_58 v_~__unbuffered_p1_EAX~0_90) (= (store |v_#memory_int_579| |v_~#z~0.base_276| (store .cse4 |v_~#z~0.offset_276| |v_P3_#t~ite24_66|)) |v_#memory_int_577|) (= v_~x~0_58 1) (= v_~z$r_buff0_thd0~0_223 v_~z$r_buff1_thd0~0_229) (= v_~y~0_61 1) (= v_~weak$$choice1~0_146 |v_P3Thread1of1ForFork1_#t~nondet9_82|) (= v_~z$w_buff0~0_329 1) (= v_~z$r_buff1_thd4~0_316 (ite (or (and .cse5 (not (= (mod v_~z$w_buff1_used~0_501 256) 0))) (and .cse6 (not (= (mod v_~z$r_buff0_thd4~0_325 256) 0)))) 0 .cse3)) (= (ite .cse7 1 0) |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_60|) (= (ite (or .cse2 (and .cse5 .cse8)) 0 .cse9) v_~z$w_buff1_used~0_501) (= v_P3Thread1of1ForFork1_~arg.offset_43 |v_P3Thread1of1ForFork1_#in~arg.offset_43|) (= v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_122 |v_~#z~0.offset_276|) (= v_P3Thread1of1ForFork1_~arg.base_43 |v_P3Thread1of1ForFork1_#in~arg.base_43|) (= v_~z$w_buff0_used~0_569 (ite .cse5 0 1)) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_60| 0)) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_35| |v_P2Thread1of1ForFork3_~arg#1.offset_35|) (= v_~y~0_61 v_~__unbuffered_p2_EAX~0_93) (= v_~z$mem_tmp~0_80 .cse10) (= v_~weak$$choice2~0_94 |v_P3Thread1of1ForFork1_#t~nondet7_82|) (= v_~z$flush_delayed~0_96 0) (= v_~weak$$choice0~0_119 |v_P3Thread1of1ForFork1_#t~nondet6_82|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_33| v_P1Thread1of1ForFork2_~arg.offset_33) (= v_~a~0_61 v_~__unbuffered_p0_EAX~0_92) (= v_~z$r_buff0_thd3~0_221 1) (= |v_P1Thread1of1ForFork2_#in~arg.base_33| v_P1Thread1of1ForFork2_~arg.base_33) (= v_~z$w_buff0~0_331 v_~z$w_buff1~0_291) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_35| |v_P2Thread1of1ForFork3_~arg#1.base_35|) (or (and .cse5 (= |v_P3Thread1of1ForFork1_#t~mem22_84| |v_P3_#t~mem22_79|) (= |v_P3_#t~ite23_76| |v_P3Thread1of1ForFork1_#t~ite23_84|) (= |v_P3_#t~ite24_66| v_~z$w_buff0~0_329)) (and .cse11 (= |v_P3_#t~ite23_76| |v_P3_#t~mem22_79|) (= |v_P3_#t~ite23_76| |v_P3_#t~ite24_66|) (= |v_P3_#t~ite21_81| |v_P3_#t~mem22_79|))) (= v_~z$r_buff0_thd1~0_82 v_~z$r_buff1_thd1~0_84) (= v_~z$r_buff0_thd2~0_84 v_~z$r_buff1_thd2~0_84) (let ((.cse13 (= |v_P3_#t~ite14_109| |v_P3Thread1of1ForFork1_#t~ite14_82|)) (.cse14 (= |v_P3_#t~ite15_101| |v_P3Thread1of1ForFork1_#t~ite15_82|)) (.cse24 (= |v_P3_#t~ite16_93| |v_P3Thread1of1ForFork1_#t~ite16_82|)) (.cse21 (= |v_P3_#t~ite12_103| |v_P3Thread1of1ForFork1_#t~ite12_82|)) (.cse16 (= |v_P3Thread1of1ForFork1_#t~mem11_82| |v_P3_#t~mem11_104|)) (.cse17 (= |v_P3Thread1of1ForFork1_#t~mem13_82| |v_P3_#t~mem13_110|))) (or (and (or (and (= |v_P3_#t~ite17_85| |v_P3_#t~ite16_93|) (or (and .cse12 .cse13 .cse14 (= |v_P3_#t~ite16_93| |v_P3_#t~ite12_103|) (= |v_P3_#t~ite12_103| (ite (not .cse15) v_~z$w_buff0~0_331 v_~z$w_buff1~0_293)) .cse16 .cse17 .cse18) (and (or .cse19 (not .cse18)) (or (and .cse12 .cse13 (= |v_P3_#t~ite15_101| (ite .cse20 v_~z$w_buff1~0_293 v_~z$w_buff0~0_331)) .cse17) (and (= |v_P3_#t~mem13_110| |v_P3_#t~ite14_109|) .cse19 (= .cse10 |v_P3_#t~mem13_110|) (= |v_P3_#t~ite14_109| |v_P3_#t~ite15_101|))) (= |v_P3_#t~ite16_93| |v_P3_#t~ite15_101|) .cse21 .cse16)) .cse22) (and .cse23 .cse13 .cse14 .cse24 .cse21 .cse16 .cse17 (= |v_P3_#t~ite17_85| v_~z$w_buff0~0_331))) (= |v_P3Thread1of1ForFork1_#t~mem10_82| |v_P3_#t~mem10_74|) .cse25 (= |v_P3_#t~ite17_85| v_~__unbuffered_p3_EAX~0_179)) (and .cse13 .cse14 .cse24 .cse26 .cse21 (= v_~__unbuffered_p3_EAX~0_179 |v_P3_#t~mem10_74|) (= .cse10 |v_P3_#t~mem10_74|) .cse16 .cse17 (= |v_P3_#t~ite17_85| |v_P3Thread1of1ForFork1_#t~ite17_81|)))) (= v_P0Thread1of1ForFork0_~arg.offset_39 |v_P0Thread1of1ForFork0_#in~arg.offset_39|) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_60| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_60|)))))))))))) InVars {~#z~0.base=|v_~#z~0.base_276|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_318, ~z$w_buff1~0=v_~z$w_buff1~0_293, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_33|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_223, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_39|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_43|, P3Thread1of1ForFork1_#t~ite16=|v_P3Thread1of1ForFork1_#t~ite16_82|, P3Thread1of1ForFork1_#t~ite17=|v_P3Thread1of1ForFork1_#t~ite17_81|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_327, P3Thread1of1ForFork1_#t~ite14=|v_P3Thread1of1ForFork1_#t~ite14_82|, P3Thread1of1ForFork1_#t~ite15=|v_P3Thread1of1ForFork1_#t~ite15_82|, P3Thread1of1ForFork1_#t~ite12=|v_P3Thread1of1ForFork1_#t~ite12_82|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_84, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_35|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_331, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_503, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_39|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_35|, P3Thread1of1ForFork1_#t~mem20=|v_P3Thread1of1ForFork1_#t~mem20_82|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_43|, ~#z~0.offset=|v_~#z~0.offset_276|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_84|, P3Thread1of1ForFork1_#t~mem13=|v_P3Thread1of1ForFork1_#t~mem13_82|, P3Thread1of1ForFork1_#t~nondet6=|v_P3Thread1of1ForFork1_#t~nondet6_82|, P3Thread1of1ForFork1_#t~mem11=|v_P3Thread1of1ForFork1_#t~mem11_82|, P3Thread1of1ForFork1_#t~nondet7=|v_P3Thread1of1ForFork1_#t~nondet7_82|, P3Thread1of1ForFork1_#t~mem10=|v_P3Thread1of1ForFork1_#t~mem10_82|, P3Thread1of1ForFork1_#t~nondet9=|v_P3Thread1of1ForFork1_#t~nondet9_82|, #memory_int=|v_#memory_int_579|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_222, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_33|, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_84|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82} OutVars{~#z~0.base=|v_~#z~0.base_276|, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_35|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_39, ~a~0=v_~a~0_61, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_223, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~weak$$choice1~0=v_~weak$$choice1~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_90, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_111, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_43|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_325, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_179, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_93, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_35|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_80, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_501, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_43|, ~z$flush_delayed~0=v_~z$flush_delayed~0_96, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_43|, ~weak$$choice0~0=v_~weak$$choice0~0_119, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_84, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_221, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_44|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_33|, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_60|, ~x~0=v_~x~0_58, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_316, ~z$w_buff1~0=v_~z$w_buff1~0_291, P3Thread1of1ForFork1_#t~mem8=|v_P3Thread1of1ForFork1_#t~mem8_43|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_43, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_33|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_39|, P3Thread1of1ForFork1_#t~ite18=|v_P3Thread1of1ForFork1_#t~ite18_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_229, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_122, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_43, ~y~0=v_~y~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_84, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_33, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_569, ~z$w_buff0~0=v_~z$w_buff0~0_329, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_157, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_35|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_39|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_35|, ~#z~0.offset=|v_~#z~0.offset_276|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_33, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_122, #memory_int=|v_#memory_int_577|, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_60|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_94, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_43|} AuxVars[|v_P3_#t~ite14_109|, |v_P3_#t~mem11_104|, |v_P3_#t~ite24_66|, |v_P3_#t~ite23_76|, |v_P3_#t~mem20_84|, |v_P3_#t~ite12_103|, |v_P3_#t~mem22_79|, |v_P3_#t~ite21_81|, |v_P3_#t~mem10_74|, |v_P3_#t~ite17_85|, |v_P3_#t~ite16_93|, |v_P3_#t~mem13_110|, |v_P3_#t~ite15_101|] AssignedVars[P2Thread1of1ForFork3_~arg#1.offset, ~z$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg.base, ~a~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p3_EAX$read_delayed~0, P3Thread1of1ForFork1_#t~ite17, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, P3Thread1of1ForFork1_#t~ite15, ~__unbuffered_p2_EAX~0, P0Thread1of1ForFork0_~arg.offset, ~z$mem_tmp~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1_#t~mem19, ~z$flush_delayed~0, P3Thread1of1ForFork1_#t~mem13, ~weak$$choice0~0, P3Thread1of1ForFork1_#t~mem11, P3Thread1of1ForFork1_#t~nondet7, P3Thread1of1ForFork1_#t~nondet9, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, P3Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~x~0, ~z$r_buff1_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1_#t~mem8, P3Thread1of1ForFork1_~arg.base, P3Thread1of1ForFork1_#t~ite18, ~z$r_buff1_thd0~0, P3Thread1of1ForFork1_#t~ite16, ~__unbuffered_p3_EAX$read_delayed_var~0.offset, P3Thread1of1ForFork1_#t~ite14, P3Thread1of1ForFork1_#t~ite12, P3Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork2_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork1_#t~mem20, P3Thread1of1ForFork1_#t~mem22, P1Thread1of1ForFork2_~arg.offset, P3Thread1of1ForFork1_#t~nondet6, P3Thread1of1ForFork1_#t~mem10, ~__unbuffered_p3_EAX$read_delayed_var~0.base, #memory_int, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P3Thread1of1ForFork1_#t~ite23, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~ite21] and [677] L815-->L822: Formula: (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse7 (= (mod v_~z$r_buff1_thd3~0_37 256) 0)) (.cse8 (= (mod v_~z$w_buff1_used~0_169 256) 0)) (.cse1 (not (= (mod v_~z$w_buff0_used~0_189 256) 0))) (.cse10 (not .cse4)) (.cse3 (= (mod v_~z$w_buff0_used~0_190 256) 0))) (let ((.cse0 (select |v_#memory_int_165| |v_~#z~0.base_112|)) (.cse9 (not .cse3)) (.cse11 (and .cse1 .cse10)) (.cse5 (not .cse8)) (.cse2 (not .cse7))) (and (= (store |v_#memory_int_165| |v_~#z~0.base_112| (store .cse0 |v_~#z~0.offset_112| |v_P2_#t~ite5#1_29|)) |v_#memory_int_164|) (= (ite (or (and .cse1 (not (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (and .cse2 (not (= (mod v_~z$w_buff1_used~0_168 256) 0)))) 0 v_~z$r_buff1_thd3~0_37) v_~z$r_buff1_thd3~0_36) (let ((.cse6 (= |v_P2Thread1of1ForFork3_#t~mem3#1_1| |v_P2_#t~mem3#1_28|))) (or (and (or .cse3 .cse4) (= |v_P2_#t~ite4#1_29| |v_P2_#t~ite5#1_29|) (or (and .cse5 (= v_~z$w_buff1~0_70 |v_P2_#t~ite4#1_29|) .cse6 .cse2) (and (or .cse7 .cse8) (= (select .cse0 |v_~#z~0.offset_112|) |v_P2_#t~mem3#1_28|) (= |v_P2_#t~mem3#1_28| |v_P2_#t~ite4#1_29|)))) (and (= v_~z$w_buff0~0_79 |v_P2_#t~ite5#1_29|) .cse9 .cse10 (= |v_P2Thread1of1ForFork3_#t~ite4#1_1| |v_P2_#t~ite4#1_29|) .cse6))) (= (ite .cse11 0 v_~z$r_buff0_thd3~0_42) v_~z$r_buff0_thd3~0_41) (= v_~z$w_buff0_used~0_189 (ite (and .cse9 .cse10) 0 v_~z$w_buff0_used~0_190)) (= v_~z$w_buff1_used~0_168 (ite (or .cse11 (and .cse5 .cse2)) 0 v_~z$w_buff1_used~0_169)))))) InVars {P2Thread1of1ForFork3_#t~ite4#1=|v_P2Thread1of1ForFork3_#t~ite4#1_1|, ~#z~0.base=|v_~#z~0.base_112|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_190, ~z$w_buff0~0=v_~z$w_buff0~0_79, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_169, #memory_int=|v_#memory_int_165|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_70, P2Thread1of1ForFork3_#t~mem3#1=|v_P2Thread1of1ForFork3_#t~mem3#1_1|, ~#z~0.offset=|v_~#z~0.offset_112|} OutVars{~#z~0.base=|v_~#z~0.base_112|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_189, ~z$w_buff0~0=v_~z$w_buff0~0_79, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_36, P2Thread1of1ForFork3_#t~ite5#1=|v_P2Thread1of1ForFork3_#t~ite5#1_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_168, #memory_int=|v_#memory_int_164|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~#z~0.offset=|v_~#z~0.offset_112|} AuxVars[|v_P2_#t~mem3#1_28|, |v_P2_#t~ite4#1_29|, |v_P2_#t~ite5#1_29|] AssignedVars[P2Thread1of1ForFork3_#t~ite4#1, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite5#1, ~z$w_buff1_used~0, #memory_int, ~z$r_buff0_thd3~0, P2Thread1of1ForFork3_#t~mem3#1] [2022-12-06 06:46:56,154 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:46:56,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4310 [2022-12-06 06:46:56,155 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 180 flow [2022-12-06 06:46:56,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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:46:56,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:56,155 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:56,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:46:56,156 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash -835993308, now seen corresponding path program 1 times [2022-12-06 06:46:56,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:56,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135301527] [2022-12-06 06:46:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:56,303 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:46:56,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:56,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135301527] [2022-12-06 06:46:56,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135301527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:56,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:56,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:46:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343096547] [2022-12-06 06:46:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:56,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:46:56,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:56,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:46:56,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:46:56,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:46:56,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 2.8) 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:46:56,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:56,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:46:56,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:56,407 INFO L130 PetriNetUnfolder]: 67/138 cut-off events. [2022-12-06 06:46:56,407 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-06 06:46:56,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 138 events. 67/138 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 412 event pairs, 3 based on Foata normal form. 15/152 useless extension candidates. Maximal degree in co-relation 509. Up to 76 conditions per place. [2022-12-06 06:46:56,408 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 30 selfloop transitions, 13 changer transitions 0/43 dead transitions. [2022-12-06 06:46:56,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 311 flow [2022-12-06 06:46:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:46:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:46:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 06:46:56,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3652173913043478 [2022-12-06 06:46:56,409 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 180 flow. Second operand 5 states and 42 transitions. [2022-12-06 06:46:56,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 311 flow [2022-12-06 06:46:56,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 293 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:46:56,411 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 230 flow [2022-12-06 06:46:56,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 06:46:56,412 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2022-12-06 06:46:56,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:56,412 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 230 flow [2022-12-06 06:46:56,413 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:56,413 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:56,413 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 230 flow [2022-12-06 06:46:56,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 230 flow [2022-12-06 06:46:56,425 INFO L130 PetriNetUnfolder]: 41/112 cut-off events. [2022-12-06 06:46:56,425 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-06 06:46:56,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 112 events. 41/112 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 381 event pairs, 1 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 408. Up to 68 conditions per place. [2022-12-06 06:46:56,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 230 flow [2022-12-06 06:46:56,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 06:46:56,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L882-3-->L887: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| 0)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_26)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~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_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet32#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [840] L802-->L893: Formula: (let ((.cse5 (= (mod v_~z$r_buff0_thd0~0_228 256) 0))) (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_581 256) 0))) (.cse1 (not .cse5))) (let ((.cse2 (and .cse0 .cse1)) (.cse3 (= (mod v_~z$w_buff0_used~0_583 256) 0)) (.cse4 (select |v_#memory_int_588| |v_~#z~0.base_280|))) (and (= v_~z$r_buff0_thd1~0_86 v_~z$r_buff1_thd1~0_88) (= v_~z$r_buff0_thd3~0_232 v_~z$r_buff1_thd3~0_163) (= v_~z$r_buff0_thd2~0_88 v_~z$r_buff1_thd2~0_88) (= v_~z$r_buff1_thd0~0_233 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_227 256) 0)) .cse0) (and .cse1 (not (= (mod v_~z$w_buff1_used~0_511 256) 0)))) 0 v_~z$r_buff0_thd0~0_228)) (= v_~z$w_buff0_used~0_581 (ite .cse1 0 1)) (= v_~z$w_buff0~0_339 1) (= (ite (or .cse2 (and .cse1 (not .cse3))) 0 v_~z$w_buff0_used~0_583) v_~z$w_buff1_used~0_511) (= v_~z$r_buff0_thd0~0_227 (ite .cse2 0 v_~z$r_buff0_thd0~0_228)) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_64| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_64|) (= (store |v_#memory_int_588| |v_~#z~0.base_280| (store .cse4 |v_~#z~0.offset_280| |v_ULTIMATE.start_main_#t~ite35#1_180|)) |v_#memory_int_587|) (= v_~z$w_buff0~0_340 v_~z$w_buff1~0_299) (= v_~z$r_buff0_thd4~0_333 v_~z$r_buff1_thd4~0_324) (= v_~z$r_buff0_thd3~0_231 1) (= (ite .cse3 1 0) |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_64|) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_64| 0)) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~mem33#1_246| |v_ULTIMATE.start_main_#t~mem33#1_244|) (= v_~z$w_buff0~0_339 |v_ULTIMATE.start_main_#t~ite35#1_180|) (= |v_ULTIMATE.start_main_#t~ite34#1_239| |v_ULTIMATE.start_main_#t~ite34#1_241|)) (and (= |v_ULTIMATE.start_main_#t~ite34#1_239| |v_ULTIMATE.start_main_#t~mem33#1_244|) (= |v_ULTIMATE.start_main_#t~ite34#1_239| |v_ULTIMATE.start_main_#t~ite35#1_180|) (= (select .cse4 |v_~#z~0.offset_280|) |v_ULTIMATE.start_main_#t~mem33#1_244|) .cse5)))))) InVars {~#z~0.base=|v_~#z~0.base_280|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_228, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_246|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_241|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_583, ~z$w_buff0~0=v_~z$w_buff0~0_340, #memory_int=|v_#memory_int_588|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_333, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_232, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_86, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ~#z~0.offset=|v_~#z~0.offset_280|} OutVars{~#z~0.base=|v_~#z~0.base_280|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_324, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_581, ~z$w_buff0~0=v_~z$w_buff0~0_339, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_163, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_511, ~z$w_buff1~0=v_~z$w_buff1~0_299, ~#z~0.offset=|v_~#z~0.offset_280|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_179|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_227, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_233, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_88, #memory_int=|v_#memory_int_587|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_333, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_231, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_64|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_86, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_64|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88} AuxVars[|v_ULTIMATE.start_main_#t~mem33#1_244|, |v_ULTIMATE.start_main_#t~ite34#1_239|, |v_ULTIMATE.start_main_#t~ite35#1_180|] AssignedVars[~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite35#1, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem33#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, #memory_int, ~z$r_buff0_thd3~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] [2022-12-06 06:46:57,098 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:46:57,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 687 [2022-12-06 06:46:57,099 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 242 flow [2022-12-06 06:46:57,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) 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:46:57,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:46:57,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:46:57,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:46:57,099 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:46:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:46:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1683447752, now seen corresponding path program 1 times [2022-12-06 06:46:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:46:57,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375009184] [2022-12-06 06:46:57,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:46:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:46:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:46:57,246 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:46:57,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:46:57,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375009184] [2022-12-06 06:46:57,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375009184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:46:57,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:46:57,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:46:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347347383] [2022-12-06 06:46:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:46:57,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:46:57,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:46:57,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:46:57,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:46:57,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:46:57,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:46:57,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:46:57,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:46:57,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:46:57,329 INFO L130 PetriNetUnfolder]: 48/99 cut-off events. [2022-12-06 06:46:57,329 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-06 06:46:57,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 99 events. 48/99 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 269 event pairs, 0 based on Foata normal form. 9/107 useless extension candidates. Maximal degree in co-relation 431. Up to 57 conditions per place. [2022-12-06 06:46:57,330 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 21 selfloop transitions, 17 changer transitions 1/39 dead transitions. [2022-12-06 06:46:57,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 307 flow [2022-12-06 06:46:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:46:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:46:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-12-06 06:46:57,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 06:46:57,331 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 242 flow. Second operand 6 states and 42 transitions. [2022-12-06 06:46:57,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 307 flow [2022-12-06 06:46:57,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 246 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-12-06 06:46:57,333 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 194 flow [2022-12-06 06:46:57,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-06 06:46:57,333 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2022-12-06 06:46:57,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:46:57,333 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 194 flow [2022-12-06 06:46:57,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:46:57,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:46:57,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 194 flow [2022-12-06 06:46:57,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 194 flow [2022-12-06 06:46:57,342 INFO L130 PetriNetUnfolder]: 29/72 cut-off events. [2022-12-06 06:46:57,342 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:46:57,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 72 events. 29/72 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 191 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 245. Up to 30 conditions per place. [2022-12-06 06:46:57,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 194 flow [2022-12-06 06:46:57,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 06:46:57,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [837] $Ultimate##0-->L822: Formula: (let ((.cse25 (mod v_~z$w_buff0_used~0_565 256))) (let ((.cse26 (mod v_~weak$$choice0~0_117 256)) (.cse22 (= (mod v_~z$w_buff1_used~0_497 256) 0)) (.cse13 (= .cse25 0)) (.cse18 (= (mod v_~z$r_buff0_thd4~0_322 256) 0)) (.cse0 (= (mod v_~weak$$choice2~0_92 256) 0))) (let ((.cse1 (not .cse0)) (.cse17 (not .cse18)) (.cse20 (= (mod v_~z$r_buff1_thd4~0_312 256) 0)) (.cse16 (not .cse13)) (.cse21 (not .cse22)) (.cse19 (= (mod v_~weak$$choice1~0_144 256) 0)) (.cse23 (not (= .cse26 0)))) (let ((.cse7 (ite (= (ite .cse1 .cse25 (ite .cse13 .cse25 (ite (and .cse17 .cse16) 0 (ite (and .cse20 .cse18 .cse16 .cse21) (ite (or .cse19 .cse23) 1 0) .cse26)))) 0) 0 1))) (let ((.cse2 (= (mod .cse7 256) 0)) (.cse4 (select |v_#memory_int_573| |v_~#z~0.base_274|))) (let ((.cse14 (select .cse4 |v_~#z~0.offset_274|)) (.cse6 (not .cse2)) (.cse3 (not (= (mod v_~z$w_buff0_used~0_563 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_218 256) 0)))) (and (or (and (= |v_P3_#t~ite21_79| |v_P3_#t~mem20_82|) .cse0 (= v_~__unbuffered_p3_EAX~0_177 |v_P3_#t~mem20_82|)) (and (= |v_P3Thread1of1ForFork1_#t~mem20_78| |v_P3_#t~mem20_82|) .cse1 (= |v_P3_#t~ite21_79| v_~z$mem_tmp~0_78))) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_33| |v_P2Thread1of1ForFork3_~arg#1.base_33|) (= v_~x~0_56 1) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_33| |v_P2Thread1of1ForFork3_~arg#1.offset_33|) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_58| 0)) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_58| (ite .cse2 1 0)) (= |v_~#z~0.base_274| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_120) (= v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_120 |v_~#z~0.offset_274|) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_58| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_58|) (= v_~weak$$choice0~0_117 |v_P3Thread1of1ForFork1_#t~nondet6_78|) (= v_~a~0_59 1) (= v_~__unbuffered_p3_EAX$read_delayed~0_109 1) (= v_~weak$$choice2~0_92 |v_P3Thread1of1ForFork1_#t~nondet7_78|) (= v_~z$flush_delayed~0_94 0) (= v_P0Thread1of1ForFork0_~arg.offset_37 |v_P0Thread1of1ForFork0_#in~arg.offset_37|) (= (ite .cse3 0 1) v_~z$r_buff0_thd3~0_217) (= v_~z$r_buff0_thd0~0_221 v_~z$r_buff1_thd0~0_227) (= |v_P1Thread1of1ForFork2_#in~arg.base_31| v_P1Thread1of1ForFork2_~arg.base_31) (= v_~x~0_56 v_~__unbuffered_p1_EAX~0_88) (= v_~a~0_59 v_~__unbuffered_p0_EAX~0_90) (= |v_P1Thread1of1ForFork2_#in~arg.offset_31| v_P1Thread1of1ForFork2_~arg.offset_31) (= |v_#memory_int_571| (store |v_#memory_int_573| |v_~#z~0.base_274| (store .cse4 |v_~#z~0.offset_274| v_~z$w_buff0~0_323))) (= v_P0Thread1of1ForFork0_~arg.base_37 |v_P0Thread1of1ForFork0_#in~arg.base_37|) (= v_~z$r_buff0_thd1~0_80 v_~z$r_buff1_thd1~0_82) (= v_P3Thread1of1ForFork1_~arg.base_41 |v_P3Thread1of1ForFork1_#in~arg.base_41|) (= (ite (or (and .cse5 .cse6) .cse3) 0 .cse7) v_~z$w_buff1_used~0_495) (= v_~z$r_buff0_thd4~0_321 v_~z$r_buff1_thd4~0_310) (= v_~z$w_buff0~0_323 1) (= v_~z$r_buff0_thd2~0_82 v_~z$r_buff1_thd2~0_82) (let ((.cse9 (= |v_P3_#t~ite16_91| |v_P3Thread1of1ForFork1_#t~ite16_78|)) (.cse10 (= |v_P3_#t~ite15_99| |v_P3Thread1of1ForFork1_#t~ite15_78|)) (.cse11 (= |v_P3Thread1of1ForFork1_#t~mem11_78| |v_P3_#t~mem11_102|)) (.cse15 (= |v_P3_#t~ite12_101| |v_P3Thread1of1ForFork1_#t~ite12_78|)) (.cse8 (= |v_P3_#t~ite14_107| |v_P3Thread1of1ForFork1_#t~ite14_78|)) (.cse12 (= |v_P3Thread1of1ForFork1_#t~mem13_78| |v_P3_#t~mem13_108|))) (or (and (= v_~__unbuffered_p3_EAX~0_177 |v_P3_#t~mem10_72|) .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_P3_#t~ite17_83| |v_P3Thread1of1ForFork1_#t~ite17_77|) .cse13 (= .cse14 |v_P3_#t~mem10_72|) .cse15) (and (= |v_P3Thread1of1ForFork1_#t~mem10_78| |v_P3_#t~mem10_72|) (= |v_P3_#t~ite17_83| v_~__unbuffered_p3_EAX~0_177) .cse16 (or (and (= |v_P3_#t~ite17_83| v_~z$w_buff0~0_325) .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (and (= |v_P3_#t~ite17_83| |v_P3_#t~ite16_91|) .cse18 (or (and (= (ite (not .cse19) v_~z$w_buff0~0_325 v_~z$w_buff1~0_287) |v_P3_#t~ite12_101|) .cse8 .cse20 .cse10 .cse11 .cse12 (= |v_P3_#t~ite16_91| |v_P3_#t~ite12_101|) .cse21) (and (= |v_P3_#t~ite15_99| |v_P3_#t~ite16_91|) (or (not .cse20) .cse22) .cse11 .cse15 (or (and .cse8 (= |v_P3_#t~ite15_99| (ite .cse23 v_~z$w_buff1~0_287 v_~z$w_buff0~0_325)) .cse12 .cse21) (and .cse22 (= .cse14 |v_P3_#t~mem13_108|) (= |v_P3_#t~ite15_99| |v_P3_#t~ite14_107|) (= |v_P3_#t~mem13_108| |v_P3_#t~ite14_107|)))))))))) (= v_~z$mem_tmp~0_78 .cse14) (= v_~z$w_buff0~0_325 v_~z$w_buff1~0_285) (= v_~z$w_buff0_used~0_563 0) (= (ite .cse1 v_~z$r_buff0_thd4~0_322 (ite .cse2 v_~z$r_buff0_thd4~0_322 (let ((.cse24 (and .cse17 .cse6))) (ite .cse24 0 (ite (and .cse20 .cse18 (not (= (mod (ite .cse1 v_~z$w_buff1_used~0_497 (ite .cse2 v_~z$w_buff1_used~0_497 (ite .cse24 0 (ite (and .cse20 .cse18 .cse21 .cse6) v_~weak$$choice0~0_117 0)))) 256) 0)) .cse6) v_~z$r_buff0_thd4~0_322 0))))) v_~z$r_buff0_thd4~0_321) (= v_~y~0_59 1) (= v_~z$r_buff1_thd3~0_155 (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_217 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_495 256) 0)) .cse5)) 0 v_~z$r_buff0_thd3~0_218)) (= v_~weak$$choice1~0_144 |v_P3Thread1of1ForFork1_#t~nondet9_78|) (= v_~y~0_59 v_~__unbuffered_p2_EAX~0_91) (= v_P3Thread1of1ForFork1_~arg.offset_41 |v_P3Thread1of1ForFork1_#in~arg.offset_41|)))))))) InVars {~#z~0.base=|v_~#z~0.base_274|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_312, ~z$w_buff1~0=v_~z$w_buff1~0_287, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_31|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_221, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_37|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_41|, P3Thread1of1ForFork1_#t~ite16=|v_P3Thread1of1ForFork1_#t~ite16_78|, P3Thread1of1ForFork1_#t~ite17=|v_P3Thread1of1ForFork1_#t~ite17_77|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_322, P3Thread1of1ForFork1_#t~ite14=|v_P3Thread1of1ForFork1_#t~ite14_78|, P3Thread1of1ForFork1_#t~ite15=|v_P3Thread1of1ForFork1_#t~ite15_78|, P3Thread1of1ForFork1_#t~ite12=|v_P3Thread1of1ForFork1_#t~ite12_78|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_33|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_565, ~z$w_buff0~0=v_~z$w_buff0~0_325, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_497, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_37|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_33|, P3Thread1of1ForFork1_#t~mem20=|v_P3Thread1of1ForFork1_#t~mem20_78|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_41|, ~#z~0.offset=|v_~#z~0.offset_274|, P3Thread1of1ForFork1_#t~mem13=|v_P3Thread1of1ForFork1_#t~mem13_78|, P3Thread1of1ForFork1_#t~nondet6=|v_P3Thread1of1ForFork1_#t~nondet6_78|, P3Thread1of1ForFork1_#t~mem11=|v_P3Thread1of1ForFork1_#t~mem11_78|, P3Thread1of1ForFork1_#t~nondet7=|v_P3Thread1of1ForFork1_#t~nondet7_78|, P3Thread1of1ForFork1_#t~mem10=|v_P3Thread1of1ForFork1_#t~mem10_78|, P3Thread1of1ForFork1_#t~nondet9=|v_P3Thread1of1ForFork1_#t~nondet9_78|, #memory_int=|v_#memory_int_573|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_218, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_31|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_80} OutVars{~#z~0.base=|v_~#z~0.base_274|, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_33|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_82, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_37, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_221, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_90, ~weak$$choice1~0=v_~weak$$choice1~0_144, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_109, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_41|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_321, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_177, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_91, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_33|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_78, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_495, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_41|, ~z$flush_delayed~0=v_~z$flush_delayed~0_94, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_41|, ~weak$$choice0~0=v_~weak$$choice0~0_117, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_217, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_31|, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_58|, ~x~0=v_~x~0_56, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_310, ~z$w_buff1~0=v_~z$w_buff1~0_285, P3Thread1of1ForFork1_#t~mem8=|v_P3Thread1of1ForFork1_#t~mem8_41|, P2Thread1of1ForFork3_#t~mem3#1=|v_P2Thread1of1ForFork3_#t~mem3#1_52|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_41, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_31|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_37|, P3Thread1of1ForFork1_#t~ite18=|v_P3Thread1of1ForFork1_#t~ite18_41|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_120, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_41, ~y~0=v_~y~0_59, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_563, ~z$w_buff0~0=v_~z$w_buff0~0_323, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_155, P2Thread1of1ForFork3_#t~ite5#1=|v_P2Thread1of1ForFork3_#t~ite5#1_30|, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_33|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_37|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_33|, ~#z~0.offset=|v_~#z~0.offset_274|, P2Thread1of1ForFork3_#t~ite4#1=|v_P2Thread1of1ForFork3_#t~ite4#1_52|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_31, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_120, #memory_int=|v_#memory_int_571|, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_58|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_92, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_41|} AuxVars[|v_P3_#t~ite16_91|, |v_P3_#t~ite14_107|, |v_P3_#t~ite21_79|, |v_P3_#t~mem10_72|, |v_P3_#t~ite17_83|, |v_P3_#t~mem20_82|, |v_P3_#t~ite15_99|, |v_P3_#t~mem11_102|, |v_P3_#t~ite12_101|, |v_P3_#t~mem13_108|] AssignedVars[P2Thread1of1ForFork3_~arg#1.offset, ~z$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg.base, ~a~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p3_EAX$read_delayed~0, P3Thread1of1ForFork1_#t~ite17, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, P3Thread1of1ForFork1_#t~ite15, ~__unbuffered_p2_EAX~0, P0Thread1of1ForFork0_~arg.offset, ~z$mem_tmp~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1_#t~mem19, ~z$flush_delayed~0, P3Thread1of1ForFork1_#t~mem13, ~weak$$choice0~0, P3Thread1of1ForFork1_#t~mem11, P3Thread1of1ForFork1_#t~nondet7, P3Thread1of1ForFork1_#t~nondet9, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~x~0, ~z$r_buff1_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1_#t~mem8, P2Thread1of1ForFork3_#t~mem3#1, P3Thread1of1ForFork1_~arg.base, P3Thread1of1ForFork1_#t~ite18, ~z$r_buff1_thd0~0, P3Thread1of1ForFork1_#t~ite16, ~__unbuffered_p3_EAX$read_delayed_var~0.offset, P3Thread1of1ForFork1_#t~ite14, P3Thread1of1ForFork1_#t~ite12, P3Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork2_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite5#1, P2Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork1_#t~mem20, P2Thread1of1ForFork3_#t~ite4#1, P1Thread1of1ForFork2_~arg.offset, P3Thread1of1ForFork1_#t~nondet6, P3Thread1of1ForFork1_#t~mem10, ~__unbuffered_p3_EAX$read_delayed_var~0.base, #memory_int, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~ite21] and [684] L851-->L858: Formula: (let ((.cse4 (= (mod v_~z$r_buff0_thd4~0_104 256) 0))) (let ((.cse5 (= (mod v_~z$w_buff0_used~0_194 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_173 256) 0)) (.cse8 (= 0 (mod v_~z$r_buff1_thd4~0_92 256))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_193 256) 0))) (.cse11 (not .cse4))) (let ((.cse2 (and .cse1 .cse11)) (.cse0 (not .cse8)) (.cse3 (not .cse7)) (.cse10 (not .cse5)) (.cse6 (select |v_#memory_int_169| |v_~#z~0.base_114|))) (and (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_172 256) 0)) .cse0) (and (not (= (mod v_~z$r_buff0_thd4~0_103 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_92) v_~z$r_buff1_thd4~0_91) (= v_~z$r_buff0_thd4~0_103 (ite .cse2 0 v_~z$r_buff0_thd4~0_104)) (= (ite (or (and .cse0 .cse3) .cse2) 0 v_~z$w_buff1_used~0_173) v_~z$w_buff1_used~0_172) (let ((.cse9 (= |v_P3_#t~mem22_36| |v_P3Thread1of1ForFork1_#t~mem22_1|))) (or (and (or .cse4 .cse5) (or (and (= (select .cse6 |v_~#z~0.offset_114|) |v_P3_#t~mem22_36|) (or .cse7 .cse8) (= |v_P3_#t~ite23_33| |v_P3_#t~mem22_36|)) (and (= |v_P3_#t~ite23_33| v_~z$w_buff1~0_72) .cse0 .cse3 .cse9)) (= |v_P3_#t~ite23_33| |v_P3_#t~ite24_23|)) (and .cse10 (= |v_P3_#t~ite23_33| |v_P3Thread1of1ForFork1_#t~ite23_1|) (= |v_P3_#t~ite24_23| v_~z$w_buff0~0_81) .cse9 .cse11))) (= v_~z$w_buff0_used~0_193 (ite (and .cse10 .cse11) 0 v_~z$w_buff0_used~0_194)) (= |v_#memory_int_168| (store |v_#memory_int_169| |v_~#z~0.base_114| (store .cse6 |v_~#z~0.offset_114| |v_P3_#t~ite24_23|))))))) InVars {~#z~0.base=|v_~#z~0.base_114|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_92, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_194, ~z$w_buff0~0=v_~z$w_buff0~0_81, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_173, #memory_int=|v_#memory_int_169|, ~z$w_buff1~0=v_~z$w_buff1~0_72, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_1|, ~#z~0.offset=|v_~#z~0.offset_114|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_1|} OutVars{~#z~0.base=|v_~#z~0.base_114|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_193, ~z$w_buff0~0=v_~z$w_buff0~0_81, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_103, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_172, #memory_int=|v_#memory_int_168|, ~z$w_buff1~0=v_~z$w_buff1~0_72, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_1|, ~#z~0.offset=|v_~#z~0.offset_114|} AuxVars[|v_P3_#t~ite23_33|, |v_P3_#t~ite24_23|, |v_P3_#t~mem22_36|] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, #memory_int, P3Thread1of1ForFork1_#t~ite24, P3Thread1of1ForFork1_#t~ite23, P3Thread1of1ForFork1_#t~mem22] [2022-12-06 06:47:01,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [834] $Ultimate##0-->L858: Formula: (let ((.cse37 (mod v_~z$w_buff0_used~0_494 256)) (.cse38 (mod v_~weak$$choice0~0_109 256))) (let ((.cse29 (= .cse38 0)) (.cse19 (= .cse37 0)) (.cse30 (= (mod v_~z$w_buff1_used~0_439 256) 0)) (.cse26 (= (mod v_~z$r_buff0_thd4~0_281 256) 0)) (.cse16 (= (mod v_~weak$$choice2~0_84 256) 0))) (let ((.cse15 (not .cse16)) (.cse33 (not .cse26)) (.cse27 (not .cse30)) (.cse25 (not .cse19)) (.cse31 (= 0 (mod v_~z$r_buff1_thd4~0_273 256))) (.cse28 (not .cse29)) (.cse32 (= (mod v_~weak$$choice1~0_136 256) 0))) (let ((.cse35 (ite (= (ite .cse15 .cse37 (ite .cse19 .cse37 (ite (and .cse25 .cse33) 0 (ite (and .cse27 .cse26 .cse25 .cse31) (ite (or .cse28 .cse32) 1 0) .cse38)))) 0) 0 1))) (let ((.cse7 (= (mod .cse35 256) 0))) (let ((.cse9 (not .cse7))) (let ((.cse36 (and .cse9 .cse33))) (let ((.cse3 (ite .cse15 v_~z$w_buff1_used~0_439 (ite .cse7 v_~z$w_buff1_used~0_439 (ite .cse36 0 (ite (and .cse27 .cse26 .cse9 .cse31) v_~weak$$choice0~0_109 0)))))) (let ((.cse5 (= (mod .cse3 256) 0))) (let ((.cse1 (not .cse5))) (let ((.cse17 (ite .cse15 v_~z$r_buff0_thd4~0_281 (ite .cse7 v_~z$r_buff0_thd4~0_281 (ite .cse36 0 (ite (and .cse26 .cse1 .cse9 .cse31) v_~z$r_buff0_thd4~0_281 0)))))) (let ((.cse8 (= (mod .cse17 256) 0))) (let ((.cse10 (not .cse8))) (let ((.cse34 (and .cse9 .cse10))) (let ((.cse13 (ite .cse15 v_~z$r_buff1_thd4~0_273 (ite .cse7 v_~z$r_buff1_thd4~0_273 (ite .cse34 0 (ite (and .cse1 .cse8 .cse9 .cse31) (ite .cse28 v_~z$r_buff1_thd4~0_273 0) 0)))))) (let ((.cse14 (select |v_#memory_int_507| |v_~#z~0.base_244|)) (.cse12 (not (= (mod v_~z$w_buff0_used~0_492 256) 0))) (.cse6 (= (mod .cse13 256) 0))) (let ((.cse2 (not .cse6)) (.cse0 (and .cse12 .cse10)) (.cse11 (select .cse14 |v_~#z~0.offset_244|))) (and (= v_~y~0_51 v_~__unbuffered_p2_EAX~0_83) (= v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_104 |v_~#z~0.offset_244|) (= v_P3Thread1of1ForFork1_~arg.base_33 |v_P3Thread1of1ForFork1_#in~arg.base_33|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_23| v_P1Thread1of1ForFork2_~arg.offset_23) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_25| |v_P2Thread1of1ForFork3_~arg#1.base_25|) (= |v_~#z~0.base_244| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_104) (= v_~a~0_51 1) (= (ite (or .cse0 (and .cse1 .cse2)) 0 .cse3) v_~z$w_buff1_used~0_437) (= v_~weak$$choice0~0_109 |v_P3Thread1of1ForFork1_#t~nondet6_62|) (= v_~z$w_buff0~0_279 v_~z$w_buff0~0_278) (= v_~a~0_51 v_~__unbuffered_p0_EAX~0_82) (let ((.cse4 (= |v_P3Thread1of1ForFork1_#t~mem22_64| |v_P3_#t~mem22_67|))) (or (and (or (and .cse4 .cse1 (= |v_P3_#t~ite23_64| v_~z$w_buff1~0_248) .cse2) (and (or .cse5 .cse6) (= |v_P3_#t~ite23_64| |v_P3_#t~mem22_67|) (= |v_P3_#t~ite21_71| |v_P3_#t~mem22_67|))) (or .cse7 .cse8) (= |v_P3_#t~ite23_64| |v_P3_#t~ite24_54|)) (and .cse4 .cse9 (= |v_P3_#t~ite24_54| v_~z$w_buff0~0_278) .cse10 (= |v_P3_#t~ite23_64| |v_P3Thread1of1ForFork1_#t~ite23_64|)))) (= v_~x~0_48 1) (= v_P3Thread1of1ForFork1_~arg.offset_33 |v_P3Thread1of1ForFork1_#in~arg.offset_33|) (= v_~weak$$choice1~0_136 |v_P3Thread1of1ForFork1_#t~nondet9_62|) (= v_~z$mem_tmp~0_70 .cse11) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_437 256) 0)) .cse2) (and .cse12 (not (= (mod v_~z$r_buff0_thd4~0_279 256) 0)))) 0 .cse13) v_~z$r_buff1_thd4~0_271) (= (store |v_#memory_int_507| |v_~#z~0.base_244| (store .cse14 |v_~#z~0.offset_244| |v_P3_#t~ite24_54|)) |v_#memory_int_505|) (= v_~z$flush_delayed~0_86 0) (= v_~y~0_51 1) (= v_P0Thread1of1ForFork0_~arg.base_29 |v_P0Thread1of1ForFork0_#in~arg.base_29|) (or (and (= |v_P3Thread1of1ForFork1_#t~mem20_62| |v_P3_#t~mem20_74|) (= |v_P3_#t~ite21_71| v_~z$mem_tmp~0_70) .cse15) (and (= v_~__unbuffered_p3_EAX~0_161 |v_P3_#t~mem20_74|) .cse16 (= |v_P3_#t~ite21_71| |v_P3_#t~mem20_74|))) (= v_~x~0_48 v_~__unbuffered_p1_EAX~0_80) (= v_~z$r_buff0_thd4~0_279 (ite .cse0 0 .cse17)) (let ((.cse18 (= |v_P3Thread1of1ForFork1_#t~mem13_62| |v_P3_#t~mem13_100|)) (.cse20 (= |v_P3Thread1of1ForFork1_#t~mem11_62| |v_P3_#t~mem11_94|)) (.cse21 (= |v_P3_#t~ite15_91| |v_P3Thread1of1ForFork1_#t~ite15_62|)) (.cse22 (= |v_P3_#t~ite12_93| |v_P3Thread1of1ForFork1_#t~ite12_62|)) (.cse23 (= |v_P3_#t~ite14_99| |v_P3Thread1of1ForFork1_#t~ite14_62|)) (.cse24 (= |v_P3_#t~ite16_83| |v_P3Thread1of1ForFork1_#t~ite16_62|))) (or (and .cse18 .cse19 (= |v_P3_#t~ite17_75| |v_P3Thread1of1ForFork1_#t~ite17_61|) .cse20 .cse21 .cse22 (= .cse11 |v_P3_#t~mem10_64|) .cse23 .cse24 (= v_~__unbuffered_p3_EAX~0_161 |v_P3_#t~mem10_64|)) (and (= |v_P3Thread1of1ForFork1_#t~mem10_62| |v_P3_#t~mem10_64|) .cse25 (or (and .cse26 (= |v_P3_#t~ite17_75| |v_P3_#t~ite16_83|) (or (and (or (and .cse27 .cse18 .cse23 (= |v_P3_#t~ite15_91| (ite .cse28 v_~z$w_buff1~0_249 v_~z$w_buff0~0_279))) (and (= |v_P3_#t~ite14_99| |v_P3_#t~ite15_91|) (or (and (= .cse11 |v_P3_#t~mem13_100|) .cse29 (= |v_P3_#t~ite14_99| |v_P3_#t~mem13_100|)) (and (= |v_P3_#t~ite14_99| v_~z$w_buff0~0_279) .cse18 .cse28)) .cse30)) (= |v_P3_#t~ite15_91| |v_P3_#t~ite16_83|) .cse20 .cse22 (or (not .cse31) .cse30)) (and .cse27 .cse18 (or (and (= |v_P3_#t~ite12_93| |v_P3_#t~mem11_94|) (= .cse11 |v_P3_#t~mem11_94|) .cse28) (and (= (ite (not .cse32) v_~z$w_buff0~0_279 v_~z$w_buff1~0_249) |v_P3_#t~ite12_93|) .cse29 .cse20)) .cse21 .cse23 .cse31 (= |v_P3_#t~ite12_93| |v_P3_#t~ite16_83|)))) (and .cse18 .cse20 .cse21 .cse22 .cse33 .cse23 .cse24 (= |v_P3_#t~ite17_75| v_~z$w_buff0~0_279))) (= |v_P3_#t~ite17_75| v_~__unbuffered_p3_EAX~0_161)))) (= v_~weak$$choice2~0_84 |v_P3Thread1of1ForFork1_#t~nondet7_62|) (= v_~z$w_buff1~0_249 v_~z$w_buff1~0_248) (= v_P0Thread1of1ForFork0_~arg.offset_29 |v_P0Thread1of1ForFork0_#in~arg.offset_29|) (= v_~__unbuffered_p3_EAX$read_delayed~0_101 1) (= v_~z$w_buff0_used~0_492 (ite .cse34 0 .cse35)) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_25| |v_P2Thread1of1ForFork3_~arg#1.offset_25|) (= |v_P1Thread1of1ForFork2_#in~arg.base_23| v_P1Thread1of1ForFork2_~arg.base_23))))))))))))))))))) InVars {~#z~0.base=|v_~#z~0.base_244|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_273, ~z$w_buff1~0=v_~z$w_buff1~0_249, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_29|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_33|, P3Thread1of1ForFork1_#t~ite16=|v_P3Thread1of1ForFork1_#t~ite16_62|, P3Thread1of1ForFork1_#t~ite17=|v_P3Thread1of1ForFork1_#t~ite17_61|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_281, P3Thread1of1ForFork1_#t~ite14=|v_P3Thread1of1ForFork1_#t~ite14_62|, P3Thread1of1ForFork1_#t~ite15=|v_P3Thread1of1ForFork1_#t~ite15_62|, P3Thread1of1ForFork1_#t~ite12=|v_P3Thread1of1ForFork1_#t~ite12_62|, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_25|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_494, ~z$w_buff0~0=v_~z$w_buff0~0_279, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_439, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_29|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_25|, P3Thread1of1ForFork1_#t~mem20=|v_P3Thread1of1ForFork1_#t~mem20_62|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_33|, ~#z~0.offset=|v_~#z~0.offset_244|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_64|, P3Thread1of1ForFork1_#t~mem13=|v_P3Thread1of1ForFork1_#t~mem13_62|, P3Thread1of1ForFork1_#t~nondet6=|v_P3Thread1of1ForFork1_#t~nondet6_62|, P3Thread1of1ForFork1_#t~mem11=|v_P3Thread1of1ForFork1_#t~mem11_62|, P3Thread1of1ForFork1_#t~nondet7=|v_P3Thread1of1ForFork1_#t~nondet7_62|, P3Thread1of1ForFork1_#t~mem10=|v_P3Thread1of1ForFork1_#t~mem10_62|, P3Thread1of1ForFork1_#t~nondet9=|v_P3Thread1of1ForFork1_#t~nondet9_62|, #memory_int=|v_#memory_int_507|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_23|, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_64|} OutVars{~#z~0.base=|v_~#z~0.base_244|, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_25|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_29, ~a~0=v_~a~0_51, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ~weak$$choice1~0=v_~weak$$choice1~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_101, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_33|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_279, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_161, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_83, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_25|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_29, ~z$mem_tmp~0=v_~z$mem_tmp~0_70, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_437, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_33|, ~z$flush_delayed~0=v_~z$flush_delayed~0_86, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_33|, ~weak$$choice0~0=v_~weak$$choice0~0_109, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_34|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_23|, ~x~0=v_~x~0_48, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_271, ~z$w_buff1~0=v_~z$w_buff1~0_248, P3Thread1of1ForFork1_#t~mem8=|v_P3Thread1of1ForFork1_#t~mem8_33|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_33, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_29|, P3Thread1of1ForFork1_#t~ite18=|v_P3Thread1of1ForFork1_#t~ite18_33|, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_104, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_33, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_492, ~z$w_buff0~0=v_~z$w_buff0~0_278, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_25|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_29|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_25|, ~#z~0.offset=|v_~#z~0.offset_244|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_23, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_104, #memory_int=|v_#memory_int_505|, ~weak$$choice2~0=v_~weak$$choice2~0_84, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_33|} AuxVars[|v_P3_#t~ite24_54|, |v_P3_#t~mem11_94|, |v_P3_#t~ite23_64|, |v_P3_#t~mem20_74|, |v_P3_#t~mem22_67|, |v_P3_#t~ite21_71|, |v_P3_#t~ite15_91|, |v_P3_#t~ite17_75|, |v_P3_#t~mem10_64|, |v_P3_#t~mem13_100|, |v_P3_#t~ite16_83|, |v_P3_#t~ite14_99|, |v_P3_#t~ite12_93|] AssignedVars[P2Thread1of1ForFork3_~arg#1.offset, P0Thread1of1ForFork0_~arg.base, ~a~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p3_EAX$read_delayed~0, P3Thread1of1ForFork1_#t~ite17, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, P3Thread1of1ForFork1_#t~ite15, ~__unbuffered_p2_EAX~0, P0Thread1of1ForFork0_~arg.offset, ~z$mem_tmp~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1_#t~mem19, ~z$flush_delayed~0, P3Thread1of1ForFork1_#t~mem13, ~weak$$choice0~0, P3Thread1of1ForFork1_#t~mem11, P3Thread1of1ForFork1_#t~nondet7, P3Thread1of1ForFork1_#t~nondet9, P3Thread1of1ForFork1_#t~ite24, ~x~0, ~z$r_buff1_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1_#t~mem8, P3Thread1of1ForFork1_~arg.base, P3Thread1of1ForFork1_#t~ite18, P3Thread1of1ForFork1_#t~ite16, ~__unbuffered_p3_EAX$read_delayed_var~0.offset, P3Thread1of1ForFork1_#t~ite14, P3Thread1of1ForFork1_#t~ite12, P3Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork2_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork1_#t~mem20, P3Thread1of1ForFork1_#t~mem22, P1Thread1of1ForFork2_~arg.offset, P3Thread1of1ForFork1_#t~nondet6, P3Thread1of1ForFork1_#t~mem10, ~__unbuffered_p3_EAX$read_delayed_var~0.base, #memory_int, P3Thread1of1ForFork1_#t~ite23, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~ite21] and [839] L802-->L822: Formula: (let ((.cse0 (= (mod v_~z$w_buff0_used~0_577 256) 0)) (.cse1 (not (= (mod v_~z$r_buff0_thd3~0_227 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_575 256) 0)))) (and (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_62| 0)) (= v_~z$w_buff0~0_335 1) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_62| (ite .cse0 1 0)) (= v_~z$w_buff0_used~0_575 0) (= v_~z$w_buff0~0_336 v_~z$w_buff1~0_297) (= (store |v_#memory_int_584| |v_~#z~0.base_278| (store (select |v_#memory_int_584| |v_~#z~0.base_278|) |v_~#z~0.offset_278| v_~z$w_buff0~0_335)) |v_#memory_int_583|) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_62| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_62|) (= v_~z$r_buff0_thd0~0_225 v_~z$r_buff1_thd0~0_231) (= v_~z$r_buff0_thd1~0_84 v_~z$r_buff1_thd1~0_86) (= (ite (or (and (not .cse0) .cse1) .cse2) 0 v_~z$w_buff0_used~0_577) v_~z$w_buff1_used~0_507) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_225 256) 0)) .cse2) (and .cse1 (not (= (mod v_~z$w_buff1_used~0_507 256) 0)))) 0 v_~z$r_buff0_thd3~0_227) v_~z$r_buff1_thd3~0_159) (= v_~z$r_buff0_thd4~0_331 v_~z$r_buff1_thd4~0_322) (= v_~z$r_buff0_thd2~0_86 v_~z$r_buff1_thd2~0_86) (= v_~z$r_buff0_thd3~0_225 (ite .cse2 0 1)))) InVars {~#z~0.base=|v_~#z~0.base_278|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_577, ~z$w_buff0~0=v_~z$w_buff0~0_336, #memory_int=|v_#memory_int_584|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_331, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_227, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_84, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_86, ~#z~0.offset=|v_~#z~0.offset_278|} OutVars{~#z~0.base=|v_~#z~0.base_278|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_322, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_575, ~z$w_buff0~0=v_~z$w_buff0~0_335, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_159, P2Thread1of1ForFork3_#t~ite5#1=|v_P2Thread1of1ForFork3_#t~ite5#1_32|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_86, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_507, ~z$w_buff1~0=v_~z$w_buff1~0_297, P2Thread1of1ForFork3_#t~mem3#1=|v_P2Thread1of1ForFork3_#t~mem3#1_54|, ~#z~0.offset=|v_~#z~0.offset_278|, P2Thread1of1ForFork3_#t~ite4#1=|v_P2Thread1of1ForFork3_#t~ite4#1_54|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_231, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_86, #memory_int=|v_#memory_int_583|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_331, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_225, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_62|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_84, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_62|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_86} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite5#1, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~mem3#1, P2Thread1of1ForFork3_#t~ite4#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, #memory_int, ~z$r_buff0_thd3~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] [2022-12-06 06:47:05,388 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:47:05,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8055 [2022-12-06 06:47:05,389 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 186 flow [2022-12-06 06:47:05,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:47:05,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:47:05,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:05,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:47:05,389 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:47:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:47:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash -697223106, now seen corresponding path program 1 times [2022-12-06 06:47:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:47:05,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708933045] [2022-12-06 06:47:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:47:05,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:47:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:47:05,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:47:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:47:05,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:47:05,535 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:47:05,536 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:47:05,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:47:05,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:47:05,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:47:05,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:47:05,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:47:05,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:47:05,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:47:05,539 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:47:05,544 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:47:05,544 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:47:05,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:47:05 BasicIcfg [2022-12-06 06:47:05,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:47:05,623 INFO L158 Benchmark]: Toolchain (without parser) took 47314.47ms. Allocated memory was 178.3MB in the beginning and 784.3MB in the end (delta: 606.1MB). Free memory was 153.2MB in the beginning and 412.2MB in the end (delta: -259.1MB). Peak memory consumption was 347.7MB. Max. memory is 8.0GB. [2022-12-06 06:47:05,623 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:47:05,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.26ms. Allocated memory is still 178.3MB. Free memory was 152.9MB in the beginning and 124.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:47:05,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.97ms. Allocated memory is still 178.3MB. Free memory was 124.5MB in the beginning and 121.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:47:05,623 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 119.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:47:05,623 INFO L158 Benchmark]: RCFGBuilder took 961.29ms. Allocated memory was 178.3MB in the beginning and 233.8MB in the end (delta: 55.6MB). Free memory was 118.8MB in the beginning and 193.8MB in the end (delta: -75.0MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. [2022-12-06 06:47:05,624 INFO L158 Benchmark]: TraceAbstraction took 45730.76ms. Allocated memory was 233.8MB in the beginning and 784.3MB in the end (delta: 550.5MB). Free memory was 192.8MB in the beginning and 412.2MB in the end (delta: -219.5MB). Peak memory consumption was 330.5MB. Max. memory is 8.0GB. [2022-12-06 06:47:05,624 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 178.3MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 521.26ms. Allocated memory is still 178.3MB. Free memory was 152.9MB in the beginning and 124.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.97ms. Allocated memory is still 178.3MB. Free memory was 124.5MB in the beginning and 121.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 119.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 961.29ms. Allocated memory was 178.3MB in the beginning and 233.8MB in the end (delta: 55.6MB). Free memory was 118.8MB in the beginning and 193.8MB in the end (delta: -75.0MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. * TraceAbstraction took 45730.76ms. Allocated memory was 233.8MB in the beginning and 784.3MB in the end (delta: 550.5MB). Free memory was 192.8MB in the beginning and 412.2MB in the end (delta: -219.5MB). Peak memory consumption was 330.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2s, 156 PlacesBefore, 43 PlacesAfterwards, 145 TransitionsBefore, 31 TransitionsAfterwards, 2750 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2071, independent: 2005, independent conditional: 2005, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2071, independent: 2005, independent conditional: 0, independent unconditional: 2005, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2071, independent: 2005, independent conditional: 0, independent unconditional: 2005, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2071, independent: 2005, independent conditional: 0, independent unconditional: 2005, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1749, independent: 1712, independent conditional: 0, independent unconditional: 1712, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1749, independent: 1698, independent conditional: 0, independent unconditional: 1698, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 263, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2071, independent: 293, independent conditional: 0, independent unconditional: 293, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 1749, unknown conditional: 0, unknown unconditional: 1749] , Statistics on independence cache: Total cache size (in pairs): 2582, Positive cache size: 2545, Positive conditional cache size: 0, Positive unconditional cache size: 2545, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 140, independent conditional: 140, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 140, independent conditional: 20, independent unconditional: 120, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 140, independent conditional: 20, independent unconditional: 120, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 140, independent conditional: 20, independent unconditional: 120, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 149, independent: 130, independent conditional: 17, independent unconditional: 113, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 149, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 99, dependent conditional: 51, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 149, unknown conditional: 23, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 130, Positive conditional cache size: 17, Positive unconditional cache size: 113, Negative cache size: 19, Negative conditional cache size: 6, Negative unconditional cache size: 13, 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.1s, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 136, independent conditional: 136, 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: 158, independent: 136, independent conditional: 9, independent unconditional: 127, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 136, independent conditional: 0, independent unconditional: 136, 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: 158, independent: 136, independent conditional: 0, independent unconditional: 136, 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: 23, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 147, Positive conditional cache size: 17, Positive unconditional cache size: 130, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 135, independent conditional: 14, independent unconditional: 121, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 21, dependent conditional: 0, dependent unconditional: 21, 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: 156, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 147, Positive conditional cache size: 17, Positive unconditional cache size: 130, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 40 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 284, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 284, independent: 247, independent conditional: 56, independent unconditional: 191, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 284, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 284, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 32, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 284, independent: 217, independent conditional: 0, independent unconditional: 217, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 198, Positive conditional cache size: 19, Positive unconditional cache size: 179, Negative cache size: 27, Negative conditional cache size: 6, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 94, independent: 77, independent conditional: 11, independent unconditional: 66, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 54, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 200, Positive conditional cache size: 19, Positive unconditional cache size: 181, Negative cache size: 29, Negative conditional cache size: 6, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 143, independent: 113, independent conditional: 29, independent unconditional: 84, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 143, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 143, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 235, Positive conditional cache size: 21, Positive unconditional cache size: 214, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 41 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 19 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 81, independent conditional: 21, independent unconditional: 60, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 278, Positive conditional cache size: 21, Positive unconditional cache size: 257, Negative cache size: 37, Negative conditional cache size: 6, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 35 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 61, independent conditional: 26, independent unconditional: 35, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 61, independent conditional: 26, independent unconditional: 35, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 61, independent conditional: 26, independent unconditional: 35, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, 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: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 119, independent: 119, independent conditional: 119, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 50, independent conditional: 16, independent unconditional: 34, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 326, Positive conditional cache size: 31, Positive unconditional cache size: 295, Negative cache size: 37, Negative conditional cache size: 6, Negative unconditional cache size: 31, 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.8s, 38 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 64, independent conditional: 24, independent unconditional: 40, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 64, independent conditional: 24, independent unconditional: 40, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 64, independent conditional: 24, independent unconditional: 40, dependent: 26, dependent conditional: 0, dependent unconditional: 26, 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: 90, independent: 63, independent conditional: 23, independent unconditional: 40, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 366, Positive conditional cache size: 32, Positive unconditional cache size: 334, Negative cache size: 37, Negative conditional cache size: 6, Negative unconditional cache size: 31, 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, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 368, Positive conditional cache size: 33, Positive unconditional cache size: 335, Negative cache size: 37, Negative conditional cache size: 6, Negative unconditional cache size: 31, 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, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 368, Positive conditional cache size: 33, Positive unconditional cache size: 335, Negative cache size: 37, Negative conditional cache size: 6, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 10, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 368, Positive conditional cache size: 33, Positive unconditional cache size: 335, Negative cache size: 37, Negative conditional cache size: 6, Negative unconditional cache size: 31, 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: 4.3s, 40 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 18, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 26, independent conditional: 18, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 18, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 28, independent: 25, independent conditional: 17, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 369, Positive conditional cache size: 34, Positive unconditional cache size: 335, Negative cache size: 37, Negative conditional cache size: 6, Negative unconditional cache size: 31, 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, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 390, Positive conditional cache size: 36, Positive unconditional cache size: 354, Negative cache size: 38, Negative conditional cache size: 6, Negative unconditional cache size: 32, 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.0s, 39 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 18, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 408, Positive conditional cache size: 41, Positive unconditional cache size: 367, Negative cache size: 38, Negative conditional cache size: 6, Negative unconditional cache size: 32, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=-3, t2709={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=-2, t2709={7:0}, t2710={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=-1, t2709={7:0}, t2710={5:0}, t2711={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=0, t2709={7:0}, t2710={5:0}, t2711={6:0}, t2712={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 [L850] 4 a = 1 [L771] 4 __unbuffered_p0_EAX = a [L774] 4 x = 1 [L786] 4 __unbuffered_p1_EAX = x [L789] 4 y = 1 [L801] 4 __unbuffered_p2_EAX = y [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 1 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd3 = (_Bool)1 [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 4 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 4 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 4 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=1, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 876]: 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: 882]: 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: 880]: 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: 878]: 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 9 procedures, 183 locations, 7 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: 45.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 790 IncrementalHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 3 mSDtfsCounter, 790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=14, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:47:05,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...