/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-a802222-m [2022-12-13 12:06:13,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:06:13,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:06:13,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:06:13,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:06:13,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:06:13,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:06:13,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:06:13,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:06:13,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:06:13,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:06:13,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:06:13,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:06:13,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:06:13,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:06:13,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:06:13,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:06:13,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:06:13,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:06:13,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:06:13,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:06:13,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:06:13,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:06:13,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:06:13,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:06:13,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:06:13,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:06:13,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:06:13,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:06:13,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:06:13,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:06:13,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:06:13,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:06:13,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:06:13,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:06:13,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:06:13,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:06:13,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:06:13,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:06:13,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:06:13,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:06:13,762 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-13 12:06:13,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:06:13,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:06:13,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:06:13,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:06:13,789 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:06:13,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:06:13,789 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:06:13,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:06:13,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:06:13,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:06:13,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:06:13,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:06:13,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:06:13,791 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:06:13,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:06:13,791 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:06:13,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:06:13,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:06:13,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:06:13,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:06:13,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:06:13,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:13,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:06:13,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:06:13,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:06:13,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:06:13,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:06:13,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:06:13,792 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-13 12:06:14,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:06:14,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:06:14,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:06:14,102 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:06:14,103 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:06:14,104 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-13 12:06:15,170 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:06:15,372 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:06:15,372 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2022-12-13 12:06:15,381 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc239e5c/8002f5af910a4b8eaee8ca8d71b952ce/FLAGdf3103367 [2022-12-13 12:06:15,392 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc239e5c/8002f5af910a4b8eaee8ca8d71b952ce [2022-12-13 12:06:15,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:06:15,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:06:15,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:15,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:06:15,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:06:15,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36419f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15, skipping insertion in model container [2022-12-13 12:06:15,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:06:15,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:06:15,558 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-13 12:06:15,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:15,772 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:06:15,782 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-13 12:06:15,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:15,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:15,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:15,892 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:06:15,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15 WrapperNode [2022-12-13 12:06:15,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:15,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:15,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:06:15,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:06:15,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,932 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2022-12-13 12:06:15,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:15,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:06:15,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:06:15,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:06:15,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,963 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:06:15,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:06:15,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:06:15,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:06:15,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (1/1) ... [2022-12-13 12:06:15,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:15,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:06:15,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:06:16,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:06:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:06:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:06:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:06:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:06:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:06:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:06:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:06:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:06:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:06:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:06:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:06:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:06:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:06:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:06:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:06:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:06:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:06:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:06:16,049 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:06:16,170 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:06:16,172 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:06:16,477 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:06:16,813 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:06:16,813 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:06:16,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:16 BoogieIcfgContainer [2022-12-13 12:06:16,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:06:16,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:06:16,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:06:16,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:06:16,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:06:15" (1/3) ... [2022-12-13 12:06:16,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a7fb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:16, skipping insertion in model container [2022-12-13 12:06:16,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:15" (2/3) ... [2022-12-13 12:06:16,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a7fb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:16, skipping insertion in model container [2022-12-13 12:06:16,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:16" (3/3) ... [2022-12-13 12:06:16,823 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2022-12-13 12:06:16,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:06:16,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:06:16,837 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:06:16,904 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:06:16,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 12:06:17,051 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-13 12:06:17,052 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:06:17,057 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-13 12:06:17,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 12:06:17,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2022-12-13 12:06:17,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:17,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-13 12:06:17,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2022-12-13 12:06:17,138 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-13 12:06:17,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:06:17,138 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-13 12:06:17,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-13 12:06:17,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 2750 [2022-12-13 12:06:26,750 INFO L241 LiptonReduction]: Total number of compositions: 121 [2022-12-13 12:06:26,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:06:26,773 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;@628e64ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:06:26,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 12:06:26,777 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-13 12:06:26,777 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:06:26,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:26,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:26,778 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-13 12:06:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash 135602235, now seen corresponding path program 1 times [2022-12-13 12:06:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:26,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677759882] [2022-12-13 12:06:26,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:27,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677759882] [2022-12-13 12:06:27,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677759882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:27,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:27,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:06:27,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229686875] [2022-12-13 12:06:27,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:27,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:06:27,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:06:27,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:06:27,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 71 [2022-12-13 12:06:27,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:27,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:27,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 71 [2022-12-13 12:06:27,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:33,232 INFO L130 PetriNetUnfolder]: 43031/59609 cut-off events. [2022-12-13 12:06:33,232 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-13 12:06:33,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116937 conditions, 59609 events. 43031/59609 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 3541. Compared 438860 event pairs, 12823 based on Foata normal form. 0/35394 useless extension candidates. Maximal degree in co-relation 116925. Up to 39553 conditions per place. [2022-12-13 12:06:33,381 INFO L137 encePairwiseOnDemand]: 65/71 looper letters, 39 selfloop transitions, 2 changer transitions 56/110 dead transitions. [2022-12-13 12:06:33,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 110 transitions, 429 flow [2022-12-13 12:06:33,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:06:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:06:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-12-13 12:06:33,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6713615023474179 [2022-12-13 12:06:33,390 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 154 flow. Second operand 3 states and 143 transitions. [2022-12-13 12:06:33,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 110 transitions, 429 flow [2022-12-13 12:06:33,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 110 transitions, 424 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:06:33,396 INFO L231 Difference]: Finished difference. Result has 78 places, 39 transitions, 90 flow [2022-12-13 12:06:33,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=78, PETRI_TRANSITIONS=39} [2022-12-13 12:06:33,399 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -5 predicate places. [2022-12-13 12:06:33,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:33,400 INFO L89 Accepts]: Start accepts. Operand has 78 places, 39 transitions, 90 flow [2022-12-13 12:06:33,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:33,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:33,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 39 transitions, 90 flow [2022-12-13 12:06:33,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 90 flow [2022-12-13 12:06:33,410 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 12:06:33,410 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:06:33,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 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-13 12:06:33,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 90 flow [2022-12-13 12:06:33,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-13 12:06:33,725 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:06:33,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 327 [2022-12-13 12:06:33,726 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 90 flow [2022-12-13 12:06:33,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:33,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:33,727 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:33,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:06:33,727 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-13 12:06:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1806317444, now seen corresponding path program 1 times [2022-12-13 12:06:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:33,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281931511] [2022-12-13 12:06:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:33,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:33,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281931511] [2022-12-13 12:06:33,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281931511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:33,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:33,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:06:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844727132] [2022-12-13 12:06:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:33,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:06:33,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:33,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:06:33,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:06:33,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2022-12-13 12:06:33,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:33,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:33,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2022-12-13 12:06:33,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:34,814 INFO L130 PetriNetUnfolder]: 5633/8587 cut-off events. [2022-12-13 12:06:34,815 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2022-12-13 12:06:34,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16823 conditions, 8587 events. 5633/8587 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 56086 event pairs, 1067 based on Foata normal form. 120/6954 useless extension candidates. Maximal degree in co-relation 16813. Up to 6415 conditions per place. [2022-12-13 12:06:34,853 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 42 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2022-12-13 12:06:34,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 220 flow [2022-12-13 12:06:34,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:06:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:06:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 12:06:34,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2022-12-13 12:06:34,855 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 90 flow. Second operand 3 states and 84 transitions. [2022-12-13 12:06:34,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 220 flow [2022-12-13 12:06:34,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:06:34,857 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 94 flow [2022-12-13 12:06:34,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-12-13 12:06:34,858 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2022-12-13 12:06:34,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:34,858 INFO L89 Accepts]: Start accepts. Operand has 51 places, 39 transitions, 94 flow [2022-12-13 12:06:34,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:34,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:34,859 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 94 flow [2022-12-13 12:06:34,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 94 flow [2022-12-13 12:06:34,864 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 12:06:34,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:06:34,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:06:34,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 94 flow [2022-12-13 12:06:34,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 896 [2022-12-13 12:06:34,973 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:06:34,974 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 12:06:34,974 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 94 flow [2022-12-13 12:06:34,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:34,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:34,974 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:34,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:06:34,975 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-13 12:06:34,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:34,975 INFO L85 PathProgramCache]: Analyzing trace with hash -161268062, now seen corresponding path program 1 times [2022-12-13 12:06:34,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:34,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823535608] [2022-12-13 12:06:34,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:34,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:35,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:35,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823535608] [2022-12-13 12:06:35,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823535608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:35,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:35,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:06:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681153337] [2022-12-13 12:06:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:35,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:06:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:06:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:06:35,086 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2022-12-13 12:06:35,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:35,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:35,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2022-12-13 12:06:35,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:35,886 INFO L130 PetriNetUnfolder]: 5336/7783 cut-off events. [2022-12-13 12:06:35,886 INFO L131 PetriNetUnfolder]: For 739/739 co-relation queries the response was YES. [2022-12-13 12:06:35,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16403 conditions, 7783 events. 5336/7783 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 44679 event pairs, 2299 based on Foata normal form. 90/6183 useless extension candidates. Maximal degree in co-relation 16392. Up to 6040 conditions per place. [2022-12-13 12:06:35,917 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 44 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2022-12-13 12:06:35,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 235 flow [2022-12-13 12:06:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:06:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:06:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 12:06:35,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7350427350427351 [2022-12-13 12:06:35,919 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 94 flow. Second operand 3 states and 86 transitions. [2022-12-13 12:06:35,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 235 flow [2022-12-13 12:06:35,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:06:35,920 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 98 flow [2022-12-13 12:06:35,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2022-12-13 12:06:35,921 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2022-12-13 12:06:35,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:35,921 INFO L89 Accepts]: Start accepts. Operand has 52 places, 39 transitions, 98 flow [2022-12-13 12:06:35,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:35,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:35,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 39 transitions, 98 flow [2022-12-13 12:06:35,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 39 transitions, 98 flow [2022-12-13 12:06:35,926 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 12:06:35,926 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 12:06:35,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 39 events. 0/39 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 98 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:06:35,927 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 39 transitions, 98 flow [2022-12-13 12:06:35,927 INFO L226 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-13 12:06:35,928 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:06:35,929 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 12:06:35,929 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 98 flow [2022-12-13 12:06:35,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:35,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:35,929 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:35,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:06:35,930 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-13 12:06:35,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1965524506, now seen corresponding path program 1 times [2022-12-13 12:06:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:35,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50155227] [2022-12-13 12:06:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:36,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:36,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50155227] [2022-12-13 12:06:36,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50155227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:36,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:36,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:06:36,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739568034] [2022-12-13 12:06:36,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:36,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:06:36,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:36,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:06:36,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:06:36,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2022-12-13 12:06:36,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:36,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:36,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2022-12-13 12:06:36,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:37,027 INFO L130 PetriNetUnfolder]: 8333/12455 cut-off events. [2022-12-13 12:06:37,028 INFO L131 PetriNetUnfolder]: For 1821/1821 co-relation queries the response was YES. [2022-12-13 12:06:37,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26185 conditions, 12455 events. 8333/12455 cut-off events. For 1821/1821 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 82468 event pairs, 2087 based on Foata normal form. 324/10090 useless extension candidates. Maximal degree in co-relation 26173. Up to 4320 conditions per place. [2022-12-13 12:06:37,073 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 47 selfloop transitions, 3 changer transitions 5/67 dead transitions. [2022-12-13 12:06:37,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 269 flow [2022-12-13 12:06:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:06:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:06:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-12-13 12:06:37,074 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2022-12-13 12:06:37,075 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 98 flow. Second operand 4 states and 105 transitions. [2022-12-13 12:06:37,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 269 flow [2022-12-13 12:06:37,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:06:37,077 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 108 flow [2022-12-13 12:06:37,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2022-12-13 12:06:37,078 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -28 predicate places. [2022-12-13 12:06:37,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:37,078 INFO L89 Accepts]: Start accepts. Operand has 55 places, 39 transitions, 108 flow [2022-12-13 12:06:37,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:37,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:37,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 39 transitions, 108 flow [2022-12-13 12:06:37,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 39 transitions, 108 flow [2022-12-13 12:06:37,085 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 12:06:37,086 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 12:06:37,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 39 events. 0/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 97 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:06:37,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 39 transitions, 108 flow [2022-12-13 12:06:37,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 786 [2022-12-13 12:06:38,069 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:06:38,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 992 [2022-12-13 12:06:38,070 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 106 flow [2022-12-13 12:06:38,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:38,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:38,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:38,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:06:38,070 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-13 12:06:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1440486226, now seen corresponding path program 1 times [2022-12-13 12:06:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:38,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597166043] [2022-12-13 12:06:38,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:38,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:38,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597166043] [2022-12-13 12:06:38,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597166043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:38,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:38,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:06:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985959412] [2022-12-13 12:06:38,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:38,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:06:38,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:38,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:06:38,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:06:38,315 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2022-12-13 12:06:38,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:38,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:38,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2022-12-13 12:06:38,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:38,717 INFO L130 PetriNetUnfolder]: 3932/5573 cut-off events. [2022-12-13 12:06:38,718 INFO L131 PetriNetUnfolder]: For 2580/2580 co-relation queries the response was YES. [2022-12-13 12:06:38,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13084 conditions, 5573 events. 3932/5573 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 30024 event pairs, 1046 based on Foata normal form. 36/4275 useless extension candidates. Maximal degree in co-relation 13070. Up to 4775 conditions per place. [2022-12-13 12:06:38,741 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 38 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2022-12-13 12:06:38,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 225 flow [2022-12-13 12:06:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:06:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:06:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 12:06:38,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6754385964912281 [2022-12-13 12:06:38,742 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 106 flow. Second operand 3 states and 77 transitions. [2022-12-13 12:06:38,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 225 flow [2022-12-13 12:06:38,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 208 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 12:06:38,745 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 102 flow [2022-12-13 12:06:38,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2022-12-13 12:06:38,746 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -30 predicate places. [2022-12-13 12:06:38,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:38,746 INFO L89 Accepts]: Start accepts. Operand has 53 places, 38 transitions, 102 flow [2022-12-13 12:06:38,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:38,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:38,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 38 transitions, 102 flow [2022-12-13 12:06:38,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 102 flow [2022-12-13 12:06:38,751 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-13 12:06:38,751 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:06:38,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 38 events. 0/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:06:38,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 102 flow [2022-12-13 12:06:38,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 12:06:38,774 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:06:38,775 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 12:06:38,775 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 102 flow [2022-12-13 12:06:38,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:38,775 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:38,775 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:38,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:06:38,775 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-13 12:06:38,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1709408959, now seen corresponding path program 1 times [2022-12-13 12:06:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:38,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955587950] [2022-12-13 12:06:38,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:38,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:38,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955587950] [2022-12-13 12:06:38,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955587950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:38,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:38,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:06:38,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031503973] [2022-12-13 12:06:38,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:38,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:06:38,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:38,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:06:38,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:06:38,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2022-12-13 12:06:38,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:38,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:38,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2022-12-13 12:06:38,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:39,617 INFO L130 PetriNetUnfolder]: 6901/10102 cut-off events. [2022-12-13 12:06:39,617 INFO L131 PetriNetUnfolder]: For 3117/3117 co-relation queries the response was YES. [2022-12-13 12:06:39,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21757 conditions, 10102 events. 6901/10102 cut-off events. For 3117/3117 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 62770 event pairs, 1691 based on Foata normal form. 240/7980 useless extension candidates. Maximal degree in co-relation 21744. Up to 3690 conditions per place. [2022-12-13 12:06:39,650 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 50 selfloop transitions, 3 changer transitions 9/73 dead transitions. [2022-12-13 12:06:39,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 311 flow [2022-12-13 12:06:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:06:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:06:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-12-13 12:06:39,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2022-12-13 12:06:39,651 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 102 flow. Second operand 4 states and 108 transitions. [2022-12-13 12:06:39,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 311 flow [2022-12-13 12:06:39,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:06:39,653 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 112 flow [2022-12-13 12:06:39,654 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2022-12-13 12:06:39,654 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -27 predicate places. [2022-12-13 12:06:39,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:39,654 INFO L89 Accepts]: Start accepts. Operand has 56 places, 38 transitions, 112 flow [2022-12-13 12:06:39,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:39,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:39,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 38 transitions, 112 flow [2022-12-13 12:06:39,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 38 transitions, 112 flow [2022-12-13 12:06:39,659 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-13 12:06:39,659 INFO L131 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2022-12-13 12:06:39,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 38 events. 0/38 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 107 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:06:39,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 38 transitions, 112 flow [2022-12-13 12:06:39,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 710 [2022-12-13 12:06:39,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:06:39,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 12:06:39,697 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 110 flow [2022-12-13 12:06:39,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:39,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:39,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:39,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:06:39,697 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-13 12:06:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1043575304, now seen corresponding path program 1 times [2022-12-13 12:06:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:39,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088004702] [2022-12-13 12:06:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088004702] [2022-12-13 12:06:39,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088004702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:39,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:39,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:06:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053529839] [2022-12-13 12:06:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:39,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:06:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:06:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:06:39,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 12:06:39,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:39,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:39,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 12:06:39,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:40,494 INFO L130 PetriNetUnfolder]: 5445/7960 cut-off events. [2022-12-13 12:06:40,494 INFO L131 PetriNetUnfolder]: For 6567/6567 co-relation queries the response was YES. [2022-12-13 12:06:40,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17833 conditions, 7960 events. 5445/7960 cut-off events. For 6567/6567 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 42158 event pairs, 1899 based on Foata normal form. 240/6197 useless extension candidates. Maximal degree in co-relation 17818. Up to 3058 conditions per place. [2022-12-13 12:06:40,510 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 36 selfloop transitions, 3 changer transitions 17/64 dead transitions. [2022-12-13 12:06:40,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 285 flow [2022-12-13 12:06:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:06:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:06:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 12:06:40,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-13 12:06:40,511 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 110 flow. Second operand 4 states and 96 transitions. [2022-12-13 12:06:40,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 285 flow [2022-12-13 12:06:40,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 261 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 12:06:40,514 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 104 flow [2022-12-13 12:06:40,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2022-12-13 12:06:40,515 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -28 predicate places. [2022-12-13 12:06:40,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:40,515 INFO L89 Accepts]: Start accepts. Operand has 55 places, 35 transitions, 104 flow [2022-12-13 12:06:40,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:40,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:40,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 35 transitions, 104 flow [2022-12-13 12:06:40,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 35 transitions, 104 flow [2022-12-13 12:06:40,520 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 12:06:40,520 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 12:06:40,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 35 events. 0/35 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 59 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:06:40,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 35 transitions, 104 flow [2022-12-13 12:06:40,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 12:06:40,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:06:40,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 12:06:40,548 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 102 flow [2022-12-13 12:06:40,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:40,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:40,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:40,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:06:40,549 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-13 12:06:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2042847260, now seen corresponding path program 1 times [2022-12-13 12:06:40,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:40,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658865444] [2022-12-13 12:06:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:40,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:41,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:41,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658865444] [2022-12-13 12:06:41,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658865444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:41,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:41,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:06:41,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008290854] [2022-12-13 12:06:41,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:41,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:06:41,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:41,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:06:41,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:06:41,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 12:06:41,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 102 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:41,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:41,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 12:06:41,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:41,818 INFO L130 PetriNetUnfolder]: 2279/3349 cut-off events. [2022-12-13 12:06:41,819 INFO L131 PetriNetUnfolder]: For 2019/2019 co-relation queries the response was YES. [2022-12-13 12:06:41,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7469 conditions, 3349 events. 2279/3349 cut-off events. For 2019/2019 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 16177 event pairs, 486 based on Foata normal form. 18/2440 useless extension candidates. Maximal degree in co-relation 7455. Up to 2920 conditions per place. [2022-12-13 12:06:41,829 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2022-12-13 12:06:41,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 250 flow [2022-12-13 12:06:41,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:06:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:06:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-13 12:06:41,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5235294117647059 [2022-12-13 12:06:41,830 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 102 flow. Second operand 5 states and 89 transitions. [2022-12-13 12:06:41,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 250 flow [2022-12-13 12:06:41,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 228 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 12:06:41,833 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 129 flow [2022-12-13 12:06:41,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2022-12-13 12:06:41,833 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -30 predicate places. [2022-12-13 12:06:41,833 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:41,834 INFO L89 Accepts]: Start accepts. Operand has 53 places, 39 transitions, 129 flow [2022-12-13 12:06:41,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:41,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:41,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 39 transitions, 129 flow [2022-12-13 12:06:41,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 39 transitions, 129 flow [2022-12-13 12:06:41,842 INFO L130 PetriNetUnfolder]: 11/65 cut-off events. [2022-12-13 12:06:41,842 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-13 12:06:41,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 65 events. 11/65 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 204 event pairs, 4 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 121. Up to 21 conditions per place. [2022-12-13 12:06:41,842 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 39 transitions, 129 flow [2022-12-13 12:06:41,842 INFO L226 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-13 12:06:44,869 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-13 12:06:45,258 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-13 12:06:46,181 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:06:46,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4350 [2022-12-13 12:06:46,183 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 141 flow [2022-12-13 12:06:46,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:46,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:46,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:46,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:06:46,185 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-13 12:06:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1890682317, now seen corresponding path program 1 times [2022-12-13 12:06:46,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:46,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051793235] [2022-12-13 12:06:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:47,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:47,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051793235] [2022-12-13 12:06:47,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051793235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:47,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:47,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:06:47,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749366588] [2022-12-13 12:06:47,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:47,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:06:47,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:06:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:06:47,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-13 12:06:47,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:47,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:47,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-13 12:06:47,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:47,705 INFO L130 PetriNetUnfolder]: 2306/3385 cut-off events. [2022-12-13 12:06:47,705 INFO L131 PetriNetUnfolder]: For 1762/1762 co-relation queries the response was YES. [2022-12-13 12:06:47,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8175 conditions, 3385 events. 2306/3385 cut-off events. For 1762/1762 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 16260 event pairs, 675 based on Foata normal form. 54/2473 useless extension candidates. Maximal degree in co-relation 8162. Up to 2158 conditions per place. [2022-12-13 12:06:47,719 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 40 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-13 12:06:47,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 285 flow [2022-12-13 12:06:47,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:06:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:06:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 12:06:47,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4789473684210526 [2022-12-13 12:06:47,720 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 141 flow. Second operand 5 states and 91 transitions. [2022-12-13 12:06:47,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 285 flow [2022-12-13 12:06:47,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 280 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 12:06:47,722 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 179 flow [2022-12-13 12:06:47,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2022-12-13 12:06:47,723 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2022-12-13 12:06:47,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:47,723 INFO L89 Accepts]: Start accepts. Operand has 57 places, 40 transitions, 179 flow [2022-12-13 12:06:47,724 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:47,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:47,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 40 transitions, 179 flow [2022-12-13 12:06:47,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 40 transitions, 179 flow [2022-12-13 12:06:47,735 INFO L130 PetriNetUnfolder]: 11/73 cut-off events. [2022-12-13 12:06:47,735 INFO L131 PetriNetUnfolder]: For 70/71 co-relation queries the response was YES. [2022-12-13 12:06:47,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 73 events. 11/73 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 271 event pairs, 4 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 177. Up to 22 conditions per place. [2022-12-13 12:06:47,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 40 transitions, 179 flow [2022-12-13 12:06:47,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 12:06:48,059 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-13 12:06:48,924 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:06:48,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1202 [2022-12-13 12:06:48,925 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 181 flow [2022-12-13 12:06:48,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:48,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:48,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:48,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:06:48,926 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-13 12:06:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash -148737646, now seen corresponding path program 1 times [2022-12-13 12:06:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:48,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594832418] [2022-12-13 12:06:48,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:48,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:49,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-13 12:06:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:49,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594832418] [2022-12-13 12:06:49,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594832418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:49,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:49,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:06:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764765259] [2022-12-13 12:06:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:49,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:06:49,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:49,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:06:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:06:49,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-13 12:06:49,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:49,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:49,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-13 12:06:49,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:49,941 INFO L130 PetriNetUnfolder]: 1817/2599 cut-off events. [2022-12-13 12:06:49,941 INFO L131 PetriNetUnfolder]: For 4697/4697 co-relation queries the response was YES. [2022-12-13 12:06:49,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7706 conditions, 2599 events. 1817/2599 cut-off events. For 4697/4697 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 11482 event pairs, 1275 based on Foata normal form. 9/1831 useless extension candidates. Maximal degree in co-relation 7690. Up to 2452 conditions per place. [2022-12-13 12:06:49,951 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 40 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2022-12-13 12:06:49,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 372 flow [2022-12-13 12:06:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:06:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:06:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 12:06:49,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4789473684210526 [2022-12-13 12:06:49,958 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 181 flow. Second operand 5 states and 91 transitions. [2022-12-13 12:06:49,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 372 flow [2022-12-13 12:06:49,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 317 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 12:06:49,975 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 237 flow [2022-12-13 12:06:49,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2022-12-13 12:06:49,977 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2022-12-13 12:06:49,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:49,977 INFO L89 Accepts]: Start accepts. Operand has 57 places, 46 transitions, 237 flow [2022-12-13 12:06:49,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:49,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:49,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 237 flow [2022-12-13 12:06:49,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 237 flow [2022-12-13 12:06:49,987 INFO L130 PetriNetUnfolder]: 14/73 cut-off events. [2022-12-13 12:06:49,987 INFO L131 PetriNetUnfolder]: For 80/86 co-relation queries the response was YES. [2022-12-13 12:06:49,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 73 events. 14/73 cut-off events. For 80/86 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 259 event pairs, 1 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 177. Up to 22 conditions per place. [2022-12-13 12:06:49,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 237 flow [2022-12-13 12:06:49,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-13 12:06:50,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [878] $Ultimate##0-->L893: Formula: (let ((.cse2 (= (mod v_~z$r_buff0_thd0~0_168 256) 0))) (let ((.cse3 (not .cse2)) (.cse5 (not (= (mod v_~z$w_buff0_used~0_474 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff0_used~0_475 256) 0)) (.cse0 (and .cse3 .cse5)) (.cse1 (select |v_#memory_int_516| |v_~#z~0.base_240|))) (and (= v_~z$w_buff0~0_277 1) (= v_~z$r_buff0_thd0~0_167 (ite .cse0 0 v_~z$r_buff0_thd0~0_168)) (or (and (= |v_ULTIMATE.start_main_#t~ite34#1_165| |v_ULTIMATE.start_main_#t~mem33#1_170|) (= |v_ULTIMATE.start_main_#t~ite34#1_165| |v_ULTIMATE.start_main_#t~ite35#1_131|) (= (select .cse1 |v_~#z~0.offset_240|) |v_ULTIMATE.start_main_#t~mem33#1_170|) .cse2) (and (= v_~z$w_buff0~0_277 |v_ULTIMATE.start_main_#t~ite35#1_131|) (= |v_ULTIMATE.start_main_#t~mem33#1_172| |v_ULTIMATE.start_main_#t~mem33#1_170|) (= |v_ULTIMATE.start_main_#t~ite34#1_167| |v_ULTIMATE.start_main_#t~ite34#1_165|) .cse3)) (= v_~z$r_buff0_thd4~0_271 v_~z$r_buff1_thd4~0_264) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_19| |v_P2Thread1of1ForFork3_~arg#1.offset_19|) (= (ite .cse4 1 0) |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_49|) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_49| 0)) (= v_~z$w_buff1_used~0_415 (ite (or (and (not .cse4) .cse3) .cse0) 0 v_~z$w_buff0_used~0_475)) (= (store |v_#memory_int_516| |v_~#z~0.base_240| (store .cse1 |v_~#z~0.offset_240| |v_ULTIMATE.start_main_#t~ite35#1_131|)) |v_#memory_int_515|) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_49| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_49|) (= (ite .cse3 0 1) v_~z$w_buff0_used~0_474) (= v_~z$r_buff0_thd3~0_187 1) (= v_~z$w_buff0~0_278 v_~z$w_buff1~0_240) (= v_~y~0_49 v_~__unbuffered_p2_EAX~0_116) (= v_~z$r_buff1_thd0~0_170 (ite (or (and .cse5 (not (= (mod v_~z$r_buff0_thd0~0_167 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_415 256) 0)) .cse3)) 0 v_~z$r_buff0_thd0~0_168)) (= v_~z$r_buff0_thd1~0_73 v_~z$r_buff1_thd1~0_75) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_19| |v_P2Thread1of1ForFork3_~arg#1.base_19|) (= v_~z$r_buff0_thd2~0_75 v_~z$r_buff1_thd2~0_75) (= v_~z$r_buff0_thd3~0_188 v_~z$r_buff1_thd3~0_132))))) InVars {~#z~0.base=|v_~#z~0.base_240|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_167|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_475, ~z$w_buff0~0=v_~z$w_buff0~0_278, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_19|, ~#z~0.offset=|v_~#z~0.offset_240|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_168, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_172|, #memory_int=|v_#memory_int_516|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_271, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_188, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_75, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_19|} OutVars{~#z~0.base=|v_~#z~0.base_240|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_264, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_75, ~z$w_buff1~0=v_~z$w_buff1~0_240, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_130|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_271, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_116, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_75, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_474, ~z$w_buff0~0=v_~z$w_buff0~0_277, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_19|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_19|, ~#z~0.offset=|v_~#z~0.offset_240|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_75, #memory_int=|v_#memory_int_515|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_187, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_49|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_49|} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_131|, |v_ULTIMATE.start_main_#t~mem33#1_170|, |v_ULTIMATE.start_main_#t~ite34#1_165|] AssignedVars[~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, 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, P2Thread1of1ForFork3_~arg#1.base, ~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, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] 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-13 12:06:50,998 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [878] $Ultimate##0-->L893: Formula: (let ((.cse2 (= (mod v_~z$r_buff0_thd0~0_168 256) 0))) (let ((.cse3 (not .cse2)) (.cse5 (not (= (mod v_~z$w_buff0_used~0_474 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff0_used~0_475 256) 0)) (.cse0 (and .cse3 .cse5)) (.cse1 (select |v_#memory_int_516| |v_~#z~0.base_240|))) (and (= v_~z$w_buff0~0_277 1) (= v_~z$r_buff0_thd0~0_167 (ite .cse0 0 v_~z$r_buff0_thd0~0_168)) (or (and (= |v_ULTIMATE.start_main_#t~ite34#1_165| |v_ULTIMATE.start_main_#t~mem33#1_170|) (= |v_ULTIMATE.start_main_#t~ite34#1_165| |v_ULTIMATE.start_main_#t~ite35#1_131|) (= (select .cse1 |v_~#z~0.offset_240|) |v_ULTIMATE.start_main_#t~mem33#1_170|) .cse2) (and (= v_~z$w_buff0~0_277 |v_ULTIMATE.start_main_#t~ite35#1_131|) (= |v_ULTIMATE.start_main_#t~mem33#1_172| |v_ULTIMATE.start_main_#t~mem33#1_170|) (= |v_ULTIMATE.start_main_#t~ite34#1_167| |v_ULTIMATE.start_main_#t~ite34#1_165|) .cse3)) (= v_~z$r_buff0_thd4~0_271 v_~z$r_buff1_thd4~0_264) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_19| |v_P2Thread1of1ForFork3_~arg#1.offset_19|) (= (ite .cse4 1 0) |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_49|) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_49| 0)) (= v_~z$w_buff1_used~0_415 (ite (or (and (not .cse4) .cse3) .cse0) 0 v_~z$w_buff0_used~0_475)) (= (store |v_#memory_int_516| |v_~#z~0.base_240| (store .cse1 |v_~#z~0.offset_240| |v_ULTIMATE.start_main_#t~ite35#1_131|)) |v_#memory_int_515|) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_49| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_49|) (= (ite .cse3 0 1) v_~z$w_buff0_used~0_474) (= v_~z$r_buff0_thd3~0_187 1) (= v_~z$w_buff0~0_278 v_~z$w_buff1~0_240) (= v_~y~0_49 v_~__unbuffered_p2_EAX~0_116) (= v_~z$r_buff1_thd0~0_170 (ite (or (and .cse5 (not (= (mod v_~z$r_buff0_thd0~0_167 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_415 256) 0)) .cse3)) 0 v_~z$r_buff0_thd0~0_168)) (= v_~z$r_buff0_thd1~0_73 v_~z$r_buff1_thd1~0_75) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_19| |v_P2Thread1of1ForFork3_~arg#1.base_19|) (= v_~z$r_buff0_thd2~0_75 v_~z$r_buff1_thd2~0_75) (= v_~z$r_buff0_thd3~0_188 v_~z$r_buff1_thd3~0_132))))) InVars {~#z~0.base=|v_~#z~0.base_240|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_167|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_475, ~z$w_buff0~0=v_~z$w_buff0~0_278, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_19|, ~#z~0.offset=|v_~#z~0.offset_240|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_168, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_172|, #memory_int=|v_#memory_int_516|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_271, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_188, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_75, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_19|} OutVars{~#z~0.base=|v_~#z~0.base_240|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_264, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_75, ~z$w_buff1~0=v_~z$w_buff1~0_240, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_130|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_271, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_116, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_75, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_474, ~z$w_buff0~0=v_~z$w_buff0~0_277, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_19|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_19|, ~#z~0.offset=|v_~#z~0.offset_240|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_75, #memory_int=|v_#memory_int_515|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_187, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_49|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_49|} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_131|, |v_ULTIMATE.start_main_#t~mem33#1_170|, |v_ULTIMATE.start_main_#t~ite34#1_165|] AssignedVars[~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, 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, P2Thread1of1ForFork3_~arg#1.base, ~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, ~__unbuffered_p2_EAX~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-13 12:06:52,096 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [884] $Ultimate##0-->L822: Formula: (let ((.cse7 (= (mod v_~z$r_buff0_thd0~0_186 256) 0))) (let ((.cse4 (not .cse7))) (let ((.cse2 (ite .cse4 0 1))) (let ((.cse1 (= (mod .cse2 256) 0))) (let ((.cse0 (not .cse1))) (let ((.cse11 (= (mod v_~z$w_buff0_used~0_510 256) 0)) (.cse8 (and .cse0 .cse4))) (let ((.cse10 (ite (or (and (not .cse11) .cse4) .cse8) 0 v_~z$w_buff0_used~0_510))) (let ((.cse6 (select |v_#memory_int_547| |v_~#z~0.base_254|)) (.cse9 (not (= (mod v_~z$r_buff0_thd3~0_219 256) 0))) (.cse3 (not (= (mod .cse10 256) 0))) (.cse5 (not (= (mod v_~z$w_buff0_used~0_508 256) 0)))) (and (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_61| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_61|) (or (and (= |v_P2Thread1of1ForFork3_#t~ite4#1_46| |v_P2_#t~ite4#1_52|) (= v_~z$w_buff0~0_303 |v_P2_#t~ite5#1_52|) (= |v_P2Thread1of1ForFork3_#t~mem3#1_46| |v_P2_#t~mem3#1_51|) .cse0) (and (= |v_P2_#t~ite4#1_52| |v_P2_#t~ite5#1_52|) (= |v_P2_#t~mem3#1_51| |v_P2_#t~ite4#1_52|) .cse1 (= |v_ULTIMATE.start_main_#t~ite35#1_147| |v_P2_#t~mem3#1_51|))) (= v_~z$w_buff0_used~0_508 (ite .cse0 0 .cse2)) (= v_~z$r_buff1_thd0~0_184 (ite (or (and .cse3 .cse4) (and (not (= (mod v_~z$r_buff0_thd0~0_185 256) 0)) .cse0)) 0 v_~z$r_buff0_thd0~0_186)) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_27| |v_P2Thread1of1ForFork3_~arg#1.offset_27|) (= v_~z$r_buff0_thd2~0_87 v_~z$r_buff1_thd2~0_87) (= v_~z$w_buff0~0_304 v_~z$w_buff1~0_254) (= v_~z$r_buff0_thd4~0_289 v_~z$r_buff1_thd4~0_280) (= v_~z$w_buff0~0_303 1) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_61| 0)) (= (ite .cse5 0 1) v_~z$r_buff0_thd3~0_217) (or (and (= v_~z$w_buff0~0_303 |v_ULTIMATE.start_main_#t~ite35#1_147|) (= |v_ULTIMATE.start_main_#t~mem33#1_194| |v_ULTIMATE.start_main_#t~mem33#1_192|) .cse4 (= |v_ULTIMATE.start_main_#t~ite34#1_189| |v_ULTIMATE.start_main_#t~ite34#1_187|)) (and (= |v_ULTIMATE.start_main_#t~ite34#1_187| |v_ULTIMATE.start_main_#t~ite35#1_147|) (= (select .cse6 |v_~#z~0.offset_254|) |v_ULTIMATE.start_main_#t~mem33#1_192|) .cse7 (= |v_ULTIMATE.start_main_#t~ite34#1_187| |v_ULTIMATE.start_main_#t~mem33#1_192|))) (= (store |v_#memory_int_547| |v_~#z~0.base_254| (store .cse6 |v_~#z~0.offset_254| |v_P2_#t~ite5#1_52|)) |v_#memory_int_545|) (= v_~z$r_buff0_thd0~0_185 (ite .cse8 0 v_~z$r_buff0_thd0~0_186)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_217 256) 0)) .cse5) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_437 256) 0)))) 0 v_~z$r_buff0_thd3~0_219) v_~z$r_buff1_thd3~0_150) (= v_~y~0_57 v_~__unbuffered_p2_EAX~0_124) (= (ite (or (and .cse9 .cse3) .cse5) 0 .cse10) v_~z$w_buff1_used~0_437) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_61| (ite .cse11 1 0)) (= v_~z$r_buff0_thd1~0_85 v_~z$r_buff1_thd1~0_87) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_27| |v_P2Thread1of1ForFork3_~arg#1.base_27|)))))))))) InVars {~#z~0.base=|v_~#z~0.base_254|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_189|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_510, ~z$w_buff0~0=v_~z$w_buff0~0_304, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_27|, P2Thread1of1ForFork3_#t~mem3#1=|v_P2Thread1of1ForFork3_#t~mem3#1_46|, ~#z~0.offset=|v_~#z~0.offset_254|, P2Thread1of1ForFork3_#t~ite4#1=|v_P2Thread1of1ForFork3_#t~ite4#1_46|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_186, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_194|, #memory_int=|v_#memory_int_547|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_289, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_219, ~y~0=v_~y~0_57, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_85, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_87, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_27|} OutVars{~#z~0.base=|v_~#z~0.base_254|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_280, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_254, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_146|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_185, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_184, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_289, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_124, ~y~0=v_~y~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_87, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_508, ~z$w_buff0~0=v_~z$w_buff0~0_303, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_150, P2Thread1of1ForFork3_#t~ite5#1=|v_P2Thread1of1ForFork3_#t~ite5#1_27|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_437, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_27|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_27|, ~#z~0.offset=|v_~#z~0.offset_254|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_87, #memory_int=|v_#memory_int_545|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_217, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_61|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_85, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_61|} AuxVars[|v_P2_#t~ite5#1_52|, |v_ULTIMATE.start_main_#t~mem33#1_192|, |v_P2_#t~mem3#1_51|, |v_P2_#t~ite4#1_52|, |v_ULTIMATE.start_main_#t~ite34#1_187|, |v_ULTIMATE.start_main_#t~ite35#1_147|] AssignedVars[~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, 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, P2Thread1of1ForFork3_#t~ite5#1, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~mem3#1, P2Thread1of1ForFork3_#t~ite4#1, 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, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] and [799] L893-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (let ((.cse0 (= (mod v_~__unbuffered_p3_EAX$read_delayed~0_63 256) 0)) (.cse2 (= |v_ULTIMATE.start_main_#t~mem37#1_129| |v_ULTIMATE.start_main_#t~mem37#1_127|))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~ite38#1_122| v_~__unbuffered_p3_EAX~0_113) (let ((.cse1 (= (mod v_~weak$$choice1~0_100 256) 0))) (or (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite38#1_122| |v_ULTIMATE.start_main_#t~mem37#1_127|) (= |v_ULTIMATE.start_main_#t~mem37#1_127| (select (select |v_#memory_int_286| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_68) v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_68))) (and .cse1 (= |v_ULTIMATE.start_main_#t~ite38#1_122| v_~__unbuffered_p3_EAX~0_114) .cse2)))) (and (= v_~__unbuffered_p3_EAX~0_114 v_~__unbuffered_p3_EAX~0_113) (= |v_ULTIMATE.start_main_#t~ite38#1_124| |v_ULTIMATE.start_main_#t~ite38#1_122|) .cse0 .cse2))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= v_~weak$$choice1~0_100 |v_ULTIMATE.start_main_#t~nondet36#1_79|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_50 1) (= v_~__unbuffered_p3_EAX~0_113 1) (= v_~__unbuffered_p2_EAX~0_47 1) (= v_~__unbuffered_p0_EAX~0_48 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_63, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_79|, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_68, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_114, #memory_int=|v_#memory_int_286|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_124|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_129|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ULTIMATE.start_main_#t~ite39#1=|v_ULTIMATE.start_main_#t~ite39#1_58|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ~weak$$choice1~0=v_~weak$$choice1~0_100, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_68, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_63, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_68, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_113, #memory_int=|v_#memory_int_286|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47} AuxVars[|v_ULTIMATE.start_main_#t~ite38#1_122|, |v_ULTIMATE.start_main_#t~mem37#1_127|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~weak$$choice1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet36#1, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_#t~ite38#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite39#1, ULTIMATE.start_main_#t~mem37#1] [2022-12-13 12:06:52,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [885] $Ultimate##0-->L858: Formula: (let ((.cse11 (= (mod v_~z$r_buff0_thd0~0_190 256) 0))) (let ((.cse10 (not .cse11))) (let ((.cse2 (ite .cse10 0 1))) (let ((.cse5 (= (mod .cse2 256) 0))) (let ((.cse1 (not .cse5))) (let ((.cse4 (= (mod v_~z$r_buff0_thd4~0_292 256) 0)) (.cse12 (and .cse10 .cse1)) (.cse13 (= (mod v_~z$w_buff0_used~0_516 256) 0))) (let ((.cse8 (ite (or .cse12 (and (not .cse13) .cse10)) 0 v_~z$w_buff0_used~0_516)) (.cse9 (not (= (mod v_~z$w_buff0_used~0_514 256) 0))) (.cse0 (not .cse4))) (let ((.cse7 (and .cse9 .cse0)) (.cse6 (not (= (mod .cse8 256) 0))) (.cse3 (select |v_#memory_int_553| |v_~#z~0.base_256|))) (and (= v_~z$w_buff0_used~0_514 (ite (and .cse0 .cse1) 0 .cse2)) (= (store |v_#memory_int_553| |v_~#z~0.base_256| (store .cse3 |v_~#z~0.offset_256| |v_P3_#t~ite24_57|)) |v_#memory_int_551|) (or (and (= |v_P3_#t~ite23_67| |v_P3_#t~mem22_70|) (= |v_ULTIMATE.start_main_#t~ite35#1_151| |v_P3_#t~mem22_70|) (or .cse4 .cse5) (= |v_P3_#t~ite23_67| |v_P3_#t~ite24_57|)) (and (= |v_P3_#t~ite23_67| |v_P3Thread1of1ForFork1_#t~ite23_64|) (= |v_P3Thread1of1ForFork1_#t~mem22_64| |v_P3_#t~mem22_70|) .cse0 (= |v_P3_#t~ite24_57| v_~z$w_buff0~0_307) .cse1)) (= v_~z$w_buff0~0_308 v_~z$w_buff1~0_256) (= v_~z$r_buff0_thd3~0_223 1) (= v_~z$r_buff0_thd1~0_87 v_~z$r_buff1_thd1~0_89) (= v_~z$w_buff1_used~0_441 (ite (or (and .cse6 .cse0) .cse7) 0 .cse8)) (= v_~z$r_buff0_thd3~0_224 v_~z$r_buff1_thd3~0_154) (= (ite .cse7 0 v_~z$r_buff0_thd4~0_292) v_~z$r_buff0_thd4~0_291) (= v_~z$r_buff0_thd2~0_89 v_~z$r_buff1_thd2~0_89) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_441 256) 0)) .cse0) (and .cse9 (not (= (mod v_~z$r_buff0_thd4~0_291 256) 0)))) 0 v_~z$r_buff0_thd4~0_292) v_~z$r_buff1_thd4~0_282) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_29| |v_P2Thread1of1ForFork3_~arg#1.base_29|) (= v_~z$w_buff0~0_307 1) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_29| |v_P2Thread1of1ForFork3_~arg#1.offset_29|) (= v_~z$r_buff1_thd0~0_186 (ite (or (and .cse6 .cse10) (and (not (= (mod v_~z$r_buff0_thd0~0_189 256) 0)) .cse1)) 0 v_~z$r_buff0_thd0~0_190)) (or (and (= |v_ULTIMATE.start_main_#t~mem33#1_200| |v_ULTIMATE.start_main_#t~mem33#1_198|) (= |v_ULTIMATE.start_main_#t~ite34#1_195| |v_ULTIMATE.start_main_#t~ite34#1_193|) .cse10 (= v_~z$w_buff0~0_307 |v_ULTIMATE.start_main_#t~ite35#1_151|)) (and .cse11 (= |v_ULTIMATE.start_main_#t~ite34#1_193| |v_ULTIMATE.start_main_#t~ite35#1_151|) (= (select .cse3 |v_~#z~0.offset_256|) |v_ULTIMATE.start_main_#t~mem33#1_198|) (= |v_ULTIMATE.start_main_#t~ite34#1_193| |v_ULTIMATE.start_main_#t~mem33#1_198|))) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_63| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_63|) (= v_~y~0_59 v_~__unbuffered_p2_EAX~0_126) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_63| 0)) (= v_~z$r_buff0_thd0~0_189 (ite .cse12 0 v_~z$r_buff0_thd0~0_190)) (= (ite .cse13 1 0) |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_63|)))))))))) InVars {~#z~0.base=|v_~#z~0.base_256|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_195|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_516, ~z$w_buff0~0=v_~z$w_buff0~0_308, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_29|, ~#z~0.offset=|v_~#z~0.offset_256|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_64|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_200|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_292, #memory_int=|v_#memory_int_553|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_224, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_64|, ~y~0=v_~y~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_29|} OutVars{~#z~0.base=|v_~#z~0.base_256|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_282, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_29|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_256, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_150|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_189, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_186, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_291, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_126, ~y~0=v_~y~0_59, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_441, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_29|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_29|, ~#z~0.offset=|v_~#z~0.offset_256|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_89, #memory_int=|v_#memory_int_551|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_223, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_34|, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_63|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_63|} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_151|, |v_P3_#t~mem22_70|, |v_P3_#t~ite23_67|, |v_ULTIMATE.start_main_#t~mem33#1_198|, |v_ULTIMATE.start_main_#t~ite34#1_193|, |v_P3_#t~ite24_57|] AssignedVars[~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, 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, P2Thread1of1ForFork3_~arg#1.base, ~z$w_buff1~0, P3Thread1of1ForFork1_#t~mem22, 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, ~z$r_buff0_thd4~0, #memory_int, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, P3Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P3Thread1of1ForFork1_#t~ite23, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] and [799] L893-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (let ((.cse0 (= (mod v_~__unbuffered_p3_EAX$read_delayed~0_63 256) 0)) (.cse2 (= |v_ULTIMATE.start_main_#t~mem37#1_129| |v_ULTIMATE.start_main_#t~mem37#1_127|))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~ite38#1_122| v_~__unbuffered_p3_EAX~0_113) (let ((.cse1 (= (mod v_~weak$$choice1~0_100 256) 0))) (or (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite38#1_122| |v_ULTIMATE.start_main_#t~mem37#1_127|) (= |v_ULTIMATE.start_main_#t~mem37#1_127| (select (select |v_#memory_int_286| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_68) v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_68))) (and .cse1 (= |v_ULTIMATE.start_main_#t~ite38#1_122| v_~__unbuffered_p3_EAX~0_114) .cse2)))) (and (= v_~__unbuffered_p3_EAX~0_114 v_~__unbuffered_p3_EAX~0_113) (= |v_ULTIMATE.start_main_#t~ite38#1_124| |v_ULTIMATE.start_main_#t~ite38#1_122|) .cse0 .cse2))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= v_~weak$$choice1~0_100 |v_ULTIMATE.start_main_#t~nondet36#1_79|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_50 1) (= v_~__unbuffered_p3_EAX~0_113 1) (= v_~__unbuffered_p2_EAX~0_47 1) (= v_~__unbuffered_p0_EAX~0_48 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_63, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_79|, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_68, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_114, #memory_int=|v_#memory_int_286|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_124|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_129|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ULTIMATE.start_main_#t~ite39#1=|v_ULTIMATE.start_main_#t~ite39#1_58|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ~weak$$choice1~0=v_~weak$$choice1~0_100, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_68, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_63, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_68, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_113, #memory_int=|v_#memory_int_286|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47} AuxVars[|v_ULTIMATE.start_main_#t~ite38#1_122|, |v_ULTIMATE.start_main_#t~mem37#1_127|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~weak$$choice1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet36#1, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_#t~ite38#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite39#1, ULTIMATE.start_main_#t~mem37#1] [2022-12-13 12:06:53,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] $Ultimate##0-->L858: Formula: (let ((.cse4 (= (mod v_~z$r_buff0_thd4~0_274 256) 0))) (let ((.cse0 (not .cse4)) (.cse5 (not (= (mod v_~z$w_buff0_used~0_478 256) 0)))) (let ((.cse1 (and .cse0 .cse5)) (.cse3 (select |v_#memory_int_520| |v_~#z~0.base_242|)) (.cse2 (= (mod v_~z$w_buff0_used~0_479 256) 0))) (and (= v_~z$r_buff0_thd3~0_192 v_~z$r_buff1_thd3~0_134) (= v_~z$r_buff0_thd0~0_171 v_~z$r_buff1_thd0~0_172) (= v_~z$w_buff0~0_281 1) (= v_~z$r_buff0_thd2~0_77 v_~z$r_buff1_thd2~0_77) (= v_~z$w_buff0_used~0_478 (ite .cse0 0 1)) (= |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_~z$w_buff0~0_282 v_~z$w_buff1~0_242) (= v_~z$r_buff0_thd4~0_273 (ite .cse1 0 v_~z$r_buff0_thd4~0_274)) (= v_~z$w_buff1_used~0_417 (ite (or (and (not .cse2) .cse0) .cse1) 0 v_~z$w_buff0_used~0_479)) (= (store |v_#memory_int_520| |v_~#z~0.base_242| (store .cse3 |v_~#z~0.offset_242| |v_P3_#t~ite24_51|)) |v_#memory_int_519|) (or (and (= |v_P3_#t~ite23_61| |v_P3_#t~mem22_64|) (= |v_P3_#t~ite23_61| |v_P3_#t~ite24_51|) (= |v_P3_#t~mem22_64| (select .cse3 |v_~#z~0.offset_242|)) .cse4) (and (= |v_P3_#t~ite24_51| v_~z$w_buff0~0_281) .cse0 (= |v_P3_#t~ite23_61| |v_P3Thread1of1ForFork1_#t~ite23_56|) (= |v_P3Thread1of1ForFork1_#t~mem22_56| |v_P3_#t~mem22_64|))) (= v_~z$r_buff0_thd3~0_191 1) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_51| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_51|) (= v_~y~0_51 v_~__unbuffered_p2_EAX~0_118) (= (ite .cse2 1 0) |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_51|) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_273 256) 0)) .cse5) (and .cse0 (not (= 0 (mod v_~z$w_buff1_used~0_417 256))))) 0 v_~z$r_buff0_thd4~0_274) v_~z$r_buff1_thd4~0_266) (= v_~z$r_buff0_thd1~0_75 v_~z$r_buff1_thd1~0_77) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_51| 0)))))) InVars {~#z~0.base=|v_~#z~0.base_242|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_479, ~z$w_buff0~0=v_~z$w_buff0~0_282, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_21|, ~#z~0.offset=|v_~#z~0.offset_242|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_56|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_171, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_274, #memory_int=|v_#memory_int_520|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_192, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_56|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_75, ~y~0=v_~y~0_51, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_77, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_21|} OutVars{~#z~0.base=|v_~#z~0.base_242|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_266, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_77, ~z$w_buff1~0=v_~z$w_buff1~0_242, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_172, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_273, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_118, ~y~0=v_~y~0_51, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_77, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_478, ~z$w_buff0~0=v_~z$w_buff0~0_281, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_417, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_21|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_21|, ~#z~0.offset=|v_~#z~0.offset_242|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, #memory_int=|v_#memory_int_519|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_191, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_30|, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_51|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_75, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_51|} AuxVars[|v_P3_#t~mem22_64|, |v_P3_#t~ite24_51|, |v_P3_#t~ite23_61|] AssignedVars[~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, ~z$w_buff1~0, P3Thread1of1ForFork1_#t~mem22, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, #memory_int, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, P3Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P3Thread1of1ForFork1_#t~ite23, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] 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-13 12:06:54,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [887] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_198 256) 0))) (let ((.cse8 (not .cse9))) (let ((.cse12 (ite .cse8 0 1))) (let ((.cse14 (= (mod .cse12 256) 0))) (let ((.cse11 (not .cse14))) (let ((.cse15 (= (mod v_~z$r_buff0_thd4~0_298 256) 0)) (.cse0 (and .cse8 .cse11)) (.cse16 (= (mod v_~z$w_buff0_used~0_525 256) 0))) (let ((.cse4 (ite (or .cse0 (and (not .cse16) .cse8)) 0 v_~z$w_buff0_used~0_525)) (.cse2 (not .cse15)) (.cse13 (not (= (mod v_~z$w_buff0_used~0_524 256) 0)))) (let ((.cse3 (and .cse2 .cse13)) (.cse10 (select |v_#memory_int_562| |v_~#z~0.base_260|)) (.cse1 (not (= (mod .cse4 256) 0)))) (and (= v_~z$r_buff0_thd0~0_197 (ite .cse0 0 v_~z$r_buff0_thd0~0_198)) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_33| |v_P2Thread1of1ForFork3_~arg#1.base_33|) (= v_~z$w_buff1_used~0_447 (ite (or (and .cse1 .cse2) .cse3) 0 .cse4)) (let ((.cse5 (= (mod v_~__unbuffered_p3_EAX$read_delayed~0_140 256) 0)) (.cse7 (= |v_ULTIMATE.start_main_#t~mem37#1_267| |v_ULTIMATE.start_main_#t~mem37#1_265|))) (or (and (not .cse5) (let ((.cse6 (= (mod v_~weak$$choice1~0_170 256) 0))) (or (and (not .cse6) (= |v_ULTIMATE.start_main_#t~ite38#1_260| |v_ULTIMATE.start_main_#t~mem37#1_265|) (= |v_ULTIMATE.start_main_#t~mem37#1_265| (select (select |v_#memory_int_561| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_141) v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_141))) (and (= |v_ULTIMATE.start_main_#t~ite38#1_260| v_~__unbuffered_p3_EAX~0_235) .cse7 .cse6))) (= |v_ULTIMATE.start_main_#t~ite38#1_260| v_~__unbuffered_p3_EAX~0_234)) (and .cse5 (= |v_ULTIMATE.start_main_#t~ite38#1_262| |v_ULTIMATE.start_main_#t~ite38#1_260|) .cse7 (= v_~__unbuffered_p3_EAX~0_235 v_~__unbuffered_p3_EAX~0_234)))) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_33| |v_P2Thread1of1ForFork3_~arg#1.offset_33|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_79|) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_67| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_67|) (= v_~z$r_buff0_thd4~0_297 (ite .cse3 0 v_~z$r_buff0_thd4~0_298)) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite34#1_207| |v_ULTIMATE.start_main_#t~ite34#1_205|) (= |v_ULTIMATE.start_main_#t~mem33#1_212| |v_ULTIMATE.start_main_#t~mem33#1_210|) (= v_~z$w_buff0~0_315 |v_ULTIMATE.start_main_#t~ite35#1_159|)) (and (= |v_ULTIMATE.start_main_#t~ite34#1_205| |v_ULTIMATE.start_main_#t~ite35#1_159|) .cse9 (= |v_ULTIMATE.start_main_#t~ite34#1_205| |v_ULTIMATE.start_main_#t~mem33#1_210|) (= (select .cse10 |v_~#z~0.offset_260|) |v_ULTIMATE.start_main_#t~mem33#1_210|))) (= (ite (and .cse11 .cse2) 0 .cse12) v_~z$w_buff0_used~0_524) (= (store |v_#memory_int_562| |v_~#z~0.base_260| (store .cse10 |v_~#z~0.offset_260| |v_P3_#t~ite24_59|)) |v_#memory_int_561|) (= v_~main$tmp_guard1~0_96 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_130 1) (= v_~__unbuffered_p0_EAX~0_116 1) (= v_~__unbuffered_p1_EAX~0_118 1) (= v_~__unbuffered_p3_EAX~0_234 1))) 1 0) 0) 0 1)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_297 256) 0)) .cse13) (and (not (= (mod v_~z$w_buff1_used~0_447 256) 0)) .cse2)) 0 v_~z$r_buff0_thd4~0_298) v_~z$r_buff1_thd4~0_288) (= v_~z$w_buff0~0_315 1) (= v_~z$r_buff0_thd1~0_91 v_~z$r_buff1_thd1~0_93) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_79| 0) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_67| 0)) (= v_~z$r_buff0_thd2~0_93 v_~z$r_buff1_thd2~0_93) (= v_~z$r_buff1_thd0~0_190 (ite (or (and .cse1 .cse8) (and (not (= (mod v_~z$r_buff0_thd0~0_197 256) 0)) .cse11)) 0 v_~z$r_buff0_thd0~0_198)) (or (and (= |v_P3_#t~ite24_59| v_~z$w_buff0~0_315) .cse11 .cse2 (= |v_P3_#t~ite23_69| |v_P3Thread1of1ForFork1_#t~ite23_68|) (= |v_P3Thread1of1ForFork1_#t~mem22_68| |v_P3_#t~mem22_72|)) (and (= |v_ULTIMATE.start_main_#t~ite35#1_159| |v_P3_#t~mem22_72|) (= |v_P3_#t~ite23_69| |v_P3_#t~ite24_59|) (or .cse14 .cse15) (= |v_P3_#t~ite23_69| |v_P3_#t~mem22_72|))) (= v_~z$r_buff0_thd3~0_231 1) (= v_~z$w_buff0~0_316 v_~z$w_buff1~0_260) (= v_~z$r_buff0_thd3~0_232 v_~z$r_buff1_thd3~0_158) (= v_~weak$$choice1~0_170 |v_ULTIMATE.start_main_#t~nondet36#1_163|) (= v_~y~0_63 v_~__unbuffered_p2_EAX~0_130) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_67| (ite .cse16 1 0)) (= (mod v_~main$tmp_guard1~0_96 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77|)))))))))) InVars {~#z~0.base=|v_~#z~0.base_260|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_198, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_140, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_141, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_235, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_298, ~y~0=v_~y~0_63, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_93, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_33|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_207|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_163|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_525, ~z$w_buff0~0=v_~z$w_buff0~0_316, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_33|, ~#z~0.offset=|v_~#z~0.offset_260|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_68|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_141, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_212|, #memory_int=|v_#memory_int_562|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_262|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_232, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_68|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_91, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_267|} OutVars{~#z~0.base=|v_~#z~0.base_260|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_79|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_288, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_33|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_260, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_96, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_158|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~weak$$choice1~0=v_~weak$$choice1~0_170, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_140, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_190, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_141, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_234, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_297, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_130, ~y~0=v_~y~0_63, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_93, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_33|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_524, ~z$w_buff0~0=v_~z$w_buff0~0_315, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_158, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_447, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_33|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_33|, ULTIMATE.start_main_#t~ite39#1=|v_ULTIMATE.start_main_#t~ite39#1_104|, ~#z~0.offset=|v_~#z~0.offset_260|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_141, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_93, #memory_int=|v_#memory_int_561|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_231, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_36|, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_67|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_91, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_67|} AuxVars[|v_P3_#t~ite24_59|, |v_P3_#t~mem22_72|, |v_P3_#t~ite23_69|, |v_ULTIMATE.start_main_#t~mem33#1_210|, |v_ULTIMATE.start_main_#t~ite35#1_159|, |v_ULTIMATE.start_main_#t~mem37#1_265|, |v_ULTIMATE.start_main_#t~ite38#1_260|, |v_ULTIMATE.start_main_#t~ite34#1_205|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, ~z$r_buff1_thd2~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet36#1, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, ULTIMATE.start_main_#t~ite39#1, P3Thread1of1ForFork1_#t~mem22, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~z$r_buff0_thd3~0, P3Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P3Thread1of1ForFork1_#t~ite23, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem37#1] 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-13 12:06:57,679 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:06:57,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7702 [2022-12-13 12:06:57,679 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 262 flow [2022-12-13 12:06:57,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:57,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:57,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:57,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:06:57,680 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-13 12:06:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:57,680 INFO L85 PathProgramCache]: Analyzing trace with hash -145966928, now seen corresponding path program 1 times [2022-12-13 12:06:57,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:57,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678975831] [2022-12-13 12:06:57,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:57,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:58,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:58,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678975831] [2022-12-13 12:06:58,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678975831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:58,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:58,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:06:58,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208565745] [2022-12-13 12:06:58,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:58,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:06:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:58,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:06:58,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:06:58,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2022-12-13 12:06:58,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:06:58,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:58,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2022-12-13 12:06:58,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:59,045 INFO L130 PetriNetUnfolder]: 1895/2839 cut-off events. [2022-12-13 12:06:59,045 INFO L131 PetriNetUnfolder]: For 2992/2992 co-relation queries the response was YES. [2022-12-13 12:06:59,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7791 conditions, 2839 events. 1895/2839 cut-off events. For 2992/2992 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 14586 event pairs, 168 based on Foata normal form. 27/2032 useless extension candidates. Maximal degree in co-relation 7774. Up to 2314 conditions per place. [2022-12-13 12:06:59,056 INFO L137 encePairwiseOnDemand]: 28/41 looper letters, 43 selfloop transitions, 14 changer transitions 0/65 dead transitions. [2022-12-13 12:06:59,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 432 flow [2022-12-13 12:06:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:06:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:06:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 12:06:59,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47317073170731705 [2022-12-13 12:06:59,057 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 262 flow. Second operand 5 states and 97 transitions. [2022-12-13 12:06:59,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 432 flow [2022-12-13 12:06:59,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 410 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-13 12:06:59,061 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 309 flow [2022-12-13 12:06:59,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2022-12-13 12:06:59,062 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -20 predicate places. [2022-12-13 12:06:59,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:59,062 INFO L89 Accepts]: Start accepts. Operand has 63 places, 49 transitions, 309 flow [2022-12-13 12:06:59,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:59,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:59,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 49 transitions, 309 flow [2022-12-13 12:06:59,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 49 transitions, 309 flow [2022-12-13 12:06:59,074 INFO L130 PetriNetUnfolder]: 13/85 cut-off events. [2022-12-13 12:06:59,074 INFO L131 PetriNetUnfolder]: For 127/131 co-relation queries the response was YES. [2022-12-13 12:06:59,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 85 events. 13/85 cut-off events. For 127/131 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 380 event pairs, 0 based on Foata normal form. 1/58 useless extension candidates. Maximal degree in co-relation 225. Up to 17 conditions per place. [2022-12-13 12:06:59,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 49 transitions, 309 flow [2022-12-13 12:06:59,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-13 12:06:59,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [883] $Ultimate##0-->L893: Formula: (let ((.cse5 (= (mod v_~z$r_buff0_thd0~0_182 256) 0))) (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_498 256) 0))) (.cse2 (not .cse5))) (let ((.cse1 (= (mod v_~z$w_buff0_used~0_499 256) 0)) (.cse0 (and .cse4 .cse2)) (.cse3 (select |v_#memory_int_536| |v_~#z~0.base_250|))) (and (= v_~z$r_buff0_thd2~0_85 v_~z$r_buff1_thd2~0_85) (= v_~z$r_buff0_thd4~0_283 v_~z$r_buff1_thd4~0_274) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_25| |v_P2Thread1of1ForFork3_~arg#1.base_25|) (= (ite (or .cse0 (and (not .cse1) .cse2)) 0 v_~z$w_buff0_used~0_499) v_~z$w_buff1_used~0_429) (= v_~z$w_buff0~0_297 1) (= (store |v_#memory_int_536| |v_~#z~0.base_250| (store .cse3 |v_~#z~0.offset_250| |v_ULTIMATE.start_main_#t~ite35#1_142|)) |v_#memory_int_535|) (= v_~z$r_buff0_thd3~0_209 1) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_59| (ite .cse1 1 0)) (= v_~z$r_buff0_thd0~0_181 (ite .cse0 0 v_~z$r_buff0_thd0~0_182)) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_59| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_59|) (= v_~z$w_buff0_used~0_498 (ite .cse2 0 1)) (= v_~z$w_buff0~0_298 v_~z$w_buff1~0_250) (= v_~z$r_buff1_thd0~0_182 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_429 256) 0)) .cse2) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_181 256) 0)))) 0 v_~z$r_buff0_thd0~0_182)) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_59| 0)) (= v_~z$r_buff0_thd3~0_210 v_~z$r_buff1_thd3~0_144) (= v_~y~0_55 v_~__unbuffered_p2_EAX~0_122) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_25| |v_P2Thread1of1ForFork3_~arg#1.offset_25|) (= v_~z$r_buff0_thd1~0_83 v_~z$r_buff1_thd1~0_85) (or (and (= |v_ULTIMATE.start_main_#t~ite34#1_180| |v_ULTIMATE.start_main_#t~ite35#1_142|) (= |v_ULTIMATE.start_main_#t~ite34#1_180| |v_ULTIMATE.start_main_#t~mem33#1_185|) .cse5 (= (select .cse3 |v_~#z~0.offset_250|) |v_ULTIMATE.start_main_#t~mem33#1_185|)) (and (= |v_ULTIMATE.start_main_#t~mem33#1_187| |v_ULTIMATE.start_main_#t~mem33#1_185|) (= |v_ULTIMATE.start_main_#t~ite34#1_182| |v_ULTIMATE.start_main_#t~ite34#1_180|) (= v_~z$w_buff0~0_297 |v_ULTIMATE.start_main_#t~ite35#1_142|) .cse2)))))) InVars {~#z~0.base=|v_~#z~0.base_250|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_182|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_499, ~z$w_buff0~0=v_~z$w_buff0~0_298, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_25|, ~#z~0.offset=|v_~#z~0.offset_250|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_182, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_187|, #memory_int=|v_#memory_int_536|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_283, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_210, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_83, ~y~0=v_~y~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_85, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_25|} OutVars{~#z~0.base=|v_~#z~0.base_250|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_274, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_25|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_85, ~z$w_buff1~0=v_~z$w_buff1~0_250, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_141|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_283, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_122, ~y~0=v_~y~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_85, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_25|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_498, ~z$w_buff0~0=v_~z$w_buff0~0_297, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_144, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_429, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_25|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_25|, ~#z~0.offset=|v_~#z~0.offset_250|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_85, #memory_int=|v_#memory_int_535|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_209, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_59|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_83, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_59|} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_142|, |v_ULTIMATE.start_main_#t~ite34#1_180|, |v_ULTIMATE.start_main_#t~mem33#1_185|] AssignedVars[~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, 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, P2Thread1of1ForFork3_~arg#1.base, ~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, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] 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-13 12:07:00,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [890] $Ultimate##0-->L822: Formula: (let ((.cse3 (= (mod v_~z$r_buff0_thd0~0_208 256) 0))) (let ((.cse4 (not .cse3))) (let ((.cse6 (ite .cse4 0 1))) (let ((.cse11 (= (mod .cse6 256) 0))) (let ((.cse5 (not .cse11))) (let ((.cse10 (and .cse5 .cse4)) (.cse7 (= (mod v_~z$w_buff0_used~0_542 256) 0))) (let ((.cse9 (ite (or .cse10 (and (not .cse7) .cse4)) 0 v_~z$w_buff0_used~0_542))) (let ((.cse0 (not (= (mod v_~z$r_buff0_thd3~0_249 256) 0))) (.cse8 (not (= (mod .cse9 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_540 256) 0))) (.cse2 (select |v_#memory_int_579| |v_~#z~0.base_266|))) (and (= v_~z$r_buff0_thd1~0_97 v_~z$r_buff1_thd1~0_99) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_39| |v_P2Thread1of1ForFork3_~arg#1.base_39|) (= v_~y~0_69 v_~__unbuffered_p2_EAX~0_136) (= v_~z$r_buff0_thd2~0_99 v_~z$r_buff1_thd2~0_99) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_39| |v_P2Thread1of1ForFork3_~arg#1.offset_39|) (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_457 256) 0))) (and (not (= (mod v_~z$r_buff0_thd3~0_247 256) 0)) .cse1)) 0 v_~z$r_buff0_thd3~0_249) v_~z$r_buff1_thd3~0_168) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_73| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_73|) (or (and (= |v_ULTIMATE.start_main_#t~ite34#1_218| |v_ULTIMATE.start_main_#t~mem33#1_223|) (= (select .cse2 |v_~#z~0.offset_266|) |v_ULTIMATE.start_main_#t~mem33#1_223|) (= |v_ULTIMATE.start_main_#t~ite34#1_218| |v_ULTIMATE.start_main_#t~ite35#1_168|) .cse3) (and (= v_~z$w_buff0~0_327 |v_ULTIMATE.start_main_#t~ite35#1_168|) .cse4 (= |v_ULTIMATE.start_main_#t~mem33#1_225| |v_ULTIMATE.start_main_#t~mem33#1_223|) (= |v_ULTIMATE.start_main_#t~ite34#1_220| |v_ULTIMATE.start_main_#t~ite34#1_218|))) (= v_~z$w_buff0_used~0_540 (ite .cse5 0 .cse6)) (= v_~z$r_buff0_thd4~0_309 v_~z$r_buff1_thd4~0_294) (= (ite .cse1 0 1) v_~z$r_buff0_thd3~0_247) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_73| (ite .cse7 1 0)) (= v_~z$r_buff1_thd0~0_196 (ite (or (and .cse5 (not (= (mod v_~z$r_buff0_thd0~0_207 256) 0))) (and .cse4 .cse8)) 0 v_~z$r_buff0_thd0~0_208)) (= v_~z$w_buff0~0_327 1) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_73| 0)) (= v_~z$w_buff1_used~0_457 (ite (or (and .cse0 .cse8) .cse1) 0 .cse9)) (= v_~z$r_buff0_thd0~0_207 (ite .cse10 0 v_~z$r_buff0_thd0~0_208)) (= v_~z$w_buff0~0_328 v_~z$w_buff1~0_266) (= (store |v_#memory_int_579| |v_~#z~0.base_266| (store .cse2 |v_~#z~0.offset_266| |v_P2_#t~ite5#1_62|)) |v_#memory_int_577|) (or (and .cse5 (= v_~z$w_buff0~0_327 |v_P2_#t~ite5#1_62|) (= |v_P2Thread1of1ForFork3_#t~mem3#1_62| |v_P2_#t~mem3#1_61|) (= |v_P2Thread1of1ForFork3_#t~ite4#1_62| |v_P2_#t~ite4#1_62|)) (and (= |v_P2_#t~ite4#1_62| |v_P2_#t~ite5#1_62|) (= |v_P2_#t~mem3#1_61| |v_P2_#t~ite4#1_62|) .cse11 (= |v_ULTIMATE.start_main_#t~ite35#1_168| |v_P2_#t~mem3#1_61|)))))))))))) InVars {~#z~0.base=|v_~#z~0.base_266|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_220|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_542, ~z$w_buff0~0=v_~z$w_buff0~0_328, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_39|, P2Thread1of1ForFork3_#t~mem3#1=|v_P2Thread1of1ForFork3_#t~mem3#1_62|, ~#z~0.offset=|v_~#z~0.offset_266|, P2Thread1of1ForFork3_#t~ite4#1=|v_P2Thread1of1ForFork3_#t~ite4#1_62|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_225|, #memory_int=|v_#memory_int_579|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_309, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_249, ~y~0=v_~y~0_69, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_97, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_99, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_39|} OutVars{~#z~0.base=|v_~#z~0.base_266|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_294, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_39|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_99, ~z$w_buff1~0=v_~z$w_buff1~0_266, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_167|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_207, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_309, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_136, ~y~0=v_~y~0_69, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_99, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_39|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_540, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_168, P2Thread1of1ForFork3_#t~ite5#1=|v_P2Thread1of1ForFork3_#t~ite5#1_35|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_457, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_39|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_39|, ~#z~0.offset=|v_~#z~0.offset_266|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_99, #memory_int=|v_#memory_int_577|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_247, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_73|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_97, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_73|} AuxVars[|v_P2_#t~ite5#1_62|, |v_P2_#t~ite4#1_62|, |v_P2_#t~mem3#1_61|, |v_ULTIMATE.start_main_#t~ite35#1_168|, |v_ULTIMATE.start_main_#t~mem33#1_223|, |v_ULTIMATE.start_main_#t~ite34#1_218|] AssignedVars[~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, 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, P2Thread1of1ForFork3_#t~ite5#1, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~mem3#1, P2Thread1of1ForFork3_#t~ite4#1, 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, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] and [799] L893-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (let ((.cse0 (= (mod v_~__unbuffered_p3_EAX$read_delayed~0_63 256) 0)) (.cse2 (= |v_ULTIMATE.start_main_#t~mem37#1_129| |v_ULTIMATE.start_main_#t~mem37#1_127|))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~ite38#1_122| v_~__unbuffered_p3_EAX~0_113) (let ((.cse1 (= (mod v_~weak$$choice1~0_100 256) 0))) (or (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite38#1_122| |v_ULTIMATE.start_main_#t~mem37#1_127|) (= |v_ULTIMATE.start_main_#t~mem37#1_127| (select (select |v_#memory_int_286| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_68) v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_68))) (and .cse1 (= |v_ULTIMATE.start_main_#t~ite38#1_122| v_~__unbuffered_p3_EAX~0_114) .cse2)))) (and (= v_~__unbuffered_p3_EAX~0_114 v_~__unbuffered_p3_EAX~0_113) (= |v_ULTIMATE.start_main_#t~ite38#1_124| |v_ULTIMATE.start_main_#t~ite38#1_122|) .cse0 .cse2))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= v_~weak$$choice1~0_100 |v_ULTIMATE.start_main_#t~nondet36#1_79|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_50 1) (= v_~__unbuffered_p3_EAX~0_113 1) (= v_~__unbuffered_p2_EAX~0_47 1) (= v_~__unbuffered_p0_EAX~0_48 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_63, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_79|, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_68, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_114, #memory_int=|v_#memory_int_286|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_124|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_129|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ULTIMATE.start_main_#t~ite39#1=|v_ULTIMATE.start_main_#t~ite39#1_58|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ~weak$$choice1~0=v_~weak$$choice1~0_100, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_68, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_63, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_68, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_113, #memory_int=|v_#memory_int_286|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47} AuxVars[|v_ULTIMATE.start_main_#t~ite38#1_122|, |v_ULTIMATE.start_main_#t~mem37#1_127|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~weak$$choice1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet36#1, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_#t~ite38#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite39#1, ULTIMATE.start_main_#t~mem37#1] [2022-12-13 12:07:00,814 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:07:00,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1752 [2022-12-13 12:07:00,814 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 303 flow [2022-12-13 12:07:00,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:00,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:00,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:00,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:07:00,815 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-13 12:07:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash -697534667, now seen corresponding path program 1 times [2022-12-13 12:07:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:00,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501671064] [2022-12-13 12:07:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:00,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501671064] [2022-12-13 12:07:00,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501671064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:00,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:00,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:07:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692034414] [2022-12-13 12:07:00,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:00,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:07:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:07:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:07:00,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2022-12-13 12:07:00,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:00,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:00,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2022-12-13 12:07:00,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:01,505 INFO L130 PetriNetUnfolder]: 5207/7109 cut-off events. [2022-12-13 12:07:01,505 INFO L131 PetriNetUnfolder]: For 12078/12078 co-relation queries the response was YES. [2022-12-13 12:07:01,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21053 conditions, 7109 events. 5207/7109 cut-off events. For 12078/12078 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 35130 event pairs, 2106 based on Foata normal form. 10/3910 useless extension candidates. Maximal degree in co-relation 21032. Up to 7087 conditions per place. [2022-12-13 12:07:01,536 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 47 selfloop transitions, 13 changer transitions 1/64 dead transitions. [2022-12-13 12:07:01,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 488 flow [2022-12-13 12:07:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:07:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:07:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 12:07:01,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2022-12-13 12:07:01,537 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 303 flow. Second operand 3 states and 69 transitions. [2022-12-13 12:07:01,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 488 flow [2022-12-13 12:07:01,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 444 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-13 12:07:01,544 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 333 flow [2022-12-13 12:07:01,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2022-12-13 12:07:01,545 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -23 predicate places. [2022-12-13 12:07:01,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:01,545 INFO L89 Accepts]: Start accepts. Operand has 60 places, 56 transitions, 333 flow [2022-12-13 12:07:01,546 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:01,546 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:01,546 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions, 333 flow [2022-12-13 12:07:01,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 56 transitions, 333 flow [2022-12-13 12:07:01,741 INFO L130 PetriNetUnfolder]: 2924/4387 cut-off events. [2022-12-13 12:07:01,741 INFO L131 PetriNetUnfolder]: For 1456/1543 co-relation queries the response was YES. [2022-12-13 12:07:01,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9815 conditions, 4387 events. 2924/4387 cut-off events. For 1456/1543 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 28542 event pairs, 1584 based on Foata normal form. 12/1928 useless extension candidates. Maximal degree in co-relation 9799. Up to 3928 conditions per place. [2022-12-13 12:07:01,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 56 transitions, 333 flow [2022-12-13 12:07:01,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-13 12:07:01,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [870] $Ultimate##0-->L851: Formula: (let ((.cse1 (= (mod v_~z$w_buff0_used~0_401 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd4~0_230 256) 0)) (.cse25 (mod v_~z$w_buff0_used~0_402 256)) (.cse26 (mod v_~weak$$choice0~0_99 256))) (let ((.cse20 (= .cse26 0)) (.cse19 (= (mod v_~z$w_buff1_used~0_356 256) 0)) (.cse16 (= .cse25 0)) (.cse24 (= (mod v_~weak$$choice2~0_74 256) 0)) (.cse23 (select |v_#memory_int_457| |v_~#z~0.base_212|)) (.cse18 (not .cse6)) (.cse4 (not .cse1))) (let ((.cse2 (and .cse18 .cse4)) (.cse7 (not (= (mod v_~z$w_buff1_used~0_355 256) 0))) (.cse15 (select .cse23 |v_~#z~0.offset_212|)) (.cse0 (not .cse24)) (.cse3 (= (mod v_~z$r_buff1_thd4~0_219 256) 0)) (.cse22 (not .cse16)) (.cse5 (not .cse19)) (.cse9 (not .cse20)) (.cse21 (= (mod v_~weak$$choice1~0_156 256) 0))) (and (= v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_125 |v_~#z~0.offset_212|) (= v_~z$w_buff1~0_202 v_~z$w_buff1~0_201) (= v_~z$flush_delayed~0_76 0) (= v_~z$w_buff1_used~0_355 (ite .cse0 v_~z$w_buff1_used~0_356 (ite .cse1 v_~z$w_buff1_used~0_356 (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 .cse6) v_~weak$$choice0~0_99 0))))) (= v_P3Thread1of1ForFork1_~arg.base_23 |v_P3Thread1of1ForFork1_#in~arg.base_23|) (= v_~__unbuffered_p3_EAX$read_delayed~0_124 1) (= v_~weak$$choice2~0_74 |v_P3Thread1of1ForFork1_#t~nondet7_42|) (= v_~z$r_buff0_thd4~0_229 (ite .cse0 v_~z$r_buff0_thd4~0_230 (ite .cse1 v_~z$r_buff0_thd4~0_230 (ite .cse2 0 (ite (and .cse3 .cse4 .cse6 .cse7) v_~z$r_buff0_thd4~0_230 0))))) (= (ite .cse0 v_~z$r_buff1_thd4~0_219 (ite .cse1 v_~z$r_buff1_thd4~0_219 (let ((.cse8 (= 0 (mod v_~z$r_buff0_thd4~0_229 256)))) (ite (and (not .cse8) .cse4) 0 (ite (and .cse3 .cse4 .cse8 .cse7) (ite .cse9 v_~z$r_buff1_thd4~0_219 0) 0))))) v_~z$r_buff1_thd4~0_218) (let ((.cse10 (= |v_P3_#t~ite16_69| |v_P3Thread1of1ForFork1_#t~ite16_42|)) (.cse14 (= |v_P3_#t~ite12_79| |v_P3Thread1of1ForFork1_#t~ite12_42|)) (.cse11 (= |v_P3Thread1of1ForFork1_#t~mem13_42| |v_P3_#t~mem13_86|)) (.cse12 (= |v_P3_#t~ite15_77| |v_P3Thread1of1ForFork1_#t~ite15_42|)) (.cse13 (= |v_P3Thread1of1ForFork1_#t~mem11_42| |v_P3_#t~mem11_80|)) (.cse17 (= |v_P3_#t~ite14_85| |v_P3Thread1of1ForFork1_#t~ite14_42|))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse15 |v_P3_#t~mem10_50|) .cse16 .cse17 (= v_~__unbuffered_p3_EAX~0_212 |v_P3_#t~mem10_50|) (= |v_P3_#t~ite17_61| |v_P3Thread1of1ForFork1_#t~ite17_41|)) (and (= |v_P3Thread1of1ForFork1_#t~mem10_42| |v_P3_#t~mem10_50|) (= |v_P3_#t~ite17_61| v_~__unbuffered_p3_EAX~0_212) (or (and .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse17 (= |v_P3_#t~ite17_61| v_~z$w_buff0~0_226)) (and (or (and .cse13 .cse14 (= |v_P3_#t~ite15_77| |v_P3_#t~ite16_69|) (or (not .cse3) .cse19) (or (and .cse11 (= |v_P3_#t~ite15_77| (ite .cse9 v_~z$w_buff1~0_202 v_~z$w_buff0~0_226)) .cse5 .cse17) (and (= |v_P3_#t~ite14_85| |v_P3_#t~ite15_77|) (or (and .cse11 .cse9 (= |v_P3_#t~ite14_85| v_~z$w_buff0~0_226)) (and (= .cse15 |v_P3_#t~mem13_86|) (= |v_P3_#t~ite14_85| |v_P3_#t~mem13_86|) .cse20)) .cse19))) (and .cse11 .cse3 .cse12 (= |v_P3_#t~ite12_79| |v_P3_#t~ite16_69|) .cse5 (or (and .cse9 (= .cse15 |v_P3_#t~mem11_80|) (= |v_P3_#t~ite12_79| |v_P3_#t~mem11_80|)) (and .cse13 .cse20 (= |v_P3_#t~ite12_79| (ite (not .cse21) v_~z$w_buff0~0_226 v_~z$w_buff1~0_202)))) .cse17)) .cse6 (= |v_P3_#t~ite17_61| |v_P3_#t~ite16_69|))) .cse22))) (= v_~a~0_41 1) (= |v_~#z~0.base_212| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_125) (= v_~z$mem_tmp~0_60 .cse15) (= (store |v_#memory_int_457| |v_~#z~0.base_212| (store .cse23 |v_~#z~0.offset_212| |v_P3_#t~ite21_57|)) |v_#memory_int_456|) (= v_~weak$$choice0~0_99 |v_P3Thread1of1ForFork1_#t~nondet6_42|) (= v_~z$w_buff0~0_226 v_~z$w_buff0~0_225) (= v_P3Thread1of1ForFork1_~arg.offset_23 |v_P3Thread1of1ForFork1_#in~arg.offset_23|) (= v_~weak$$choice1~0_156 |v_P3Thread1of1ForFork1_#t~nondet9_42|) (or (and .cse0 (= |v_P3Thread1of1ForFork1_#t~mem20_42| |v_P3_#t~mem20_60|) (= |v_P3_#t~ite21_57| v_~z$mem_tmp~0_60)) (and (= v_~__unbuffered_p3_EAX~0_212 |v_P3_#t~mem20_60|) .cse24 (= |v_P3_#t~ite21_57| |v_P3_#t~mem20_60|))) (= v_~z$w_buff0_used~0_401 (ite (= (ite .cse0 .cse25 (ite .cse16 .cse25 (ite (and .cse18 .cse22) 0 (ite (and .cse3 .cse22 .cse5 .cse6) (ite (or .cse9 .cse21) 1 0) .cse26)))) 0) 0 1)))))) InVars {~#z~0.base=|v_~#z~0.base_212|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_219, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_402, ~z$w_buff0~0=v_~z$w_buff0~0_226, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_356, ~z$w_buff1~0=v_~z$w_buff1~0_202, P3Thread1of1ForFork1_#t~mem20=|v_P3Thread1of1ForFork1_#t~mem20_42|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_23|, ~#z~0.offset=|v_~#z~0.offset_212|, P3Thread1of1ForFork1_#t~mem13=|v_P3Thread1of1ForFork1_#t~mem13_42|, P3Thread1of1ForFork1_#t~nondet6=|v_P3Thread1of1ForFork1_#t~nondet6_42|, P3Thread1of1ForFork1_#t~mem11=|v_P3Thread1of1ForFork1_#t~mem11_42|, P3Thread1of1ForFork1_#t~nondet7=|v_P3Thread1of1ForFork1_#t~nondet7_42|, P3Thread1of1ForFork1_#t~mem10=|v_P3Thread1of1ForFork1_#t~mem10_42|, P3Thread1of1ForFork1_#t~nondet9=|v_P3Thread1of1ForFork1_#t~nondet9_42|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_23|, P3Thread1of1ForFork1_#t~ite16=|v_P3Thread1of1ForFork1_#t~ite16_42|, P3Thread1of1ForFork1_#t~ite17=|v_P3Thread1of1ForFork1_#t~ite17_41|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_230, #memory_int=|v_#memory_int_457|, P3Thread1of1ForFork1_#t~ite14=|v_P3Thread1of1ForFork1_#t~ite14_42|, P3Thread1of1ForFork1_#t~ite15=|v_P3Thread1of1ForFork1_#t~ite15_42|, P3Thread1of1ForFork1_#t~ite12=|v_P3Thread1of1ForFork1_#t~ite12_42|} OutVars{~#z~0.base=|v_~#z~0.base_212|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_218, ~z$w_buff1~0=v_~z$w_buff1~0_201, P3Thread1of1ForFork1_#t~mem8=|v_P3Thread1of1ForFork1_#t~mem8_23|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_23, ~a~0=v_~a~0_41, ~weak$$choice1~0=v_~weak$$choice1~0_156, P3Thread1of1ForFork1_#t~ite18=|v_P3Thread1of1ForFork1_#t~ite18_23|, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_124, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_23|, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_125, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_212, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_229, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_23, ~z$mem_tmp~0=v_~z$mem_tmp~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_401, ~z$w_buff0~0=v_~z$w_buff0~0_225, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_355, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_23|, ~z$flush_delayed~0=v_~z$flush_delayed~0_76, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_23|, ~#z~0.offset=|v_~#z~0.offset_212|, ~weak$$choice0~0=v_~weak$$choice0~0_99, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_125, #memory_int=|v_#memory_int_456|, ~weak$$choice2~0=v_~weak$$choice2~0_74, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_23|} AuxVars[|v_P3_#t~ite21_57|, |v_P3_#t~ite12_79|, |v_P3_#t~mem10_50|, |v_P3_#t~mem13_86|, |v_P3_#t~ite17_61|, |v_P3_#t~mem20_60|, |v_P3_#t~ite15_77|, |v_P3_#t~mem11_80|, |v_P3_#t~ite14_85|, |v_P3_#t~ite16_69|] 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 [872] $Ultimate##0-->L775: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_23 |v_P0Thread1of1ForFork0_#in~arg.base_23|) (= v_P0Thread1of1ForFork0_~arg.offset_23 |v_P0Thread1of1ForFork0_#in~arg.offset_23|) (= v_~x~0_42 1) (= v_~a~0_47 v_~__unbuffered_p0_EAX~0_112)) InVars {~a~0=v_~a~0_47, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_23|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_23|} OutVars{~a~0=v_~a~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_112, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_23|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_23|, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_23, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_23} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 12:07:02,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [873] $Ultimate##0-->L858: Formula: (let ((.cse37 (mod v_~z$w_buff0_used~0_448 256)) (.cse38 (mod v_~weak$$choice0~0_105 256))) (let ((.cse32 (= .cse38 0)) (.cse28 (= (mod v_~z$w_buff1_used~0_397 256) 0)) (.cse18 (= .cse37 0)) (.cse27 (= (mod v_~z$r_buff0_thd4~0_257 256) 0)) (.cse34 (= (mod v_~weak$$choice2~0_80 256) 0))) (let ((.cse35 (not .cse34)) (.cse26 (not .cse27)) (.cse25 (not .cse18)) (.cse31 (not .cse28)) (.cse29 (= (mod v_~z$r_buff1_thd4~0_250 256) 0)) (.cse30 (not .cse32)) (.cse33 (= (mod v_~weak$$choice1~0_166 256) 0))) (let ((.cse17 (ite (= (ite .cse35 .cse37 (ite .cse18 .cse37 (ite (and .cse26 .cse25) 0 (ite (and .cse25 .cse27 .cse31 .cse29) (ite (or .cse30 .cse33) 1 0) .cse38)))) 0) 0 1))) (let ((.cse14 (= (mod .cse17 256) 0))) (let ((.cse8 (not .cse14))) (let ((.cse36 (and .cse26 .cse8))) (let ((.cse7 (ite .cse35 v_~z$w_buff1_used~0_397 (ite .cse14 v_~z$w_buff1_used~0_397 (ite .cse36 0 (ite (and .cse8 .cse27 .cse31 .cse29) v_~weak$$choice0~0_105 0)))))) (let ((.cse11 (= (mod .cse7 256) 0))) (let ((.cse6 (not .cse11))) (let ((.cse15 (ite .cse35 v_~z$r_buff0_thd4~0_257 (ite .cse14 v_~z$r_buff0_thd4~0_257 (ite .cse36 0 (ite (and .cse6 .cse8 .cse27 .cse29) v_~z$r_buff0_thd4~0_257 0)))))) (let ((.cse13 (= (mod .cse15 256) 0))) (let ((.cse10 (not .cse13))) (let ((.cse16 (and .cse8 .cse10))) (let ((.cse4 (ite .cse35 v_~z$r_buff1_thd4~0_250 (ite .cse14 v_~z$r_buff1_thd4~0_250 (ite .cse16 0 (ite (and .cse6 .cse8 .cse13 .cse29) (ite .cse30 v_~z$r_buff1_thd4~0_250 0) 0)))))) (let ((.cse0 (select |v_#memory_int_495| |v_~#z~0.base_230|)) (.cse3 (not (= 0 (mod v_~z$w_buff0_used~0_446 256)))) (.cse12 (= (mod .cse4 256) 0))) (let ((.cse2 (not .cse12)) (.cse5 (and .cse3 .cse10)) (.cse1 (select .cse0 |v_~#z~0.offset_230|))) (and (= v_~a~0_49 1) (= (store |v_#memory_int_495| |v_~#z~0.base_230| (store .cse0 |v_~#z~0.offset_230| |v_P3_#t~ite24_46|)) |v_#memory_int_493|) (= v_~weak$$choice2~0_80 |v_P3Thread1of1ForFork1_#t~nondet7_54|) (= v_~weak$$choice0~0_105 |v_P3Thread1of1ForFork1_#t~nondet6_54|) (= v_~z$flush_delayed~0_82 0) (= v_~weak$$choice1~0_166 |v_P3Thread1of1ForFork1_#t~nondet9_54|) (= v_~z$mem_tmp~0_66 .cse1) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_395 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_255 256) 0)))) 0 .cse4) v_~z$r_buff1_thd4~0_248) (= v_P3Thread1of1ForFork1_~arg.base_29 |v_P3Thread1of1ForFork1_#in~arg.base_29|) (= v_~z$w_buff1_used~0_395 (ite (or .cse5 (and .cse6 .cse2)) 0 .cse7)) (= |v_~#z~0.base_230| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_137) (let ((.cse9 (= |v_P3Thread1of1ForFork1_#t~mem22_48| |v_P3_#t~mem22_59|))) (or (and .cse8 (= |v_P3_#t~ite24_46| v_~z$w_buff0~0_257) (= |v_P3_#t~ite23_56| |v_P3Thread1of1ForFork1_#t~ite23_48|) .cse9 .cse10) (and (or (and (= |v_P3_#t~ite23_56| |v_P3_#t~mem22_59|) (or .cse11 .cse12) (= |v_P3_#t~ite21_67| |v_P3_#t~mem22_59|)) (and (= |v_P3_#t~ite23_56| v_~z$w_buff1~0_228) .cse6 .cse9 .cse2)) (or .cse13 .cse14) (= |v_P3_#t~ite23_56| |v_P3_#t~ite24_46|)))) (= v_~z$w_buff1~0_229 v_~z$w_buff1~0_228) (= v_~z$w_buff0~0_258 v_~z$w_buff0~0_257) (= (ite .cse5 0 .cse15) v_~z$r_buff0_thd4~0_255) (= (ite .cse16 0 .cse17) v_~z$w_buff0_used~0_446) (let ((.cse23 (= |v_P3_#t~ite16_79| |v_P3Thread1of1ForFork1_#t~ite16_54|)) (.cse24 (= |v_P3_#t~ite12_89| |v_P3Thread1of1ForFork1_#t~ite12_54|)) (.cse20 (= |v_P3Thread1of1ForFork1_#t~mem11_54| |v_P3_#t~mem11_90|)) (.cse19 (= |v_P3_#t~ite15_87| |v_P3Thread1of1ForFork1_#t~ite15_54|)) (.cse21 (= |v_P3Thread1of1ForFork1_#t~mem13_54| |v_P3_#t~mem13_96|)) (.cse22 (= |v_P3_#t~ite14_95| |v_P3Thread1of1ForFork1_#t~ite14_54|))) (or (and (= v_~__unbuffered_p3_EAX~0_228 |v_P3_#t~mem10_60|) .cse18 .cse19 .cse20 .cse21 (= |v_P3_#t~ite17_71| |v_P3Thread1of1ForFork1_#t~ite17_53|) .cse22 .cse23 (= .cse1 |v_P3_#t~mem10_60|) .cse24) (and .cse25 (= |v_P3Thread1of1ForFork1_#t~mem10_54| |v_P3_#t~mem10_60|) (= |v_P3_#t~ite17_71| v_~__unbuffered_p3_EAX~0_228) (or (and .cse26 .cse19 .cse20 .cse21 .cse22 .cse23 (= |v_P3_#t~ite17_71| v_~z$w_buff0~0_258) .cse24) (and .cse27 (or (and .cse20 .cse24 (or .cse28 (not .cse29)) (or (and .cse21 (= |v_P3_#t~ite15_87| (ite .cse30 v_~z$w_buff1~0_229 v_~z$w_buff0~0_258)) .cse31 .cse22) (and .cse28 (= |v_P3_#t~ite14_95| |v_P3_#t~ite15_87|) (or (and .cse32 (= |v_P3_#t~ite14_95| |v_P3_#t~mem13_96|) (= .cse1 |v_P3_#t~mem13_96|)) (and (= |v_P3_#t~ite14_95| v_~z$w_buff0~0_258) .cse21 .cse30)))) (= |v_P3_#t~ite15_87| |v_P3_#t~ite16_79|)) (and (or (and .cse32 .cse20 (= |v_P3_#t~ite12_89| (ite (not .cse33) v_~z$w_buff0~0_258 v_~z$w_buff1~0_229))) (and .cse30 (= |v_P3_#t~ite12_89| |v_P3_#t~mem11_90|) (= .cse1 |v_P3_#t~mem11_90|))) .cse19 .cse21 .cse31 .cse22 (= |v_P3_#t~ite12_89| |v_P3_#t~ite16_79|) .cse29)) (= |v_P3_#t~ite17_71| |v_P3_#t~ite16_79|)))))) (or (and (= v_~__unbuffered_p3_EAX~0_228 |v_P3_#t~mem20_70|) (= |v_P3_#t~ite21_67| |v_P3_#t~mem20_70|) .cse34) (and (= |v_P3_#t~ite21_67| v_~z$mem_tmp~0_66) (= |v_P3Thread1of1ForFork1_#t~mem20_54| |v_P3_#t~mem20_70|) .cse35)) (= v_P3Thread1of1ForFork1_~arg.offset_29 |v_P3Thread1of1ForFork1_#in~arg.offset_29|) (= v_~__unbuffered_p3_EAX$read_delayed~0_136 1) (= v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_137 |v_~#z~0.offset_230|))))))))))))))))))) InVars {~#z~0.base=|v_~#z~0.base_230|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_250, ~z$w_buff1~0=v_~z$w_buff1~0_229, 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_257, P3Thread1of1ForFork1_#t~ite14=|v_P3Thread1of1ForFork1_#t~ite14_54|, P3Thread1of1ForFork1_#t~ite15=|v_P3Thread1of1ForFork1_#t~ite15_54|, P3Thread1of1ForFork1_#t~ite12=|v_P3Thread1of1ForFork1_#t~ite12_54|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_448, ~z$w_buff0~0=v_~z$w_buff0~0_258, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_397, 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_230|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_48|, 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|, #memory_int=|v_#memory_int_495|, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_48|} OutVars{~#z~0.base=|v_~#z~0.base_230|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_248, ~z$w_buff1~0=v_~z$w_buff1~0_228, P3Thread1of1ForFork1_#t~mem8=|v_P3Thread1of1ForFork1_#t~mem8_29|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_29, ~a~0=v_~a~0_49, ~weak$$choice1~0=v_~weak$$choice1~0_166, P3Thread1of1ForFork1_#t~ite18=|v_P3Thread1of1ForFork1_#t~ite18_29|, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_136, 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_137, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_255, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_228, 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_446, ~z$w_buff0~0=v_~z$w_buff0~0_257, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_395, 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_230|, ~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_137, #memory_int=|v_#memory_int_493|, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_26|, ~weak$$choice2~0=v_~weak$$choice2~0_80, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_29|} AuxVars[|v_P3_#t~mem22_59|, |v_P3_#t~ite23_56|, |v_P3_#t~mem13_96|, |v_P3_#t~mem10_60|, |v_P3_#t~ite24_46|, |v_P3_#t~mem11_90|, |v_P3_#t~ite17_71|, |v_P3_#t~ite21_67|, |v_P3_#t~mem20_70|, |v_P3_#t~ite15_87|, |v_P3_#t~ite12_89|, |v_P3_#t~ite14_95|, |v_P3_#t~ite16_79|] 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, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~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~mem22, 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, P3Thread1of1ForFork1_#t~ite24, P3Thread1of1ForFork1_#t~ite23, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~ite21] and [872] $Ultimate##0-->L775: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_23 |v_P0Thread1of1ForFork0_#in~arg.base_23|) (= v_P0Thread1of1ForFork0_~arg.offset_23 |v_P0Thread1of1ForFork0_#in~arg.offset_23|) (= v_~x~0_42 1) (= v_~a~0_47 v_~__unbuffered_p0_EAX~0_112)) InVars {~a~0=v_~a~0_47, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_23|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_23|} OutVars{~a~0=v_~a~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_112, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_23|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_23|, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_23, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_23} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 12:07:05,104 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:07:05,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3560 [2022-12-13 12:07:05,105 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 333 flow [2022-12-13 12:07:05,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:05,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:05,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:05,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:07:05,106 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-13 12:07:05,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash -595196687, now seen corresponding path program 1 times [2022-12-13 12:07:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:05,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072036121] [2022-12-13 12:07:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:05,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:05,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072036121] [2022-12-13 12:07:05,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072036121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:05,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:05,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:07:05,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402943761] [2022-12-13 12:07:05,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:05,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:07:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:05,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:07:05,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:07:05,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-13 12:07:05,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:05,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:05,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-13 12:07:05,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:05,814 INFO L130 PetriNetUnfolder]: 4163/5891 cut-off events. [2022-12-13 12:07:05,814 INFO L131 PetriNetUnfolder]: For 6758/6758 co-relation queries the response was YES. [2022-12-13 12:07:05,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20757 conditions, 5891 events. 4163/5891 cut-off events. For 6758/6758 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 30782 event pairs, 756 based on Foata normal form. 54/3356 useless extension candidates. Maximal degree in co-relation 20738. Up to 5770 conditions per place. [2022-12-13 12:07:05,836 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 51 selfloop transitions, 25 changer transitions 0/79 dead transitions. [2022-12-13 12:07:05,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 633 flow [2022-12-13 12:07:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:07:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:07:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 12:07:05,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2022-12-13 12:07:05,838 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 333 flow. Second operand 4 states and 85 transitions. [2022-12-13 12:07:05,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 633 flow [2022-12-13 12:07:05,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 615 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:07:05,846 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 463 flow [2022-12-13 12:07:05,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=463, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2022-12-13 12:07:05,846 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -23 predicate places. [2022-12-13 12:07:05,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:05,846 INFO L89 Accepts]: Start accepts. Operand has 60 places, 67 transitions, 463 flow [2022-12-13 12:07:05,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:05,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:05,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 67 transitions, 463 flow [2022-12-13 12:07:05,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 67 transitions, 463 flow [2022-12-13 12:07:06,048 INFO L130 PetriNetUnfolder]: 2108/3554 cut-off events. [2022-12-13 12:07:06,048 INFO L131 PetriNetUnfolder]: For 1749/2280 co-relation queries the response was YES. [2022-12-13 12:07:06,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11539 conditions, 3554 events. 2108/3554 cut-off events. For 1749/2280 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 25099 event pairs, 567 based on Foata normal form. 22/1832 useless extension candidates. Maximal degree in co-relation 11522. Up to 2887 conditions per place. [2022-12-13 12:07:06,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 67 transitions, 463 flow [2022-12-13 12:07:06,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-13 12:07:06,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L882-3-->L887: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_159 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_37|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|} 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 [889] $Ultimate##0-->L822: Formula: (let ((.cse0 (= (mod v_~z$r_buff0_thd0~0_204 256) 0))) (let ((.cse2 (not .cse0))) (let ((.cse22 (ite .cse2 0 1))) (let ((.cse7 (= (mod v_~z$r_buff0_thd4~0_306 256) 0)) (.cse8 (= (mod .cse22 256) 0))) (let ((.cse6 (not .cse8)) (.cse4 (not .cse7))) (let ((.cse13 (ite (and .cse6 .cse4) 0 .cse22))) (let ((.cse12 (= (mod .cse13 256) 0)) (.cse17 (= (mod v_~z$w_buff0_used~0_536 256) 0)) (.cse15 (and .cse6 .cse2))) (let ((.cse21 (ite (or (and (not .cse17) .cse2) .cse15) 0 v_~z$w_buff0_used~0_536)) (.cse5 (not .cse12))) (let ((.cse11 (and .cse5 .cse4)) (.cse14 (not (= (mod .cse21 256) 0)))) (let ((.cse16 (ite (or .cse11 (and .cse14 .cse4)) 0 .cse21))) (let ((.cse3 (not (= (mod .cse16 256) 0))) (.cse10 (not (= (mod v_~z$r_buff0_thd3~0_243 256) 0))) (.cse9 (not (= (mod v_~z$w_buff0_used~0_534 256) 0))) (.cse1 (select |v_#memory_int_573| |v_~#z~0.base_264|))) (and (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_71| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_71|) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite34#1_211| |v_ULTIMATE.start_main_#t~ite35#1_163|) (= |v_ULTIMATE.start_main_#t~ite34#1_211| |v_ULTIMATE.start_main_#t~mem33#1_216|) (= (select .cse1 |v_~#z~0.offset_264|) |v_ULTIMATE.start_main_#t~mem33#1_216|)) (and (= v_~z$w_buff0~0_323 |v_ULTIMATE.start_main_#t~ite35#1_163|) (= |v_ULTIMATE.start_main_#t~ite34#1_213| |v_ULTIMATE.start_main_#t~ite34#1_211|) (= |v_ULTIMATE.start_main_#t~mem33#1_218| |v_ULTIMATE.start_main_#t~mem33#1_216|) .cse2)) (= v_~z$r_buff0_thd2~0_97 v_~z$r_buff1_thd2~0_97) (= (ite (or (and .cse3 .cse4) (and (not (= 0 (mod v_~z$r_buff0_thd4~0_305 256))) .cse5)) 0 v_~z$r_buff0_thd4~0_306) v_~z$r_buff1_thd4~0_292) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_79| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_81|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_134 1) (= v_~__unbuffered_p0_EAX~0_118 1) (= v_~__unbuffered_p1_EAX~0_120 1) (= v_~__unbuffered_p3_EAX~0_238 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_98) (= v_~y~0_67 v_~__unbuffered_p2_EAX~0_134) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_37| |v_P2Thread1of1ForFork3_~arg#1.offset_37|) (or (and (= |v_P3Thread1of1ForFork1_#t~mem22_76| |v_P3_#t~mem22_76|) (= |v_P3_#t~ite23_73| |v_P3Thread1of1ForFork1_#t~ite23_76|) (= |v_P3_#t~ite24_63| v_~z$w_buff0~0_323) .cse6 .cse4) (and (or .cse7 .cse8) (= |v_P3_#t~ite23_73| |v_P3_#t~ite24_63|) (= |v_ULTIMATE.start_main_#t~ite35#1_163| |v_P3_#t~mem22_76|) (= |v_P3_#t~ite23_73| |v_P3_#t~mem22_76|))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_81| 0) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_37| |v_P2Thread1of1ForFork3_~arg#1.base_37|) (= v_~z$r_buff1_thd3~0_164 (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_241 256) 0)) .cse9) (and (not (= (mod v_~z$w_buff1_used~0_453 256) 0)) .cse10)) 0 v_~z$r_buff0_thd3~0_243)) (= v_~z$w_buff0~0_323 1) (= v_~weak$$choice1~0_172 |v_ULTIMATE.start_main_#t~nondet36#1_167|) (= (ite .cse11 0 v_~z$r_buff0_thd4~0_306) v_~z$r_buff0_thd4~0_305) (= (store |v_#memory_int_573| |v_~#z~0.base_264| (store .cse1 |v_~#z~0.offset_264| |v_P2_#t~ite5#1_59|)) |v_#memory_int_571|) (or (and .cse12 (= |v_P3_#t~ite24_63| |v_P2_#t~mem3#1_58|) (= |v_P2_#t~ite4#1_59| |v_P2_#t~ite5#1_59|) (= |v_P2_#t~mem3#1_58| |v_P2_#t~ite4#1_59|)) (and (= v_~z$w_buff0~0_323 |v_P2_#t~ite5#1_59|) (= |v_P2Thread1of1ForFork3_#t~ite4#1_58| |v_P2_#t~ite4#1_59|) .cse5 (= |v_P2Thread1of1ForFork3_#t~mem3#1_58| |v_P2_#t~mem3#1_58|))) (= v_~z$r_buff0_thd1~0_95 v_~z$r_buff1_thd1~0_97) (= v_~z$w_buff0_used~0_534 (ite .cse5 0 .cse13)) (= (ite .cse9 0 1) v_~z$r_buff0_thd3~0_241) (= v_~z$r_buff1_thd0~0_194 (ite (or (and .cse14 .cse2) (and (not (= 0 (mod v_~z$r_buff0_thd0~0_203 256))) .cse6)) 0 v_~z$r_buff0_thd0~0_204)) (= v_~z$r_buff0_thd0~0_203 (ite .cse15 0 v_~z$r_buff0_thd0~0_204)) (= v_~z$w_buff1_used~0_453 (ite (or (and .cse3 .cse10) .cse9) 0 .cse16)) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_71| (ite .cse17 1 0)) (= v_~z$w_buff0~0_324 v_~z$w_buff1~0_264) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_71| 0)) (= (mod v_~main$tmp_guard1~0_98 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_79|) (let ((.cse19 (= |v_ULTIMATE.start_main_#t~mem37#1_273| |v_ULTIMATE.start_main_#t~mem37#1_271|)) (.cse18 (= (mod v_~__unbuffered_p3_EAX$read_delayed~0_142 256) 0))) (or (and .cse18 (= |v_ULTIMATE.start_main_#t~ite38#1_268| |v_ULTIMATE.start_main_#t~ite38#1_266|) .cse19 (= v_~__unbuffered_p3_EAX~0_239 v_~__unbuffered_p3_EAX~0_238)) (and (= |v_ULTIMATE.start_main_#t~ite38#1_266| v_~__unbuffered_p3_EAX~0_238) (let ((.cse20 (= (mod v_~weak$$choice1~0_172 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite38#1_266| |v_ULTIMATE.start_main_#t~mem37#1_271|) (not .cse20) (= |v_ULTIMATE.start_main_#t~mem37#1_271| (select (select (store |v_#memory_int_573| |v_~#z~0.base_264| (store .cse1 |v_~#z~0.offset_264| |v_P3_#t~ite24_63|)) v_~__unbuffered_p3_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite38#1_266| v_~__unbuffered_p3_EAX~0_239) .cse20 .cse19))) (not .cse18)))))))))))))))) InVars {~#z~0.base=|v_~#z~0.base_264|, P2Thread1of1ForFork3_#t~mem3#1=|v_P2Thread1of1ForFork3_#t~mem3#1_58|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_118, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_120, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_142, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_143, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_239, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_306, ~y~0=v_~y~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_97, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_37|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_213|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_536, ~z$w_buff0~0=v_~z$w_buff0~0_324, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_167|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_37|, ~#z~0.offset=|v_~#z~0.offset_264|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_76|, P2Thread1of1ForFork3_#t~ite4#1=|v_P2Thread1of1ForFork3_#t~ite4#1_58|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_143, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_218|, #memory_int=|v_#memory_int_573|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_268|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_243, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_76|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_95, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_273|} OutVars{~#z~0.base=|v_~#z~0.base_264|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_81|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_292, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_37|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_98, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_162|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_118, ~weak$$choice1~0=v_~weak$$choice1~0_172, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_203, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_120, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_142, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_194, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_143, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_238, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_305, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_134, ~y~0=v_~y~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_97, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_37|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_534, ~z$w_buff0~0=v_~z$w_buff0~0_323, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_164, P2Thread1of1ForFork3_#t~ite5#1=|v_P2Thread1of1ForFork3_#t~ite5#1_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_453, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_37|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_37|, ULTIMATE.start_main_#t~ite39#1=|v_ULTIMATE.start_main_#t~ite39#1_106|, ~#z~0.offset=|v_~#z~0.offset_264|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_143, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_79|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_97, #memory_int=|v_#memory_int_571|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_241, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_40|, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_71|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_95, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_71|} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_163|, |v_ULTIMATE.start_main_#t~ite34#1_211|, |v_ULTIMATE.start_main_#t~ite38#1_266|, |v_ULTIMATE.start_main_#t~mem37#1_271|, |v_ULTIMATE.start_main_#t~mem33#1_216|, |v_P3_#t~mem22_76|, |v_P2_#t~ite5#1_59|, |v_P2_#t~ite4#1_59|, |v_P3_#t~ite23_73|, |v_P3_#t~ite24_63|, |v_P2_#t~mem3#1_58|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, ~z$r_buff1_thd2~0, ~z$w_buff1~0, ~main$tmp_guard1~0, P2Thread1of1ForFork3_#t~mem3#1, ULTIMATE.start_main_#t~ite35#1, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet36#1, ~z$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite5#1, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, ULTIMATE.start_main_#t~ite39#1, P3Thread1of1ForFork1_#t~mem22, P2Thread1of1ForFork3_#t~ite4#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~z$r_buff0_thd3~0, P3Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P3Thread1of1ForFork1_#t~ite23, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem37#1] [2022-12-13 12:07:07,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L882-3-->L887: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_159 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_37|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|} 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 [887] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_198 256) 0))) (let ((.cse8 (not .cse9))) (let ((.cse12 (ite .cse8 0 1))) (let ((.cse14 (= (mod .cse12 256) 0))) (let ((.cse11 (not .cse14))) (let ((.cse15 (= (mod v_~z$r_buff0_thd4~0_298 256) 0)) (.cse0 (and .cse8 .cse11)) (.cse16 (= (mod v_~z$w_buff0_used~0_525 256) 0))) (let ((.cse4 (ite (or .cse0 (and (not .cse16) .cse8)) 0 v_~z$w_buff0_used~0_525)) (.cse2 (not .cse15)) (.cse13 (not (= (mod v_~z$w_buff0_used~0_524 256) 0)))) (let ((.cse3 (and .cse2 .cse13)) (.cse10 (select |v_#memory_int_562| |v_~#z~0.base_260|)) (.cse1 (not (= (mod .cse4 256) 0)))) (and (= v_~z$r_buff0_thd0~0_197 (ite .cse0 0 v_~z$r_buff0_thd0~0_198)) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_33| |v_P2Thread1of1ForFork3_~arg#1.base_33|) (= v_~z$w_buff1_used~0_447 (ite (or (and .cse1 .cse2) .cse3) 0 .cse4)) (let ((.cse5 (= (mod v_~__unbuffered_p3_EAX$read_delayed~0_140 256) 0)) (.cse7 (= |v_ULTIMATE.start_main_#t~mem37#1_267| |v_ULTIMATE.start_main_#t~mem37#1_265|))) (or (and (not .cse5) (let ((.cse6 (= (mod v_~weak$$choice1~0_170 256) 0))) (or (and (not .cse6) (= |v_ULTIMATE.start_main_#t~ite38#1_260| |v_ULTIMATE.start_main_#t~mem37#1_265|) (= |v_ULTIMATE.start_main_#t~mem37#1_265| (select (select |v_#memory_int_561| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_141) v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_141))) (and (= |v_ULTIMATE.start_main_#t~ite38#1_260| v_~__unbuffered_p3_EAX~0_235) .cse7 .cse6))) (= |v_ULTIMATE.start_main_#t~ite38#1_260| v_~__unbuffered_p3_EAX~0_234)) (and .cse5 (= |v_ULTIMATE.start_main_#t~ite38#1_262| |v_ULTIMATE.start_main_#t~ite38#1_260|) .cse7 (= v_~__unbuffered_p3_EAX~0_235 v_~__unbuffered_p3_EAX~0_234)))) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_33| |v_P2Thread1of1ForFork3_~arg#1.offset_33|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_79|) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_67| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_67|) (= v_~z$r_buff0_thd4~0_297 (ite .cse3 0 v_~z$r_buff0_thd4~0_298)) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite34#1_207| |v_ULTIMATE.start_main_#t~ite34#1_205|) (= |v_ULTIMATE.start_main_#t~mem33#1_212| |v_ULTIMATE.start_main_#t~mem33#1_210|) (= v_~z$w_buff0~0_315 |v_ULTIMATE.start_main_#t~ite35#1_159|)) (and (= |v_ULTIMATE.start_main_#t~ite34#1_205| |v_ULTIMATE.start_main_#t~ite35#1_159|) .cse9 (= |v_ULTIMATE.start_main_#t~ite34#1_205| |v_ULTIMATE.start_main_#t~mem33#1_210|) (= (select .cse10 |v_~#z~0.offset_260|) |v_ULTIMATE.start_main_#t~mem33#1_210|))) (= (ite (and .cse11 .cse2) 0 .cse12) v_~z$w_buff0_used~0_524) (= (store |v_#memory_int_562| |v_~#z~0.base_260| (store .cse10 |v_~#z~0.offset_260| |v_P3_#t~ite24_59|)) |v_#memory_int_561|) (= v_~main$tmp_guard1~0_96 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_130 1) (= v_~__unbuffered_p0_EAX~0_116 1) (= v_~__unbuffered_p1_EAX~0_118 1) (= v_~__unbuffered_p3_EAX~0_234 1))) 1 0) 0) 0 1)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_297 256) 0)) .cse13) (and (not (= (mod v_~z$w_buff1_used~0_447 256) 0)) .cse2)) 0 v_~z$r_buff0_thd4~0_298) v_~z$r_buff1_thd4~0_288) (= v_~z$w_buff0~0_315 1) (= v_~z$r_buff0_thd1~0_91 v_~z$r_buff1_thd1~0_93) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_79| 0) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_67| 0)) (= v_~z$r_buff0_thd2~0_93 v_~z$r_buff1_thd2~0_93) (= v_~z$r_buff1_thd0~0_190 (ite (or (and .cse1 .cse8) (and (not (= (mod v_~z$r_buff0_thd0~0_197 256) 0)) .cse11)) 0 v_~z$r_buff0_thd0~0_198)) (or (and (= |v_P3_#t~ite24_59| v_~z$w_buff0~0_315) .cse11 .cse2 (= |v_P3_#t~ite23_69| |v_P3Thread1of1ForFork1_#t~ite23_68|) (= |v_P3Thread1of1ForFork1_#t~mem22_68| |v_P3_#t~mem22_72|)) (and (= |v_ULTIMATE.start_main_#t~ite35#1_159| |v_P3_#t~mem22_72|) (= |v_P3_#t~ite23_69| |v_P3_#t~ite24_59|) (or .cse14 .cse15) (= |v_P3_#t~ite23_69| |v_P3_#t~mem22_72|))) (= v_~z$r_buff0_thd3~0_231 1) (= v_~z$w_buff0~0_316 v_~z$w_buff1~0_260) (= v_~z$r_buff0_thd3~0_232 v_~z$r_buff1_thd3~0_158) (= v_~weak$$choice1~0_170 |v_ULTIMATE.start_main_#t~nondet36#1_163|) (= v_~y~0_63 v_~__unbuffered_p2_EAX~0_130) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_67| (ite .cse16 1 0)) (= (mod v_~main$tmp_guard1~0_96 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77|)))))))))) InVars {~#z~0.base=|v_~#z~0.base_260|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_198, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_140, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_141, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_235, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_298, ~y~0=v_~y~0_63, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_93, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_33|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_207|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_163|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_525, ~z$w_buff0~0=v_~z$w_buff0~0_316, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_33|, ~#z~0.offset=|v_~#z~0.offset_260|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_68|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_141, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_212|, #memory_int=|v_#memory_int_562|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_262|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_232, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_68|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_91, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_267|} OutVars{~#z~0.base=|v_~#z~0.base_260|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_79|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_288, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_33|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_260, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_96, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_158|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~weak$$choice1~0=v_~weak$$choice1~0_170, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_140, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_190, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_141, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_234, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_297, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_130, ~y~0=v_~y~0_63, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_93, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_33|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_524, ~z$w_buff0~0=v_~z$w_buff0~0_315, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_158, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_447, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_33|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_33|, ULTIMATE.start_main_#t~ite39#1=|v_ULTIMATE.start_main_#t~ite39#1_104|, ~#z~0.offset=|v_~#z~0.offset_260|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_141, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_93, #memory_int=|v_#memory_int_561|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_231, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_36|, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_67|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_91, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_67|} AuxVars[|v_P3_#t~ite24_59|, |v_P3_#t~mem22_72|, |v_P3_#t~ite23_69|, |v_ULTIMATE.start_main_#t~mem33#1_210|, |v_ULTIMATE.start_main_#t~ite35#1_159|, |v_ULTIMATE.start_main_#t~mem37#1_265|, |v_ULTIMATE.start_main_#t~ite38#1_260|, |v_ULTIMATE.start_main_#t~ite34#1_205|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, ~z$r_buff1_thd2~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet36#1, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, ULTIMATE.start_main_#t~ite39#1, P3Thread1of1ForFork1_#t~mem22, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~z$r_buff0_thd3~0, P3Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P3Thread1of1ForFork1_#t~ite23, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem37#1] [2022-12-13 12:07:08,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L882-3-->L887: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_159 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_37|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|} 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 [886] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse13 (= (mod v_~z$r_buff0_thd0~0_194 256) 0))) (let ((.cse7 (not .cse13))) (let ((.cse11 (ite .cse7 0 1))) (let ((.cse1 (= (mod .cse11 256) 0))) (let ((.cse0 (not .cse1))) (let ((.cse12 (= (mod v_~z$w_buff0_used~0_521 256) 0)) (.cse6 (and .cse7 .cse0))) (let ((.cse5 (ite (or (and .cse7 (not .cse12)) .cse6) 0 v_~z$w_buff0_used~0_521))) (let ((.cse3 (not (= (mod .cse5 256) 0))) (.cse4 (not (= (mod v_~z$r_buff0_thd3~0_228 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_520 256) 0))) (.cse14 (select |v_#memory_int_558| |v_~#z~0.base_258|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77| 0) (or (and (= |v_P2Thread1of1ForFork3_#t~mem3#1_50| |v_P2_#t~mem3#1_53|) (= |v_P2Thread1of1ForFork3_#t~ite4#1_50| |v_P2_#t~ite4#1_54|) (= v_~z$w_buff0~0_311 |v_P2_#t~ite5#1_54|) .cse0) (and .cse1 (= |v_P2_#t~ite4#1_54| |v_P2_#t~ite5#1_54|) (= |v_ULTIMATE.start_main_#t~ite35#1_155| |v_P2_#t~mem3#1_53|) (= |v_P2_#t~mem3#1_53| |v_P2_#t~ite4#1_54|))) (= (ite .cse2 0 1) v_~z$r_buff0_thd3~0_227) (= (ite (or (and .cse3 .cse4) .cse2) 0 .cse5) v_~z$w_buff1_used~0_445) (= v_~z$w_buff0~0_312 v_~z$w_buff1~0_258) (= v_~z$r_buff0_thd0~0_193 (ite .cse6 0 v_~z$r_buff0_thd0~0_194)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_75| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_31| |v_P2Thread1of1ForFork3_~arg#1.offset_31|) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_31| |v_P2Thread1of1ForFork3_~arg#1.base_31|) (= v_~weak$$choice1~0_168 |v_ULTIMATE.start_main_#t~nondet36#1_159|) (= v_~z$r_buff0_thd4~0_295 v_~z$r_buff1_thd4~0_286) (= v_~z$r_buff1_thd0~0_188 (ite (or (and .cse3 .cse7) (and (not (= (mod v_~z$r_buff0_thd0~0_193 256) 0)) .cse0)) 0 v_~z$r_buff0_thd0~0_194)) (= (mod v_~main$tmp_guard1~0_94 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_75|) (= v_~z$w_buff0~0_311 1) (= (ite (or (and .cse4 (not (= (mod v_~z$w_buff1_used~0_445 256) 0))) (and (not (= (mod v_~z$r_buff0_thd3~0_227 256) 0)) .cse2)) 0 v_~z$r_buff0_thd3~0_228) v_~z$r_buff1_thd3~0_156) (let ((.cse8 (= (mod v_~__unbuffered_p3_EAX$read_delayed~0_138 256) 0)) (.cse10 (= |v_ULTIMATE.start_main_#t~mem37#1_259| |v_ULTIMATE.start_main_#t~mem37#1_261|))) (or (and (not .cse8) (= |v_ULTIMATE.start_main_#t~ite38#1_254| v_~__unbuffered_p3_EAX~0_230) (let ((.cse9 (= (mod v_~weak$$choice1~0_168 256) 0))) (or (and (not .cse9) (= |v_ULTIMATE.start_main_#t~ite38#1_254| |v_ULTIMATE.start_main_#t~mem37#1_259|) (= (select (select |v_#memory_int_557| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_139) v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_139) |v_ULTIMATE.start_main_#t~mem37#1_259|)) (and .cse9 (= |v_ULTIMATE.start_main_#t~ite38#1_254| v_~__unbuffered_p3_EAX~0_231) .cse10)))) (and (= |v_ULTIMATE.start_main_#t~ite38#1_256| |v_ULTIMATE.start_main_#t~ite38#1_254|) .cse8 (= v_~__unbuffered_p3_EAX~0_231 v_~__unbuffered_p3_EAX~0_230) .cse10))) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_65| 0)) (= v_~main$tmp_guard1~0_94 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_116 1) (= v_~__unbuffered_p3_EAX~0_230 1) (= v_~__unbuffered_p0_EAX~0_114 1) (= v_~__unbuffered_p2_EAX~0_128 1))) 1 0) 0) 0 1)) (= (ite .cse0 0 .cse11) v_~z$w_buff0_used~0_520) (= v_~z$r_buff0_thd1~0_89 v_~z$r_buff1_thd1~0_91) (= v_~z$r_buff0_thd2~0_91 v_~z$r_buff1_thd2~0_91) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_65| (ite .cse12 1 0)) (or (and (= |v_ULTIMATE.start_main_#t~ite34#1_201| |v_ULTIMATE.start_main_#t~ite34#1_199|) .cse7 (= v_~z$w_buff0~0_311 |v_ULTIMATE.start_main_#t~ite35#1_155|) (= |v_ULTIMATE.start_main_#t~mem33#1_206| |v_ULTIMATE.start_main_#t~mem33#1_204|)) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite34#1_199| |v_ULTIMATE.start_main_#t~ite35#1_155|) (= |v_ULTIMATE.start_main_#t~mem33#1_204| (select .cse14 |v_~#z~0.offset_258|)) (= |v_ULTIMATE.start_main_#t~ite34#1_199| |v_ULTIMATE.start_main_#t~mem33#1_204|))) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_65| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_65|) (= v_~y~0_61 v_~__unbuffered_p2_EAX~0_128) (= |v_#memory_int_557| (store |v_#memory_int_558| |v_~#z~0.base_258| (store .cse14 |v_~#z~0.offset_258| |v_P2_#t~ite5#1_54|)))))))))))) InVars {~#z~0.base=|v_~#z~0.base_258|, P2Thread1of1ForFork3_#t~mem3#1=|v_P2Thread1of1ForFork3_#t~mem3#1_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_194, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_116, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_138, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_231, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_295, ~y~0=v_~y~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_91, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_31|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_201|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_159|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_521, ~z$w_buff0~0=v_~z$w_buff0~0_312, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_31|, ~#z~0.offset=|v_~#z~0.offset_258|, P2Thread1of1ForFork3_#t~ite4#1=|v_P2Thread1of1ForFork3_#t~ite4#1_50|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_139, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_206|, #memory_int=|v_#memory_int_558|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_256|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_228, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_89, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_261|} OutVars{~#z~0.base=|v_~#z~0.base_258|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_286, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_31|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_94, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_154|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_168, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_193, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_116, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_138, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_188, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_230, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_295, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~y~0=v_~y~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_91, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_31|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_520, ~z$w_buff0~0=v_~z$w_buff0~0_311, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_156, P2Thread1of1ForFork3_#t~ite5#1=|v_P2Thread1of1ForFork3_#t~ite5#1_29|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_445, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_31|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_31|, ULTIMATE.start_main_#t~ite39#1=|v_ULTIMATE.start_main_#t~ite39#1_102|, ~#z~0.offset=|v_~#z~0.offset_258|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_139, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_75|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_91, #memory_int=|v_#memory_int_557|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_227, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_65|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_89, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_65|} AuxVars[|v_P2_#t~ite4#1_54|, |v_ULTIMATE.start_main_#t~ite34#1_199|, |v_ULTIMATE.start_main_#t~ite35#1_155|, |v_P2_#t~ite5#1_54|, |v_ULTIMATE.start_main_#t~mem33#1_204|, |v_ULTIMATE.start_main_#t~ite38#1_254|, |v_P2_#t~mem3#1_53|, |v_ULTIMATE.start_main_#t~mem37#1_259|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, ~z$r_buff1_thd2~0, ~z$w_buff1~0, ~main$tmp_guard1~0, P2Thread1of1ForFork3_#t~mem3#1, ULTIMATE.start_main_#t~ite35#1, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet36#1, ~z$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite5#1, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, ULTIMATE.start_main_#t~ite39#1, P2Thread1of1ForFork3_#t~ite4#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~z$r_buff0_thd3~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem37#1] [2022-12-13 12:07:09,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:07:09,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4070 [2022-12-13 12:07:09,916 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 479 flow [2022-12-13 12:07:09,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:09,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:09,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:09,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:07:09,916 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-13 12:07:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:09,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1271195044, now seen corresponding path program 1 times [2022-12-13 12:07:09,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:09,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608539155] [2022-12-13 12:07:09,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:09,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:10,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608539155] [2022-12-13 12:07:10,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608539155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:10,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:10,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:07:10,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627306698] [2022-12-13 12:07:10,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:10,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:07:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:07:10,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:07:10,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-13 12:07:10,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 479 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:10,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:10,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-13 12:07:10,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:10,386 INFO L130 PetriNetUnfolder]: 2228/3506 cut-off events. [2022-12-13 12:07:10,387 INFO L131 PetriNetUnfolder]: For 4146/4146 co-relation queries the response was YES. [2022-12-13 12:07:10,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15115 conditions, 3506 events. 2228/3506 cut-off events. For 4146/4146 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 20199 event pairs, 162 based on Foata normal form. 180/2204 useless extension candidates. Maximal degree in co-relation 15095. Up to 2971 conditions per place. [2022-12-13 12:07:10,401 INFO L137 encePairwiseOnDemand]: 22/40 looper letters, 48 selfloop transitions, 37 changer transitions 0/88 dead transitions. [2022-12-13 12:07:10,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 752 flow [2022-12-13 12:07:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:07:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:07:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 12:07:10,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.515 [2022-12-13 12:07:10,403 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 479 flow. Second operand 5 states and 103 transitions. [2022-12-13 12:07:10,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 752 flow [2022-12-13 12:07:10,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 674 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-13 12:07:10,413 INFO L231 Difference]: Finished difference. Result has 59 places, 73 transitions, 520 flow [2022-12-13 12:07:10,413 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=520, PETRI_PLACES=59, PETRI_TRANSITIONS=73} [2022-12-13 12:07:10,413 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2022-12-13 12:07:10,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:10,413 INFO L89 Accepts]: Start accepts. Operand has 59 places, 73 transitions, 520 flow [2022-12-13 12:07:10,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:10,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:10,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 73 transitions, 520 flow [2022-12-13 12:07:10,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 73 transitions, 520 flow [2022-12-13 12:07:10,561 INFO L130 PetriNetUnfolder]: 1208/2348 cut-off events. [2022-12-13 12:07:10,562 INFO L131 PetriNetUnfolder]: For 1146/1533 co-relation queries the response was YES. [2022-12-13 12:07:10,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9288 conditions, 2348 events. 1208/2348 cut-off events. For 1146/1533 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 17893 event pairs, 81 based on Foata normal form. 5/1371 useless extension candidates. Maximal degree in co-relation 9272. Up to 1657 conditions per place. [2022-12-13 12:07:10,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 73 transitions, 520 flow [2022-12-13 12:07:10,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 512 [2022-12-13 12:07:10,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L882-3-->L887: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_159 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_37|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|} 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 [891] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (= (mod v_~z$r_buff0_thd0~0_212 256) 0))) (let ((.cse1 (not .cse4))) (let ((.cse14 (ite .cse1 0 1))) (let ((.cse6 (= (mod .cse14 256) 0))) (let ((.cse3 (not .cse6))) (let ((.cse7 (= (mod v_~z$w_buff0_used~0_547 256) 0)) (.cse8 (and .cse3 .cse1))) (let ((.cse10 (ite (or (and .cse1 (not .cse7)) .cse8) 0 v_~z$w_buff0_used~0_547))) (let ((.cse5 (select |v_#memory_int_584| |v_~#z~0.base_268|)) (.cse2 (not (= (mod .cse10 256) 0))) (.cse9 (not (= (mod v_~z$r_buff0_thd3~0_254 256) 0))) (.cse0 (not (= (mod v_~z$w_buff0_used~0_546 256) 0)))) (and (= (ite .cse0 0 1) v_~z$r_buff0_thd3~0_253) (= v_~weak$$choice1~0_174 |v_ULTIMATE.start_main_#t~nondet36#1_171|) (= v_~z$r_buff1_thd0~0_198 (ite (or (and .cse1 .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_211 256) 0)))) 0 v_~z$r_buff0_thd0~0_212)) (= v_~main$tmp_guard1~0_100 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_122 1) (= v_~__unbuffered_p3_EAX~0_242 1) (= v_~__unbuffered_p0_EAX~0_120 1) (= v_~__unbuffered_p2_EAX~0_138 1))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_100 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_81|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_81| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_83|) (= |v_P2Thread1of1ForFork3_#in~arg#1.offset_41| |v_P2Thread1of1ForFork3_~arg#1.offset_41|) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_75| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_75|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_83| 0) (= v_~z$r_buff0_thd4~0_311 v_~z$r_buff1_thd4~0_296) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite34#1_226| |v_ULTIMATE.start_main_#t~ite34#1_224|) (= v_~z$w_buff0~0_331 |v_ULTIMATE.start_main_#t~ite35#1_172|) (= |v_ULTIMATE.start_main_#t~mem33#1_229| |v_ULTIMATE.start_main_#t~mem33#1_231|)) (and .cse4 (= (select .cse5 |v_~#z~0.offset_268|) |v_ULTIMATE.start_main_#t~mem33#1_229|) (= |v_ULTIMATE.start_main_#t~ite34#1_224| |v_ULTIMATE.start_main_#t~mem33#1_229|) (= |v_ULTIMATE.start_main_#t~ite34#1_224| |v_ULTIMATE.start_main_#t~ite35#1_172|))) (= v_~z$w_buff0~0_331 1) (= v_~z$w_buff0~0_332 v_~z$w_buff1~0_268) (= (store |v_#memory_int_584| |v_~#z~0.base_268| (store .cse5 |v_~#z~0.offset_268| |v_P2_#t~ite5#1_64|)) |v_#memory_int_583|) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_172| |v_P2_#t~mem3#1_63|) .cse6 (= |v_P2_#t~ite4#1_64| |v_P2_#t~ite5#1_64|) (= |v_P2_#t~mem3#1_63| |v_P2_#t~ite4#1_64|)) (and .cse3 (= |v_P2Thread1of1ForFork3_#t~ite4#1_66| |v_P2_#t~ite4#1_64|) (= v_~z$w_buff0~0_331 |v_P2_#t~ite5#1_64|) (= |v_P2Thread1of1ForFork3_#t~mem3#1_66| |v_P2_#t~mem3#1_63|))) (= v_~y~0_71 v_~__unbuffered_p2_EAX~0_138) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_75| 0)) (= (ite .cse7 1 0) |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_75|) (= v_~z$r_buff0_thd2~0_101 v_~z$r_buff1_thd2~0_101) (= v_~z$r_buff0_thd1~0_99 v_~z$r_buff1_thd1~0_101) (= v_~z$r_buff0_thd0~0_211 (ite .cse8 0 v_~z$r_buff0_thd0~0_212)) (= v_~z$w_buff1_used~0_461 (ite (or (and .cse9 .cse2) .cse0) 0 .cse10)) (let ((.cse12 (= (mod v_~__unbuffered_p3_EAX$read_delayed~0_144 256) 0)) (.cse11 (= |v_ULTIMATE.start_main_#t~mem37#1_279| |v_ULTIMATE.start_main_#t~mem37#1_281|))) (or (and .cse11 (= v_~__unbuffered_p3_EAX~0_243 v_~__unbuffered_p3_EAX~0_242) .cse12 (= |v_ULTIMATE.start_main_#t~ite38#1_276| |v_ULTIMATE.start_main_#t~ite38#1_274|)) (and (not .cse12) (let ((.cse13 (= (mod v_~weak$$choice1~0_174 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite38#1_274| |v_ULTIMATE.start_main_#t~mem37#1_279|) (not .cse13) (= (select (select |v_#memory_int_583| v_~__unbuffered_p3_EAX$read_delayed_var~0.base_145) v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_145) |v_ULTIMATE.start_main_#t~mem37#1_279|)) (and .cse11 (= |v_ULTIMATE.start_main_#t~ite38#1_274| v_~__unbuffered_p3_EAX~0_243) .cse13))) (= |v_ULTIMATE.start_main_#t~ite38#1_274| v_~__unbuffered_p3_EAX~0_242)))) (= v_~z$w_buff0_used~0_546 (ite .cse3 0 .cse14)) (= |v_P2Thread1of1ForFork3_#in~arg#1.base_41| |v_P2Thread1of1ForFork3_~arg#1.base_41|) (= (ite (or (and .cse9 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd3~0_253 256) 0)) .cse0)) 0 v_~z$r_buff0_thd3~0_254) v_~z$r_buff1_thd3~0_172)))))))))) InVars {~#z~0.base=|v_~#z~0.base_268|, P2Thread1of1ForFork3_#t~mem3#1=|v_P2Thread1of1ForFork3_#t~mem3#1_66|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_120, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_212, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_144, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_145, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_311, ~y~0=v_~y~0_71, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_41|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_226|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_171|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_547, ~z$w_buff0~0=v_~z$w_buff0~0_332, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_41|, ~#z~0.offset=|v_~#z~0.offset_268|, P2Thread1of1ForFork3_#t~ite4#1=|v_P2Thread1of1ForFork3_#t~ite4#1_66|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_145, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_231|, #memory_int=|v_#memory_int_584|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_276|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_254, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_99, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_281|} OutVars{~#z~0.base=|v_~#z~0.base_268|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_83|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_296, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_41|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_268, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_100, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_171|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_120, ~weak$$choice1~0=v_~weak$$choice1~0_174, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_211, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ~__unbuffered_p3_EAX$read_delayed~0=v_~__unbuffered_p3_EAX$read_delayed~0_144, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~__unbuffered_p3_EAX$read_delayed_var~0.offset=v_~__unbuffered_p3_EAX$read_delayed_var~0.offset_145, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_242, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_311, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_138, ~y~0=v_~y~0_71, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_41|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_546, ~z$w_buff0~0=v_~z$w_buff0~0_331, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_172, P2Thread1of1ForFork3_#t~ite5#1=|v_P2Thread1of1ForFork3_#t~ite5#1_37|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_41|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_41|, ULTIMATE.start_main_#t~ite39#1=|v_ULTIMATE.start_main_#t~ite39#1_108|, ~#z~0.offset=|v_~#z~0.offset_268|, ~__unbuffered_p3_EAX$read_delayed_var~0.base=v_~__unbuffered_p3_EAX$read_delayed_var~0.base_145, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_81|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_101, #memory_int=|v_#memory_int_583|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_253, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_75|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_99, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_75|} AuxVars[|v_ULTIMATE.start_main_#t~mem33#1_229|, |v_P2_#t~ite5#1_64|, |v_ULTIMATE.start_main_#t~ite34#1_224|, |v_P2_#t~ite4#1_64|, |v_P2_#t~mem3#1_63|, |v_ULTIMATE.start_main_#t~ite38#1_274|, |v_ULTIMATE.start_main_#t~mem37#1_279|, |v_ULTIMATE.start_main_#t~ite35#1_172|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, ~z$r_buff1_thd2~0, ~z$w_buff1~0, ~main$tmp_guard1~0, P2Thread1of1ForFork3_#t~mem3#1, ULTIMATE.start_main_#t~ite35#1, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet36#1, ~z$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite5#1, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, ULTIMATE.start_main_#t~ite39#1, P2Thread1of1ForFork3_#t~ite4#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~z$r_buff0_thd3~0, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem37#1] [2022-12-13 12:07:11,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:07:11,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1464 [2022-12-13 12:07:11,877 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 73 transitions, 532 flow [2022-12-13 12:07:11,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:11,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:11,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:11,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:07:11,878 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-13 12:07:11,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1271270770, now seen corresponding path program 1 times [2022-12-13 12:07:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:11,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215387022] [2022-12-13 12:07:11,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:12,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215387022] [2022-12-13 12:07:12,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215387022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:12,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:12,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:07:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431847767] [2022-12-13 12:07:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:12,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:07:12,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:12,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:07:12,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:07:12,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-13 12:07:12,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 73 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:12,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:12,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-13 12:07:12,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:12,350 INFO L130 PetriNetUnfolder]: 1013/1751 cut-off events. [2022-12-13 12:07:12,350 INFO L131 PetriNetUnfolder]: For 1863/1863 co-relation queries the response was YES. [2022-12-13 12:07:12,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8802 conditions, 1751 events. 1013/1751 cut-off events. For 1863/1863 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 9794 event pairs, 0 based on Foata normal form. 243/1160 useless extension candidates. Maximal degree in co-relation 8783. Up to 1279 conditions per place. [2022-12-13 12:07:12,358 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 33 selfloop transitions, 49 changer transitions 0/85 dead transitions. [2022-12-13 12:07:12,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 772 flow [2022-12-13 12:07:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:07:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:07:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-13 12:07:12,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2022-12-13 12:07:12,359 INFO L175 Difference]: Start difference. First operand has 59 places, 73 transitions, 532 flow. Second operand 6 states and 103 transitions. [2022-12-13 12:07:12,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 772 flow [2022-12-13 12:07:12,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 605 flow, removed 41 selfloop flow, removed 8 redundant places. [2022-12-13 12:07:12,370 INFO L231 Difference]: Finished difference. Result has 57 places, 70 transitions, 496 flow [2022-12-13 12:07:12,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=57, PETRI_TRANSITIONS=70} [2022-12-13 12:07:12,370 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2022-12-13 12:07:12,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:12,370 INFO L89 Accepts]: Start accepts. Operand has 57 places, 70 transitions, 496 flow [2022-12-13 12:07:12,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:12,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:12,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 70 transitions, 496 flow [2022-12-13 12:07:12,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 70 transitions, 496 flow [2022-12-13 12:07:12,426 INFO L130 PetriNetUnfolder]: 668/1295 cut-off events. [2022-12-13 12:07:12,426 INFO L131 PetriNetUnfolder]: For 653/878 co-relation queries the response was YES. [2022-12-13 12:07:12,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4909 conditions, 1295 events. 668/1295 cut-off events. For 653/878 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 8311 event pairs, 0 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 4896. Up to 892 conditions per place. [2022-12-13 12:07:12,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 70 transitions, 496 flow [2022-12-13 12:07:12,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-13 12:07:12,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] $Ultimate##0-->L858: Formula: (let ((.cse4 (= (mod v_~z$r_buff0_thd4~0_274 256) 0))) (let ((.cse0 (not .cse4)) (.cse5 (not (= (mod v_~z$w_buff0_used~0_478 256) 0)))) (let ((.cse1 (and .cse0 .cse5)) (.cse3 (select |v_#memory_int_520| |v_~#z~0.base_242|)) (.cse2 (= (mod v_~z$w_buff0_used~0_479 256) 0))) (and (= v_~z$r_buff0_thd3~0_192 v_~z$r_buff1_thd3~0_134) (= v_~z$r_buff0_thd0~0_171 v_~z$r_buff1_thd0~0_172) (= v_~z$w_buff0~0_281 1) (= v_~z$r_buff0_thd2~0_77 v_~z$r_buff1_thd2~0_77) (= v_~z$w_buff0_used~0_478 (ite .cse0 0 1)) (= |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_~z$w_buff0~0_282 v_~z$w_buff1~0_242) (= v_~z$r_buff0_thd4~0_273 (ite .cse1 0 v_~z$r_buff0_thd4~0_274)) (= v_~z$w_buff1_used~0_417 (ite (or (and (not .cse2) .cse0) .cse1) 0 v_~z$w_buff0_used~0_479)) (= (store |v_#memory_int_520| |v_~#z~0.base_242| (store .cse3 |v_~#z~0.offset_242| |v_P3_#t~ite24_51|)) |v_#memory_int_519|) (or (and (= |v_P3_#t~ite23_61| |v_P3_#t~mem22_64|) (= |v_P3_#t~ite23_61| |v_P3_#t~ite24_51|) (= |v_P3_#t~mem22_64| (select .cse3 |v_~#z~0.offset_242|)) .cse4) (and (= |v_P3_#t~ite24_51| v_~z$w_buff0~0_281) .cse0 (= |v_P3_#t~ite23_61| |v_P3Thread1of1ForFork1_#t~ite23_56|) (= |v_P3Thread1of1ForFork1_#t~mem22_56| |v_P3_#t~mem22_64|))) (= v_~z$r_buff0_thd3~0_191 1) (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_51| |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_51|) (= v_~y~0_51 v_~__unbuffered_p2_EAX~0_118) (= (ite .cse2 1 0) |v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_51|) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_273 256) 0)) .cse5) (and .cse0 (not (= 0 (mod v_~z$w_buff1_used~0_417 256))))) 0 v_~z$r_buff0_thd4~0_274) v_~z$r_buff1_thd4~0_266) (= v_~z$r_buff0_thd1~0_75 v_~z$r_buff1_thd1~0_77) (not (= |v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_51| 0)))))) InVars {~#z~0.base=|v_~#z~0.base_242|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_479, ~z$w_buff0~0=v_~z$w_buff0~0_282, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_21|, ~#z~0.offset=|v_~#z~0.offset_242|, P3Thread1of1ForFork1_#t~mem22=|v_P3Thread1of1ForFork1_#t~mem22_56|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_171, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_274, #memory_int=|v_#memory_int_520|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_192, P3Thread1of1ForFork1_#t~ite23=|v_P3Thread1of1ForFork1_#t~ite23_56|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_75, ~y~0=v_~y~0_51, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_77, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_21|} OutVars{~#z~0.base=|v_~#z~0.base_242|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_266, P2Thread1of1ForFork3_~arg#1.offset=|v_P2Thread1of1ForFork3_~arg#1.offset_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_77, ~z$w_buff1~0=v_~z$w_buff1~0_242, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_171, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_172, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_273, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_118, ~y~0=v_~y~0_51, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_77, P2Thread1of1ForFork3_#in~arg#1.base=|v_P2Thread1of1ForFork3_#in~arg#1.base_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_478, ~z$w_buff0~0=v_~z$w_buff0~0_281, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_417, P2Thread1of1ForFork3_~arg#1.base=|v_P2Thread1of1ForFork3_~arg#1.base_21|, P2Thread1of1ForFork3_#in~arg#1.offset=|v_P2Thread1of1ForFork3_#in~arg#1.offset_21|, ~#z~0.offset=|v_~#z~0.offset_242|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, #memory_int=|v_#memory_int_519|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_191, P3Thread1of1ForFork1_#t~ite24=|v_P3Thread1of1ForFork1_#t~ite24_30|, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_~expression#1_51|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_75, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_51|} AuxVars[|v_P3_#t~mem22_64|, |v_P3_#t~ite24_51|, |v_P3_#t~ite23_61|] AssignedVars[~z$r_buff1_thd4~0, P2Thread1of1ForFork3_~arg#1.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P2Thread1of1ForFork3_~arg#1.base, ~z$w_buff1~0, P3Thread1of1ForFork1_#t~mem22, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, #memory_int, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, P3Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork3___VERIFIER_assert_~expression#1, P3Thread1of1ForFork1_#t~ite23, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1] 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-13 12:07:14,428 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:07:14,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2059 [2022-12-13 12:07:14,429 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 67 transitions, 490 flow [2022-12-13 12:07:14,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:14,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:14,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:14,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:07:14,429 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-13 12:07:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:14,430 INFO L85 PathProgramCache]: Analyzing trace with hash -46008693, now seen corresponding path program 1 times [2022-12-13 12:07:14,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:14,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135855496] [2022-12-13 12:07:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:07:14,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:07:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:07:14,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:07:14,654 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:07:14,655 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 12:07:14,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 12:07:14,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 12:07:14,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 12:07:14,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 12:07:14,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 12:07:14,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 12:07:14,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:07:14,660 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:14,664 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:07:14,664 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:07:14,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:07:14 BasicIcfg [2022-12-13 12:07:14,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:07:14,729 INFO L158 Benchmark]: Toolchain (without parser) took 59334.28ms. Allocated memory was 219.2MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 194.2MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 301.3MB. Max. memory is 8.0GB. [2022-12-13 12:07:14,729 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 219.2MB. Free memory is still 195.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:07:14,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.18ms. Allocated memory is still 219.2MB. Free memory was 193.6MB in the beginning and 165.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 12:07:14,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.30ms. Allocated memory is still 219.2MB. Free memory was 165.3MB in the beginning and 162.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:07:14,730 INFO L158 Benchmark]: Boogie Preprocessor took 34.13ms. Allocated memory is still 219.2MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:07:14,730 INFO L158 Benchmark]: RCFGBuilder took 847.27ms. Allocated memory is still 219.2MB. Free memory was 160.6MB in the beginning and 88.7MB in the end (delta: 71.8MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB. [2022-12-13 12:07:14,730 INFO L158 Benchmark]: TraceAbstraction took 57911.55ms. Allocated memory was 219.2MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 87.7MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 194.3MB. Max. memory is 8.0GB. [2022-12-13 12:07:14,732 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.10ms. Allocated memory is still 219.2MB. Free memory is still 195.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 497.18ms. Allocated memory is still 219.2MB. Free memory was 193.6MB in the beginning and 165.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.30ms. Allocated memory is still 219.2MB. Free memory was 165.3MB in the beginning and 162.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.13ms. Allocated memory is still 219.2MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 847.27ms. Allocated memory is still 219.2MB. Free memory was 160.6MB in the beginning and 88.7MB in the end (delta: 71.8MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB. * TraceAbstraction took 57911.55ms. Allocated memory was 219.2MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 87.7MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 194.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6s, 156 PlacesBefore, 83 PlacesAfterwards, 145 TransitionsBefore, 71 TransitionsAfterwards, 2750 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 121 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4388, independent: 4235, independent conditional: 4235, independent unconditional: 0, dependent: 153, dependent conditional: 153, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4388, independent: 4235, independent conditional: 0, independent unconditional: 4235, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4388, independent: 4235, independent conditional: 0, independent unconditional: 4235, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4388, independent: 4235, independent conditional: 0, independent unconditional: 4235, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2528, independent: 2485, independent conditional: 0, independent unconditional: 2485, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2528, independent: 2472, independent conditional: 0, independent unconditional: 2472, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 263, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4388, independent: 1750, independent conditional: 0, independent unconditional: 1750, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 2528, unknown conditional: 0, unknown unconditional: 2528] , Statistics on independence cache: Total cache size (in pairs): 4816, Positive cache size: 4773, Positive conditional cache size: 0, Positive unconditional cache size: 4773, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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.3s, 50 PlacesBefore, 50 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 556, independent: 516, independent conditional: 516, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 556, independent: 516, independent conditional: 48, independent unconditional: 468, dependent: 37, dependent conditional: 4, dependent unconditional: 33, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 556, independent: 516, independent conditional: 48, independent unconditional: 468, dependent: 37, dependent conditional: 4, dependent unconditional: 33, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 556, independent: 516, independent conditional: 48, independent unconditional: 468, dependent: 37, dependent conditional: 4, dependent unconditional: 33, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 437, independent: 409, independent conditional: 38, independent unconditional: 371, dependent: 27, dependent conditional: 4, dependent unconditional: 23, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 437, independent: 319, independent conditional: 0, independent unconditional: 319, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 118, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 27, dependent conditional: 4, dependent unconditional: 23, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 305, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 196, dependent conditional: 38, dependent unconditional: 158, unknown: 11, unknown conditional: 0, unknown unconditional: 11] ], Cache Queries: [ total: 556, independent: 107, independent conditional: 10, independent unconditional: 97, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 439, unknown conditional: 42, unknown unconditional: 397] , Statistics on independence cache: Total cache size (in pairs): 436, Positive cache size: 409, Positive conditional cache size: 38, Positive unconditional cache size: 371, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 474, independent: 436, independent conditional: 436, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 474, independent: 436, independent conditional: 20, independent unconditional: 416, dependent: 35, dependent conditional: 4, dependent unconditional: 31, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 474, independent: 436, independent conditional: 0, independent unconditional: 436, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 474, independent: 436, independent conditional: 0, independent unconditional: 436, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 54, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 474, independent: 389, independent conditional: 0, independent unconditional: 389, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 57, unknown conditional: 0, unknown unconditional: 57] , Statistics on independence cache: Total cache size (in pairs): 490, Positive cache size: 456, Positive conditional cache size: 38, Positive unconditional cache size: 418, Negative cache size: 34, Negative conditional cache size: 4, Negative unconditional cache size: 30, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 892 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 464, independent: 427, independent conditional: 427, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 464, independent: 427, independent conditional: 28, independent unconditional: 399, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 464, independent: 427, independent conditional: 0, independent unconditional: 427, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 464, independent: 427, independent conditional: 0, independent unconditional: 427, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 464, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 502, Positive cache size: 468, Positive conditional cache size: 38, Positive unconditional cache size: 430, Negative cache size: 34, Negative conditional cache size: 4, Negative unconditional cache size: 30, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 55 PlacesBefore, 54 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 786 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 931, independent: 862, independent conditional: 862, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 931, independent: 862, independent conditional: 71, independent unconditional: 791, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 931, independent: 862, independent conditional: 0, independent unconditional: 862, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 931, independent: 862, independent conditional: 0, independent unconditional: 862, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 37, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 931, independent: 825, independent conditional: 0, independent unconditional: 825, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 43, unknown conditional: 0, unknown unconditional: 43] , Statistics on independence cache: Total cache size (in pairs): 543, Positive cache size: 509, Positive conditional cache size: 38, Positive unconditional cache size: 471, Negative cache size: 34, Negative conditional cache size: 4, Negative unconditional cache size: 30, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 71, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 314, independent: 281, independent conditional: 281, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 314, independent: 281, independent conditional: 12, independent unconditional: 269, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 314, independent: 281, independent conditional: 0, independent unconditional: 281, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 314, independent: 281, independent conditional: 0, independent unconditional: 281, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 314, independent: 272, independent conditional: 0, independent unconditional: 272, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 518, Positive conditional cache size: 38, Positive unconditional cache size: 480, Negative cache size: 36, Negative conditional cache size: 4, Negative unconditional cache size: 32, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 55 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 627, independent: 568, independent conditional: 568, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 627, independent: 568, independent conditional: 57, independent unconditional: 511, dependent: 59, dependent conditional: 8, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 627, independent: 568, independent conditional: 0, independent unconditional: 568, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 627, independent: 568, independent conditional: 0, independent unconditional: 568, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 627, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 592, Positive cache size: 552, Positive conditional cache size: 40, Positive unconditional cache size: 512, Negative cache size: 40, Negative conditional cache size: 4, Negative unconditional cache size: 36, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 65, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 52 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 395, independent: 345, independent conditional: 345, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 395, independent: 345, independent conditional: 57, independent unconditional: 288, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 395, independent: 345, independent conditional: 0, independent unconditional: 345, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 395, independent: 345, independent conditional: 0, independent unconditional: 345, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 395, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 625, Positive cache size: 583, Positive conditional cache size: 42, Positive unconditional cache size: 541, Negative cache size: 42, Negative conditional cache size: 4, Negative unconditional cache size: 38, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 57, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 53 PlacesBefore, 52 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 145, independent: 129, independent conditional: 83, independent unconditional: 46, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, independent: 129, independent conditional: 43, independent unconditional: 86, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, independent: 129, independent conditional: 43, independent unconditional: 86, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 11, independent unconditional: 3, 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: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, independent: 115, independent conditional: 32, independent unconditional: 83, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 14, unknown conditional: 11, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 726, Positive conditional cache size: 53, Positive unconditional cache size: 673, Negative cache size: 42, Negative conditional cache size: 4, Negative unconditional cache size: 38, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 57 PlacesBefore, 55 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 108, independent conditional: 108, 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: 129, independent: 108, independent conditional: 58, independent unconditional: 50, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 129, independent: 108, independent conditional: 34, independent unconditional: 74, 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: 129, independent: 108, independent conditional: 34, independent unconditional: 74, 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: 3, independent: 2, independent conditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 129, independent: 106, independent conditional: 32, independent unconditional: 74, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 873, Positive cache size: 830, Positive conditional cache size: 55, Positive unconditional cache size: 775, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 57 PlacesBefore, 57 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, independent: 160, independent conditional: 160, 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: 197, independent: 160, independent conditional: 50, independent unconditional: 110, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 197, independent: 160, independent conditional: 50, independent unconditional: 110, 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: 197, independent: 160, independent conditional: 50, independent unconditional: 110, 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: 13, independent: 13, independent conditional: 2, independent unconditional: 11, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 197, independent: 147, independent conditional: 48, independent unconditional: 99, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 938, Positive cache size: 895, Positive conditional cache size: 57, Positive unconditional cache size: 838, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 63 PlacesBefore, 62 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 51, independent conditional: 9, independent unconditional: 42, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 28, dependent conditional: 0, dependent unconditional: 28, 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: 79, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 966, Positive cache size: 923, Positive conditional cache size: 57, Positive unconditional cache size: 866, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 59 PlacesBefore, 58 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 982, Positive cache size: 939, Positive conditional cache size: 57, Positive unconditional cache size: 882, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 60 PlacesBefore, 60 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 16, independent unconditional: 16, 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: 32, independent: 32, independent conditional: 8, independent unconditional: 24, 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: 32, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 31, independent conditional: 8, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1001, Positive cache size: 958, Positive conditional cache size: 58, Positive unconditional cache size: 900, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 59 PlacesBefore, 59 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1017, Positive cache size: 974, Positive conditional cache size: 59, Positive unconditional cache size: 915, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 57 PlacesBefore, 54 PlacesAfterwards, 70 TransitionsBefore, 67 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 27, independent unconditional: 1, 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: 28, independent: 28, independent conditional: 27, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 27, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 28, independent: 28, independent conditional: 27, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1041, Positive cache size: 998, Positive conditional cache size: 60, Positive unconditional cache size: 938, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, 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))=-2, 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))=-1, t2709={7:0}, t2710={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] [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))=0, t2709={7:0}, t2710={8:0}, t2711={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] [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))=1, t2709={7:0}, t2710={8:0}, t2711={5:0}, t2712={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] [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 [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 [L771] 4 __unbuffered_p0_EAX = a [L774] 4 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, 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] [L786] 2 __unbuffered_p1_EAX = x [L789] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __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=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}, 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=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] [L801] 3 __unbuffered_p2_EAX = y [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 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 VAL [__unbuffered_cnt=1, __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}, 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] [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; VAL [\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=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] [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)=1, \old(expression)=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=0, expression=1, 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: 57.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 508 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1370 IncrementalHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 3 mSDtfsCounter, 1370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=14, InterpolantAutomatonStates: 62, 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.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 1623 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-13 12:07:14,767 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...