/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:53:17,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:53:17,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:53:17,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:53:17,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:53:17,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:53:17,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:53:17,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:53:17,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:53:17,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:53:17,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:53:17,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:53:17,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:53:17,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:53:17,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:53:17,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:53:17,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:53:17,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:53:17,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:53:17,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:53:17,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:53:17,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:53:17,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:53:17,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:53:17,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:53:17,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:53:17,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:53:17,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:53:17,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:53:17,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:53:17,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:53:17,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:53:17,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:53:17,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:53:17,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:53:17,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:53:17,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:53:17,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:53:17,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:53:17,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:53:17,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:53:17,715 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-NoLbe.epf [2022-12-12 11:53:17,747 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:53:17,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:53:17,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:53:17,749 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:53:17,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:53:17,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:53:17,750 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:53:17,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:53:17,750 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:53:17,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:53:17,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:53:17,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:53:17,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:53:17,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:53:17,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:53:17,752 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:53:17,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:53:17,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:53:17,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:53:17,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:53:17,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:53:17,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:53:17,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:53:17,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:53:17,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:53:17,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:53:17,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:53:17,754 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:53:17,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:53:17,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:53:17,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:53:17,754 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:53:18,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:53:18,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:53:18,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:53:18,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:53:18,070 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:53:18,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2022-12-12 11:53:19,265 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:53:19,530 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:53:19,530 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2022-12-12 11:53:19,542 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49f3b105/86b64b50917a4748b13d002afa0de37c/FLAG4885f3a9f [2022-12-12 11:53:19,556 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49f3b105/86b64b50917a4748b13d002afa0de37c [2022-12-12 11:53:19,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:53:19,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:53:19,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:53:19,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:53:19,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:53:19,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:53:19" (1/1) ... [2022-12-12 11:53:19,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fce6daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:19, skipping insertion in model container [2022-12-12 11:53:19,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:53:19" (1/1) ... [2022-12-12 11:53:19,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:53:19,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:53:19,753 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/mix035.oepc.i[945,958] [2022-12-12 11:53:19,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:19,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:19,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:53:19,967 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:53:19,979 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/mix035.oepc.i[945,958] [2022-12-12 11:53:20,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:20,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:20,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:53:20,078 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:53:20,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20 WrapperNode [2022-12-12 11:53:20,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:53:20,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:53:20,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:53:20,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:53:20,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,127 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-12 11:53:20,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:53:20,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:53:20,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:53:20,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:53:20,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,161 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:53:20,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:53:20,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:53:20,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:53:20,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:53:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:53:20,197 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-12 11:53:20,199 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-12 11:53:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:53:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:53:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:53:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:53:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:53:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 11:53:20,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 11:53:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 11:53:20,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 11:53:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 11:53:20,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 11:53:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:53:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:53:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:53:20,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:53:20,230 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:53:20,346 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:53:20,349 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:53:20,688 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:53:20,873 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:53:20,874 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 11:53:20,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:53:20 BoogieIcfgContainer [2022-12-12 11:53:20,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:53:20,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:53:20,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:53:20,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:53:20,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:53:19" (1/3) ... [2022-12-12 11:53:20,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e64379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:53:20, skipping insertion in model container [2022-12-12 11:53:20,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20" (2/3) ... [2022-12-12 11:53:20,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e64379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:53:20, skipping insertion in model container [2022-12-12 11:53:20,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:53:20" (3/3) ... [2022-12-12 11:53:20,889 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035.oepc.i [2022-12-12 11:53:20,907 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:53:20,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:53:20,909 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:53:20,984 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:53:21,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-12 11:53:21,078 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-12 11:53:21,079 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:53:21,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 11:53:21,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-12 11:53:21,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-12 11:53:21,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:53:21,112 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=PETRI_NET, 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;@5a650262, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:53:21,113 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 11:53:21,131 INFO L130 PetriNetUnfolder]: 0/46 cut-off events. [2022-12-12 11:53:21,132 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:53:21,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:21,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:21,134 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:21,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 330257995, now seen corresponding path program 1 times [2022-12-12 11:53:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:21,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445089277] [2022-12-12 11:53:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:21,773 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-12 11:53:21,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:21,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445089277] [2022-12-12 11:53:21,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445089277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:21,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:21,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:53:21,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12211668] [2022-12-12 11:53:21,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:21,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:53:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:21,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:53:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:53:21,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2022-12-12 11:53:21,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-12 11:53:21,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:21,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2022-12-12 11:53:21,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:22,014 INFO L130 PetriNetUnfolder]: 58/316 cut-off events. [2022-12-12 11:53:22,015 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-12 11:53:22,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 316 events. 58/316 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1382 event pairs, 44 based on Foata normal form. 22/315 useless extension candidates. Maximal degree in co-relation 393. Up to 79 conditions per place. [2022-12-12 11:53:22,021 INFO L137 encePairwiseOnDemand]: 108/113 looper letters, 14 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-12-12 11:53:22,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 271 flow [2022-12-12 11:53:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:53:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:53:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-12-12 11:53:22,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-12-12 11:53:22,040 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2022-12-12 11:53:22,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 271 flow [2022-12-12 11:53:22,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-12 11:53:22,047 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 264 flow [2022-12-12 11:53:22,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-12 11:53:22,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:22,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:22,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:53:22,049 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:22,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1363360010, now seen corresponding path program 1 times [2022-12-12 11:53:22,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:22,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167906129] [2022-12-12 11:53:22,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:22,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:22,455 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-12 11:53:22,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:22,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167906129] [2022-12-12 11:53:22,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167906129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:22,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:22,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:53:22,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814250448] [2022-12-12 11:53:22,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:22,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:53:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:53:22,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:53:22,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-12-12 11:53:22,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-12 11:53:22,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:22,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-12-12 11:53:22,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:22,953 INFO L130 PetriNetUnfolder]: 488/1330 cut-off events. [2022-12-12 11:53:22,953 INFO L131 PetriNetUnfolder]: For 420/574 co-relation queries the response was YES. [2022-12-12 11:53:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 1330 events. 488/1330 cut-off events. For 420/574 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9283 event pairs, 74 based on Foata normal form. 0/1296 useless extension candidates. Maximal degree in co-relation 2597. Up to 411 conditions per place. [2022-12-12 11:53:22,963 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 27 selfloop transitions, 2 changer transitions 58/166 dead transitions. [2022-12-12 11:53:22,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 166 transitions, 612 flow [2022-12-12 11:53:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:53:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:53:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 879 transitions. [2022-12-12 11:53:22,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8643067846607669 [2022-12-12 11:53:22,968 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 5 predicate places. [2022-12-12 11:53:22,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 166 transitions, 612 flow [2022-12-12 11:53:22,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 166 transitions, 608 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-12 11:53:22,972 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 166 transitions, 608 flow [2022-12-12 11:53:22,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-12 11:53:22,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:22,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:22,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:53:22,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash -612837620, now seen corresponding path program 1 times [2022-12-12 11:53:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:22,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339530653] [2022-12-12 11:53:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:23,156 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-12 11:53:23,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:23,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339530653] [2022-12-12 11:53:23,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339530653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:23,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:23,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:53:23,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173858670] [2022-12-12 11:53:23,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:23,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:53:23,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:23,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:53:23,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:53:23,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-12-12 11:53:23,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 166 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 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-12 11:53:23,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:23,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-12-12 11:53:23,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:23,791 INFO L130 PetriNetUnfolder]: 1504/3326 cut-off events. [2022-12-12 11:53:23,791 INFO L131 PetriNetUnfolder]: For 2955/3046 co-relation queries the response was YES. [2022-12-12 11:53:23,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8184 conditions, 3326 events. 1504/3326 cut-off events. For 2955/3046 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 25027 event pairs, 34 based on Foata normal form. 1/3221 useless extension candidates. Maximal degree in co-relation 8130. Up to 1136 conditions per place. [2022-12-12 11:53:23,814 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 74 selfloop transitions, 6 changer transitions 94/272 dead transitions. [2022-12-12 11:53:23,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 272 transitions, 1478 flow [2022-12-12 11:53:23,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:53:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:53:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 979 transitions. [2022-12-12 11:53:23,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8663716814159292 [2022-12-12 11:53:23,819 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2022-12-12 11:53:23,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 272 transitions, 1478 flow [2022-12-12 11:53:23,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 272 transitions, 1474 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-12 11:53:23,827 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 272 transitions, 1474 flow [2022-12-12 11:53:23,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 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-12 11:53:23,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:23,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:23,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:53:23,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash 238311747, now seen corresponding path program 1 times [2022-12-12 11:53:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:23,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754629362] [2022-12-12 11:53:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:24,115 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-12 11:53:24,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:24,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754629362] [2022-12-12 11:53:24,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754629362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:24,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:24,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:53:24,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181618774] [2022-12-12 11:53:24,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:24,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:53:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:24,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:53:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:53:24,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-12-12 11:53:24,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 272 transitions, 1474 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-12 11:53:24,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:24,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-12-12 11:53:24,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:24,762 INFO L130 PetriNetUnfolder]: 1124/2381 cut-off events. [2022-12-12 11:53:24,762 INFO L131 PetriNetUnfolder]: For 2846/3707 co-relation queries the response was YES. [2022-12-12 11:53:24,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7640 conditions, 2381 events. 1124/2381 cut-off events. For 2846/3707 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16454 event pairs, 27 based on Foata normal form. 262/2592 useless extension candidates. Maximal degree in co-relation 7584. Up to 799 conditions per place. [2022-12-12 11:53:24,773 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 55 selfloop transitions, 9 changer transitions 211/361 dead transitions. [2022-12-12 11:53:24,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 361 transitions, 2530 flow [2022-12-12 11:53:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:53:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:53:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1276 transitions. [2022-12-12 11:53:24,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8686181075561606 [2022-12-12 11:53:24,778 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2022-12-12 11:53:24,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 361 transitions, 2530 flow [2022-12-12 11:53:24,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 361 transitions, 2356 flow, removed 79 selfloop flow, removed 4 redundant places. [2022-12-12 11:53:24,787 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 361 transitions, 2356 flow [2022-12-12 11:53:24,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-12 11:53:24,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:24,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:24,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:53:24,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:24,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2027808034, now seen corresponding path program 1 times [2022-12-12 11:53:24,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:24,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432688854] [2022-12-12 11:53:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:25,456 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-12 11:53:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:25,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432688854] [2022-12-12 11:53:25,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432688854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:25,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:25,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 11:53:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578630853] [2022-12-12 11:53:25,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:25,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 11:53:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:25,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 11:53:25,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-12 11:53:25,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 113 [2022-12-12 11:53:25,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 361 transitions, 2356 flow. Second operand has 9 states, 9 states have (on average 82.88888888888889) internal successors, (746), 9 states have internal predecessors, (746), 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-12 11:53:25,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:25,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 113 [2022-12-12 11:53:25,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:25,851 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L805-->L821: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd3~0_58 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd3~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse3 .cse6)) (.cse9 (and (= (mod v_~a$w_buff1_used~0_111 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_118 256) 0))) (let ((.cse10 (or .cse7 .cse9 .cse12)) (.cse11 (and .cse8 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_110 256) 0)) (.cse0 (ite .cse10 v_~a~0_79 (ite .cse11 v_~a$w_buff0~0_58 v_~a$w_buff1~0_49))) (.cse4 (= (mod v_~a$w_buff0_used~0_117 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_58 v_~a$w_buff0~0_57) (= v_~a$flush_delayed~0_19 0) (= v_~__unbuffered_p2_EBX~0_12 .cse0) (= (ite .cse1 v_~a$r_buff1_thd3~0_58 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd3~0_61 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) v_~a$r_buff1_thd3~0_58 0)) v_~a$r_buff1_thd3~0_57) (= v_~a$r_buff0_thd3~0_61 (ite .cse1 v_~a$r_buff0_thd3~0_62 (ite (or (and .cse5 .cse6) .cse7 .cse4) v_~a$r_buff0_thd3~0_62 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd3~0_62)))) (= v_~a~0_78 (ite .cse1 v_~a$mem_tmp~0_16 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_111 (ite (or .cse7 .cse9 .cse4) v_~a$w_buff1_used~0_111 0)) v_~a$w_buff1_used~0_110) (= v_~a~0_79 v_~a$mem_tmp~0_16) (= (ite .cse1 v_~a$w_buff0_used~0_118 (ite .cse10 v_~a$w_buff0_used~0_118 (ite .cse11 0 v_~a$w_buff0_used~0_118))) v_~a$w_buff0_used~0_117) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_48) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30)))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_58, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_118, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_117, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~a~0=v_~a~0_78, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$flush_delayed~0=v_~a$flush_delayed~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_57, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet4, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][152], [57#L3true, 124#true, 185#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 49#L759true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 19#L821true, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 68#L782true]) [2022-12-12 11:53:25,851 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-12 11:53:25,852 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-12 11:53:25,852 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-12 11:53:25,852 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-12 11:53:25,852 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([344] L782-->L789: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_99 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_99) v_~a$w_buff1_used~0_98) (= v_~a$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_98 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0)))) 0 v_~a$r_buff1_thd2~0_24)) (= v_~a~0_66 (ite .cse0 v_~a$w_buff0~0_51 (ite .cse2 v_~a$w_buff1~0_42 v_~a~0_67))) (= v_~a$r_buff0_thd2~0_25 (ite .cse1 0 v_~a$r_buff0_thd2~0_26))))) InVars {~a~0=v_~a~0_67, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_24, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_99} OutVars{~a~0=v_~a~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_23, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_98} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][225], [57#L3true, 124#true, 49#L759true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 6#L789true, 13#L805true, P1Thread1of1ForFork2InUse, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 184#(= ~a$r_buff0_thd3~0 0)]) [2022-12-12 11:53:25,852 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-12 11:53:25,852 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-12 11:53:25,852 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-12 11:53:25,853 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-12 11:53:25,905 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L805-->L821: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd3~0_58 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd3~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse3 .cse6)) (.cse9 (and (= (mod v_~a$w_buff1_used~0_111 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_118 256) 0))) (let ((.cse10 (or .cse7 .cse9 .cse12)) (.cse11 (and .cse8 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_110 256) 0)) (.cse0 (ite .cse10 v_~a~0_79 (ite .cse11 v_~a$w_buff0~0_58 v_~a$w_buff1~0_49))) (.cse4 (= (mod v_~a$w_buff0_used~0_117 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_58 v_~a$w_buff0~0_57) (= v_~a$flush_delayed~0_19 0) (= v_~__unbuffered_p2_EBX~0_12 .cse0) (= (ite .cse1 v_~a$r_buff1_thd3~0_58 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd3~0_61 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) v_~a$r_buff1_thd3~0_58 0)) v_~a$r_buff1_thd3~0_57) (= v_~a$r_buff0_thd3~0_61 (ite .cse1 v_~a$r_buff0_thd3~0_62 (ite (or (and .cse5 .cse6) .cse7 .cse4) v_~a$r_buff0_thd3~0_62 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd3~0_62)))) (= v_~a~0_78 (ite .cse1 v_~a$mem_tmp~0_16 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_111 (ite (or .cse7 .cse9 .cse4) v_~a$w_buff1_used~0_111 0)) v_~a$w_buff1_used~0_110) (= v_~a~0_79 v_~a$mem_tmp~0_16) (= (ite .cse1 v_~a$w_buff0_used~0_118 (ite .cse10 v_~a$w_buff0_used~0_118 (ite .cse11 0 v_~a$w_buff0_used~0_118))) v_~a$w_buff0_used~0_117) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_48) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30)))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_58, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_118, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_117, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~a~0=v_~a~0_78, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$flush_delayed~0=v_~a$flush_delayed~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_57, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet4, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][152], [57#L3true, 124#true, 185#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 76#L762true, P1Thread1of1ForFork2InUse, 19#L821true, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 68#L782true]) [2022-12-12 11:53:25,905 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,905 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,905 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,905 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,906 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([344] L782-->L789: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_99 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_99) v_~a$w_buff1_used~0_98) (= v_~a$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_98 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0)))) 0 v_~a$r_buff1_thd2~0_24)) (= v_~a~0_66 (ite .cse0 v_~a$w_buff0~0_51 (ite .cse2 v_~a$w_buff1~0_42 v_~a~0_67))) (= v_~a$r_buff0_thd2~0_25 (ite .cse1 0 v_~a$r_buff0_thd2~0_26))))) InVars {~a~0=v_~a~0_67, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_24, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_99} OutVars{~a~0=v_~a~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_23, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_98} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][225], [57#L3true, 124#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 6#L789true, 76#L762true, 13#L805true, P1Thread1of1ForFork2InUse, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 184#(= ~a$r_buff0_thd3~0 0)]) [2022-12-12 11:53:25,906 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,906 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,906 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,906 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,910 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L805-->L821: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd3~0_58 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd3~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse3 .cse6)) (.cse9 (and (= (mod v_~a$w_buff1_used~0_111 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_118 256) 0))) (let ((.cse10 (or .cse7 .cse9 .cse12)) (.cse11 (and .cse8 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_110 256) 0)) (.cse0 (ite .cse10 v_~a~0_79 (ite .cse11 v_~a$w_buff0~0_58 v_~a$w_buff1~0_49))) (.cse4 (= (mod v_~a$w_buff0_used~0_117 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_58 v_~a$w_buff0~0_57) (= v_~a$flush_delayed~0_19 0) (= v_~__unbuffered_p2_EBX~0_12 .cse0) (= (ite .cse1 v_~a$r_buff1_thd3~0_58 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd3~0_61 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) v_~a$r_buff1_thd3~0_58 0)) v_~a$r_buff1_thd3~0_57) (= v_~a$r_buff0_thd3~0_61 (ite .cse1 v_~a$r_buff0_thd3~0_62 (ite (or (and .cse5 .cse6) .cse7 .cse4) v_~a$r_buff0_thd3~0_62 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd3~0_62)))) (= v_~a~0_78 (ite .cse1 v_~a$mem_tmp~0_16 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_111 (ite (or .cse7 .cse9 .cse4) v_~a$w_buff1_used~0_111 0)) v_~a$w_buff1_used~0_110) (= v_~a~0_79 v_~a$mem_tmp~0_16) (= (ite .cse1 v_~a$w_buff0_used~0_118 (ite .cse10 v_~a$w_buff0_used~0_118 (ite .cse11 0 v_~a$w_buff0_used~0_118))) v_~a$w_buff0_used~0_117) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_48) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30)))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_58, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_118, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_117, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~a~0=v_~a~0_78, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$flush_delayed~0=v_~a$flush_delayed~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_57, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet4, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][152], [112#L3-1true, 124#true, 185#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 49#L759true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 19#L821true, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 68#L782true]) [2022-12-12 11:53:25,910 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,911 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,911 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,911 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,911 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([344] L782-->L789: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_99 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_99) v_~a$w_buff1_used~0_98) (= v_~a$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_98 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0)))) 0 v_~a$r_buff1_thd2~0_24)) (= v_~a~0_66 (ite .cse0 v_~a$w_buff0~0_51 (ite .cse2 v_~a$w_buff1~0_42 v_~a~0_67))) (= v_~a$r_buff0_thd2~0_25 (ite .cse1 0 v_~a$r_buff0_thd2~0_26))))) InVars {~a~0=v_~a~0_67, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_24, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_99} OutVars{~a~0=v_~a~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_23, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_98} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][225], [112#L3-1true, 124#true, 49#L759true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 6#L789true, 13#L805true, P1Thread1of1ForFork2InUse, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 184#(= ~a$r_buff0_thd3~0 0)]) [2022-12-12 11:53:25,911 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,912 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,912 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,912 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:53:25,950 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([352] L805-->L821: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd3~0_58 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd3~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse3 .cse6)) (.cse9 (and (= (mod v_~a$w_buff1_used~0_111 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_118 256) 0))) (let ((.cse10 (or .cse7 .cse9 .cse12)) (.cse11 (and .cse8 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_110 256) 0)) (.cse0 (ite .cse10 v_~a~0_79 (ite .cse11 v_~a$w_buff0~0_58 v_~a$w_buff1~0_49))) (.cse4 (= (mod v_~a$w_buff0_used~0_117 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_58 v_~a$w_buff0~0_57) (= v_~a$flush_delayed~0_19 0) (= v_~__unbuffered_p2_EBX~0_12 .cse0) (= (ite .cse1 v_~a$r_buff1_thd3~0_58 (ite (let ((.cse2 (= (mod v_~a$r_buff0_thd3~0_61 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) v_~a$r_buff1_thd3~0_58 0)) v_~a$r_buff1_thd3~0_57) (= v_~a$r_buff0_thd3~0_61 (ite .cse1 v_~a$r_buff0_thd3~0_62 (ite (or (and .cse5 .cse6) .cse7 .cse4) v_~a$r_buff0_thd3~0_62 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd3~0_62)))) (= v_~a~0_78 (ite .cse1 v_~a$mem_tmp~0_16 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_111 (ite (or .cse7 .cse9 .cse4) v_~a$w_buff1_used~0_111 0)) v_~a$w_buff1_used~0_110) (= v_~a~0_79 v_~a$mem_tmp~0_16) (= (ite .cse1 v_~a$w_buff0_used~0_118 (ite .cse10 v_~a$w_buff0_used~0_118 (ite .cse11 0 v_~a$w_buff0_used~0_118))) v_~a$w_buff0_used~0_117) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_48) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30)))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_58, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_118, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_117, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~a~0=v_~a~0_78, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$flush_delayed~0=v_~a$flush_delayed~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_57, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet4, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][152], [112#L3-1true, 124#true, 185#(and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 76#L762true, P1Thread1of1ForFork2InUse, 19#L821true, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 68#L782true]) [2022-12-12 11:53:25,950 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-12 11:53:25,950 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:25,950 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:25,951 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:25,951 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_29 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_121 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_115 256) 0)) .cse2)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_122 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~a$r_buff0_thd1~0_29) v_~a$r_buff0_thd1~0_28) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_28 256) 0)) .cse1) (and (not (= (mod v_~a$w_buff1_used~0_114 256) 0)) .cse2)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19) (= (ite (or .cse0 .cse3) 0 v_~a$w_buff1_used~0_115) v_~a$w_buff1_used~0_114) (= v_~a~0_82 (ite .cse4 v_~a$w_buff0~0_61 (ite .cse3 v_~a$w_buff1~0_52 v_~a~0_83))) (= (ite .cse4 0 v_~a$w_buff0_used~0_122) v_~a$w_buff0_used~0_121)))) InVars {~a~0=v_~a~0_83, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_122, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_115} OutVars{~a~0=v_~a~0_82, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_121, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_114} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][165], [57#L3true, 124#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 13#L805true, 186#(and (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), P1Thread1of1ForFork2InUse, 36#L769true, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 68#L782true]) [2022-12-12 11:53:25,951 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is not cut-off event [2022-12-12 11:53:25,951 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-12 11:53:25,951 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-12 11:53:25,951 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-12 11:53:25,953 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([344] L782-->L789: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_99 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_99) v_~a$w_buff1_used~0_98) (= v_~a$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_98 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0)))) 0 v_~a$r_buff1_thd2~0_24)) (= v_~a~0_66 (ite .cse0 v_~a$w_buff0~0_51 (ite .cse2 v_~a$w_buff1~0_42 v_~a~0_67))) (= v_~a$r_buff0_thd2~0_25 (ite .cse1 0 v_~a$r_buff0_thd2~0_26))))) InVars {~a~0=v_~a~0_67, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_24, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_99} OutVars{~a~0=v_~a~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_23, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_98} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][225], [112#L3-1true, 124#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 76#L762true, 6#L789true, 13#L805true, P1Thread1of1ForFork2InUse, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 184#(= ~a$r_buff0_thd3~0 0)]) [2022-12-12 11:53:25,953 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-12 11:53:25,953 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:25,953 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:25,953 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:26,092 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_29 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_121 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_115 256) 0)) .cse2)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_122 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~a$r_buff0_thd1~0_29) v_~a$r_buff0_thd1~0_28) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_28 256) 0)) .cse1) (and (not (= (mod v_~a$w_buff1_used~0_114 256) 0)) .cse2)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19) (= (ite (or .cse0 .cse3) 0 v_~a$w_buff1_used~0_115) v_~a$w_buff1_used~0_114) (= v_~a~0_82 (ite .cse4 v_~a$w_buff0~0_61 (ite .cse3 v_~a$w_buff1~0_52 v_~a~0_83))) (= (ite .cse4 0 v_~a$w_buff0_used~0_122) v_~a$w_buff0_used~0_121)))) InVars {~a~0=v_~a~0_83, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_122, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_115} OutVars{~a~0=v_~a~0_82, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_121, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_114} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][165], [112#L3-1true, 124#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 13#L805true, 186#(and (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (not (= ~a$w_buff0_used~0 1))), P1Thread1of1ForFork2InUse, 36#L769true, 127#true, 173#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 68#L782true]) [2022-12-12 11:53:26,092 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is not cut-off event [2022-12-12 11:53:26,092 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-12-12 11:53:26,092 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-12-12 11:53:26,092 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-12-12 11:53:26,582 INFO L130 PetriNetUnfolder]: 2788/6089 cut-off events. [2022-12-12 11:53:26,583 INFO L131 PetriNetUnfolder]: For 8762/9715 co-relation queries the response was YES. [2022-12-12 11:53:26,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19439 conditions, 6089 events. 2788/6089 cut-off events. For 8762/9715 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 51525 event pairs, 106 based on Foata normal form. 51/5997 useless extension candidates. Maximal degree in co-relation 19373. Up to 1747 conditions per place. [2022-12-12 11:53:26,619 INFO L137 encePairwiseOnDemand]: 100/113 looper letters, 120 selfloop transitions, 57 changer transitions 276/571 dead transitions. [2022-12-12 11:53:26,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 571 transitions, 4974 flow [2022-12-12 11:53:26,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 11:53:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 11:53:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1210 transitions. [2022-12-12 11:53:26,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7648546144121365 [2022-12-12 11:53:26,623 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 34 predicate places. [2022-12-12 11:53:26,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 571 transitions, 4974 flow [2022-12-12 11:53:26,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 571 transitions, 4343 flow, removed 313 selfloop flow, removed 2 redundant places. [2022-12-12 11:53:26,642 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 571 transitions, 4343 flow [2022-12-12 11:53:26,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.88888888888889) internal successors, (746), 9 states have internal predecessors, (746), 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-12 11:53:26,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:26,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:26,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:53:26,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:26,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2053108106, now seen corresponding path program 2 times [2022-12-12 11:53:26,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:26,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297983651] [2022-12-12 11:53:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:26,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:26,922 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-12 11:53:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:26,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297983651] [2022-12-12 11:53:26,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297983651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:26,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:26,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 11:53:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795180412] [2022-12-12 11:53:26,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:26,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 11:53:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 11:53:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 11:53:26,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-12-12 11:53:26,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 571 transitions, 4343 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 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-12 11:53:26,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:26,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-12-12 11:53:26,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:28,075 INFO L130 PetriNetUnfolder]: 2676/5611 cut-off events. [2022-12-12 11:53:28,075 INFO L131 PetriNetUnfolder]: For 7362/10354 co-relation queries the response was YES. [2022-12-12 11:53:28,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21328 conditions, 5611 events. 2676/5611 cut-off events. For 7362/10354 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 47623 event pairs, 91 based on Foata normal form. 643/6101 useless extension candidates. Maximal degree in co-relation 21270. Up to 1364 conditions per place. [2022-12-12 11:53:28,110 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 141 selfloop transitions, 36 changer transitions 304/563 dead transitions. [2022-12-12 11:53:28,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 563 transitions, 5273 flow [2022-12-12 11:53:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 11:53:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 11:53:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1532 transitions. [2022-12-12 11:53:28,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8473451327433629 [2022-12-12 11:53:28,118 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 38 predicate places. [2022-12-12 11:53:28,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 563 transitions, 5273 flow [2022-12-12 11:53:28,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 563 transitions, 4703 flow, removed 258 selfloop flow, removed 7 redundant places. [2022-12-12 11:53:28,146 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 563 transitions, 4703 flow [2022-12-12 11:53:28,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 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-12 11:53:28,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:28,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:28,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:53:28,147 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash 351034181, now seen corresponding path program 1 times [2022-12-12 11:53:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:28,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718459901] [2022-12-12 11:53:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:29,266 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-12 11:53:29,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:29,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718459901] [2022-12-12 11:53:29,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718459901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:29,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:29,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-12 11:53:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358132548] [2022-12-12 11:53:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:29,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 11:53:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 11:53:29,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-12 11:53:29,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 113 [2022-12-12 11:53:29,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 563 transitions, 4703 flow. Second operand has 13 states, 13 states have (on average 84.92307692307692) internal successors, (1104), 13 states have internal predecessors, (1104), 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-12 11:53:29,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:29,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 113 [2022-12-12 11:53:29,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:30,205 INFO L130 PetriNetUnfolder]: 2933/6226 cut-off events. [2022-12-12 11:53:30,206 INFO L131 PetriNetUnfolder]: For 12474/13639 co-relation queries the response was YES. [2022-12-12 11:53:30,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22269 conditions, 6226 events. 2933/6226 cut-off events. For 12474/13639 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 54283 event pairs, 92 based on Foata normal form. 78/6146 useless extension candidates. Maximal degree in co-relation 22201. Up to 1451 conditions per place. [2022-12-12 11:53:30,245 INFO L137 encePairwiseOnDemand]: 101/113 looper letters, 100 selfloop transitions, 45 changer transitions 379/643 dead transitions. [2022-12-12 11:53:30,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 643 transitions, 6469 flow [2022-12-12 11:53:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:53:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:53:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1124 transitions. [2022-12-12 11:53:30,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.765146358066712 [2022-12-12 11:53:30,303 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 43 predicate places. [2022-12-12 11:53:30,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 643 transitions, 6469 flow [2022-12-12 11:53:30,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 643 transitions, 5809 flow, removed 295 selfloop flow, removed 5 redundant places. [2022-12-12 11:53:30,328 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 643 transitions, 5809 flow [2022-12-12 11:53:30,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 84.92307692307692) internal successors, (1104), 13 states have internal predecessors, (1104), 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-12 11:53:30,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:30,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:30,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:53:30,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:30,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1496861305, now seen corresponding path program 2 times [2022-12-12 11:53:30,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:30,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188098434] [2022-12-12 11:53:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:30,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:30,659 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-12 11:53:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188098434] [2022-12-12 11:53:30,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188098434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:30,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:30,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 11:53:30,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886813940] [2022-12-12 11:53:30,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:30,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 11:53:30,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:30,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 11:53:30,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-12 11:53:30,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2022-12-12 11:53:30,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 643 transitions, 5809 flow. Second operand has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 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-12 11:53:30,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:30,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2022-12-12 11:53:30,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:32,031 INFO L130 PetriNetUnfolder]: 4913/10363 cut-off events. [2022-12-12 11:53:32,031 INFO L131 PetriNetUnfolder]: For 22362/27924 co-relation queries the response was YES. [2022-12-12 11:53:32,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38312 conditions, 10363 events. 4913/10363 cut-off events. For 22362/27924 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 98473 event pairs, 120 based on Foata normal form. 343/10510 useless extension candidates. Maximal degree in co-relation 38249. Up to 2157 conditions per place. [2022-12-12 11:53:32,064 INFO L137 encePairwiseOnDemand]: 105/113 looper letters, 106 selfloop transitions, 3 changer transitions 817/1046 dead transitions. [2022-12-12 11:53:32,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1046 transitions, 11731 flow [2022-12-12 11:53:32,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 11:53:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 11:53:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 718 transitions. [2022-12-12 11:53:32,067 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7942477876106194 [2022-12-12 11:53:32,070 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 45 predicate places. [2022-12-12 11:53:32,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1046 transitions, 11731 flow [2022-12-12 11:53:32,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 1046 transitions, 11719 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-12 11:53:32,098 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 1046 transitions, 11719 flow [2022-12-12 11:53:32,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 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-12 11:53:32,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:32,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:32,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:53:32,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:32,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:32,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1156388385, now seen corresponding path program 3 times [2022-12-12 11:53:32,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:32,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767049704] [2022-12-12 11:53:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:32,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:53:32,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:53:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:53:32,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:53:32,250 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:53:32,251 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 11:53:32,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 11:53:32,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 11:53:32,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 11:53:32,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 11:53:32,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 11:53:32,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 11:53:32,254 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-12-12 11:53:32,259 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:53:32,259 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:53:32,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:53:32 BasicIcfg [2022-12-12 11:53:32,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:53:32,360 INFO L158 Benchmark]: Toolchain (without parser) took 12801.19ms. Allocated memory was 212.9MB in the beginning and 639.6MB in the end (delta: 426.8MB). Free memory was 188.6MB in the beginning and 407.2MB in the end (delta: -218.6MB). Peak memory consumption was 209.8MB. Max. memory is 8.0GB. [2022-12-12 11:53:32,360 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 212.9MB. Free memory is still 189.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:53:32,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.84ms. Allocated memory is still 212.9MB. Free memory was 188.1MB in the beginning and 161.3MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 11:53:32,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.95ms. Allocated memory is still 212.9MB. Free memory was 161.3MB in the beginning and 159.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:53:32,361 INFO L158 Benchmark]: Boogie Preprocessor took 36.82ms. Allocated memory is still 212.9MB. Free memory was 158.7MB in the beginning and 157.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 11:53:32,361 INFO L158 Benchmark]: RCFGBuilder took 708.72ms. Allocated memory is still 212.9MB. Free memory was 157.1MB in the beginning and 122.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-12 11:53:32,361 INFO L158 Benchmark]: TraceAbstraction took 11477.39ms. Allocated memory was 212.9MB in the beginning and 639.6MB in the end (delta: 426.8MB). Free memory was 120.9MB in the beginning and 407.2MB in the end (delta: -286.2MB). Peak memory consumption was 141.6MB. Max. memory is 8.0GB. [2022-12-12 11:53:32,362 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.15ms. Allocated memory is still 212.9MB. Free memory is still 189.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 519.84ms. Allocated memory is still 212.9MB. Free memory was 188.1MB in the beginning and 161.3MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.95ms. Allocated memory is still 212.9MB. Free memory was 161.3MB in the beginning and 159.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.82ms. Allocated memory is still 212.9MB. Free memory was 158.7MB in the beginning and 157.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 708.72ms. Allocated memory is still 212.9MB. Free memory was 157.1MB in the beginning and 122.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11477.39ms. Allocated memory was 212.9MB in the beginning and 639.6MB in the end (delta: 426.8MB). Free memory was 120.9MB in the beginning and 407.2MB in the end (delta: -286.2MB). Peak memory consumption was 141.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L721] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L722] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L723] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L724] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L725] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L726] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L727] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L728] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L729] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L730] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L731] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L732] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L733] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L734] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L735] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L736] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L737] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L739] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t913; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t913, ((void *)0), P0, ((void *)0))=-2, t913={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t914; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, t914={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t914, ((void *)0), P1, ((void *)0))=-1, t913={5:0}, t914={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=0, y=0, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L849] 0 pthread_t t915; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t915, ((void *)0), P2, ((void *)0))=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=1] [L804] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=1] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 a$flush_delayed = weak$$choice2 [L810] 3 a$mem_tmp = a [L811] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L812] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L813] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L814] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L815] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L817] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = a [L819] 3 a = a$flush_delayed ? a$mem_tmp : a [L820] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L823] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L824] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L825] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L826] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L827] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L857] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L858] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L859] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L860] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 850]: 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: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 502 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 409 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1151 IncrementalHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 93 mSDtfsCounter, 1151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11719occurred in iteration=8, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 2062 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 707 NumberOfCodeBlocks, 707 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 2881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-12 11:53:32,387 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...