/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:11:47,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:11:47,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:11:47,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:11:47,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:11:47,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:11:47,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:11:47,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:11:47,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:11:47,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:11:47,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:11:47,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:11:47,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:11:47,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:11:47,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:11:47,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:11:47,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:11:47,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:11:47,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:11:47,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:11:47,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:11:47,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:11:47,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:11:47,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:11:47,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:11:47,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:11:47,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:11:47,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:11:47,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:11:47,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:11:47,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:11:47,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:11:47,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:11:47,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:11:47,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:11:47,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:11:47,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:11:47,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:11:47,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:11:47,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:11:47,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:11:47,768 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-RepeatedSemanticLbe.epf [2022-12-13 03:11:47,793 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:11:47,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:11:47,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:11:47,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:11:47,795 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:11:47,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:11:47,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:11:47,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:11:47,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:11:47,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:11:47,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:11:47,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:11:47,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:11:47,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:11:47,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:11:47,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:11:47,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:11:47,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:11:47,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:11:47,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:11:47,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:11:47,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:11:47,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:11:47,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:11:47,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:11:47,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:11:47,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:11:47,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:11:47,798 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 [2022-12-13 03:11:48,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:11:48,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:11:48,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:11:48,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:11:48,216 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:11:48,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i [2022-12-13 03:11:49,188 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:11:49,389 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:11:49,389 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i [2022-12-13 03:11:49,410 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83cae0b3b/c9ba957c5ba248eaaa31eb6e713654a3/FLAG39b3febcc [2022-12-13 03:11:49,427 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83cae0b3b/c9ba957c5ba248eaaa31eb6e713654a3 [2022-12-13 03:11:49,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:11:49,438 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:11:49,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:11:49,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:11:49,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:11:49,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:49,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225943a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49, skipping insertion in model container [2022-12-13 03:11:49,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:49,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:11:49,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:11:49,670 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/rfi009_power.oepc.i[994,1007] [2022-12-13 03:11:49,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:11:49,883 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:11:49,892 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/rfi009_power.oepc.i[994,1007] [2022-12-13 03:11:49,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:49,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:49,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:11:49,995 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:11:49,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49 WrapperNode [2022-12-13 03:11:49,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:11:49,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:11:49,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:11:49,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:11:50,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,062 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 03:11:50,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:11:50,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:11:50,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:11:50,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:11:50,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:11:50,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:11:50,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:11:50,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:11:50,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (1/1) ... [2022-12-13 03:11:50,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:11:50,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:11:50,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:11:50,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:11:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:11:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:11:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:11:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:11:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:11:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:11:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:11:50,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:11:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:11:50,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:11:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:11:50,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:11:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:11:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:11:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:11:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:11:50,182 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:11:50,361 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:11:50,362 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:11:50,686 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:11:50,920 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:11:50,920 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:11:50,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:11:50 BoogieIcfgContainer [2022-12-13 03:11:50,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:11:50,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:11:50,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:11:50,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:11:50,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:11:49" (1/3) ... [2022-12-13 03:11:50,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495090bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:11:50, skipping insertion in model container [2022-12-13 03:11:50,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:49" (2/3) ... [2022-12-13 03:11:50,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495090bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:11:50, skipping insertion in model container [2022-12-13 03:11:50,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:11:50" (3/3) ... [2022-12-13 03:11:50,928 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.oepc.i [2022-12-13 03:11:50,940 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:11:50,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:11:50,941 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:11:50,988 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:11:51,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 03:11:51,045 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 03:11:51,045 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:11:51,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-13 03:11:51,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 03:11:51,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-13 03:11:51,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:51,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 03:11:51,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-13 03:11:51,119 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-13 03:11:51,119 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:11:51,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 03:11:51,121 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 03:11:51,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 03:11:57,624 INFO L241 LiptonReduction]: Total number of compositions: 92 [2022-12-13 03:11:57,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:11:57,640 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fab1edb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:11:57,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:11:57,645 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 03:11:57,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:11:57,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:57,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:57,646 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:57,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash 9557882, now seen corresponding path program 1 times [2022-12-13 03:11:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:57,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501369891] [2022-12-13 03:11:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:11:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:57,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501369891] [2022-12-13 03:11:57,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501369891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:57,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:57,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:11:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014701742] [2022-12-13 03:11:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:57,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 03:11:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:57,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 03:11:57,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 03:11:57,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 03:11:57,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:11:57,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:57,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 03:11:57,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:58,171 INFO L130 PetriNetUnfolder]: 909/1419 cut-off events. [2022-12-13 03:11:58,172 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 03:11:58,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1419 events. 909/1419 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6942 event pairs, 909 based on Foata normal form. 0/1134 useless extension candidates. Maximal degree in co-relation 2821. Up to 1359 conditions per place. [2022-12-13 03:11:58,181 INFO L137 encePairwiseOnDemand]: 28/29 looper letters, 20 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2022-12-13 03:11:58,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:58,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 03:11:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 03:11:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2022-12-13 03:11:58,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2022-12-13 03:11:58,190 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-13 03:11:58,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:58,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:58,200 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:58,201 INFO L89 Accepts]: Start accepts. Operand has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:58,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:58,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:58,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:58,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:58,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 03:11:58,222 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:11:58,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 03:11:58,224 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:58,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:11:58,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:58,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:58,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:11:58,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash 595204269, now seen corresponding path program 1 times [2022-12-13 03:11:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:58,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738635997] [2022-12-13 03:11:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:11:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:58,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738635997] [2022-12-13 03:11:58,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738635997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:58,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:58,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:11:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665790057] [2022-12-13 03:11:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:58,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:11:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:58,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:11:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:11:58,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2022-12-13 03:11:58,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:11:58,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:58,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2022-12-13 03:11:58,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:58,838 INFO L130 PetriNetUnfolder]: 844/1413 cut-off events. [2022-12-13 03:11:58,839 INFO L131 PetriNetUnfolder]: For 59/65 co-relation queries the response was YES. [2022-12-13 03:11:58,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 1413 events. 844/1413 cut-off events. For 59/65 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7544 event pairs, 301 based on Foata normal form. 25/1167 useless extension candidates. Maximal degree in co-relation 3991. Up to 1269 conditions per place. [2022-12-13 03:11:58,847 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 32 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2022-12-13 03:11:58,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 235 flow [2022-12-13 03:11:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:11:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:11:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 03:11:58,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 03:11:58,849 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 03:11:58,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 42 transitions, 235 flow [2022-12-13 03:11:58,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 42 transitions, 235 flow [2022-12-13 03:11:58,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:58,861 INFO L89 Accepts]: Start accepts. Operand has 41 places, 42 transitions, 235 flow [2022-12-13 03:11:58,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:58,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:58,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 42 transitions, 235 flow [2022-12-13 03:11:58,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 42 transitions, 235 flow [2022-12-13 03:11:58,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-13 03:11:59,843 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:11:59,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 983 [2022-12-13 03:11:59,845 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 235 flow [2022-12-13 03:11:59,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:11:59,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:59,845 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:59,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:11:59,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:59,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1271462751, now seen corresponding path program 1 times [2022-12-13 03:11:59,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:59,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972276546] [2022-12-13 03:11:59,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:12:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:12:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:12:00,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972276546] [2022-12-13 03:12:00,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972276546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:12:00,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:12:00,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:12:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309202157] [2022-12-13 03:12:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:12:00,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:12:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:12:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:12:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:12:00,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 03:12:00,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:00,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:12:00,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 03:12:00,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:12:00,304 INFO L130 PetriNetUnfolder]: 924/1551 cut-off events. [2022-12-13 03:12:00,304 INFO L131 PetriNetUnfolder]: For 608/608 co-relation queries the response was YES. [2022-12-13 03:12:00,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5683 conditions, 1551 events. 924/1551 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8725 event pairs, 77 based on Foata normal form. 60/1320 useless extension candidates. Maximal degree in co-relation 5666. Up to 1334 conditions per place. [2022-12-13 03:12:00,313 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2022-12-13 03:12:00,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 455 flow [2022-12-13 03:12:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:12:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:12:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 03:12:00,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2022-12-13 03:12:00,315 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-13 03:12:00,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 60 transitions, 455 flow [2022-12-13 03:12:00,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 60 transitions, 455 flow [2022-12-13 03:12:00,328 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:12:00,328 INFO L89 Accepts]: Start accepts. Operand has 43 places, 60 transitions, 455 flow [2022-12-13 03:12:00,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:12:00,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:12:00,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 60 transitions, 455 flow [2022-12-13 03:12:00,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 60 transitions, 455 flow [2022-12-13 03:12:00,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-13 03:12:00,380 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:12:00,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 03:12:00,381 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 60 transitions, 455 flow [2022-12-13 03:12:00,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:00,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:12:00,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:12:00,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:12:00,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:12:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:12:00,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1313155313, now seen corresponding path program 1 times [2022-12-13 03:12:00,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:12:00,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989543718] [2022-12-13 03:12:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:12:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:12:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:12:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:12:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:12:00,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989543718] [2022-12-13 03:12:00,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989543718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:12:00,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:12:00,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:12:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655355832] [2022-12-13 03:12:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:12:00,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:12:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:12:00,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:12:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:12:00,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 03:12:00,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 60 transitions, 455 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:00,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:12:00,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 03:12:00,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:12:01,137 INFO L130 PetriNetUnfolder]: 1660/2646 cut-off events. [2022-12-13 03:12:01,137 INFO L131 PetriNetUnfolder]: For 2512/2512 co-relation queries the response was YES. [2022-12-13 03:12:01,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11582 conditions, 2646 events. 1660/2646 cut-off events. For 2512/2512 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 15907 event pairs, 88 based on Foata normal form. 162/2364 useless extension candidates. Maximal degree in co-relation 11562. Up to 2080 conditions per place. [2022-12-13 03:12:01,152 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 97 selfloop transitions, 24 changer transitions 4/130 dead transitions. [2022-12-13 03:12:01,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 130 transitions, 1241 flow [2022-12-13 03:12:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:12:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:12:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 03:12:01,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 03:12:01,155 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-13 03:12:01,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 130 transitions, 1241 flow [2022-12-13 03:12:01,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 126 transitions, 1201 flow [2022-12-13 03:12:01,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:12:01,184 INFO L89 Accepts]: Start accepts. Operand has 46 places, 126 transitions, 1201 flow [2022-12-13 03:12:01,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:12:01,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:12:01,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 126 transitions, 1201 flow [2022-12-13 03:12:01,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 126 transitions, 1201 flow [2022-12-13 03:12:01,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 03:12:01,250 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:12:01,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 03:12:01,250 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 126 transitions, 1201 flow [2022-12-13 03:12:01,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:01,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:12:01,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:12:01,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:12:01,251 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:12:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:12:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash 720380974, now seen corresponding path program 1 times [2022-12-13 03:12:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:12:01,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145337608] [2022-12-13 03:12:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:12:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:12:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:12:01,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-13 03:12:01,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:12:01,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145337608] [2022-12-13 03:12:01,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145337608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:12:01,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:12:01,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:12:01,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162950347] [2022-12-13 03:12:01,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:12:01,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:12:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:12:01,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:12:01,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:12:01,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-13 03:12:01,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 126 transitions, 1201 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:01,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:12:01,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-13 03:12:01,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:12:01,818 INFO L130 PetriNetUnfolder]: 997/1733 cut-off events. [2022-12-13 03:12:01,818 INFO L131 PetriNetUnfolder]: For 1770/1770 co-relation queries the response was YES. [2022-12-13 03:12:01,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9296 conditions, 1733 events. 997/1733 cut-off events. For 1770/1770 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 10383 event pairs, 4 based on Foata normal form. 144/1600 useless extension candidates. Maximal degree in co-relation 9273. Up to 1373 conditions per place. [2022-12-13 03:12:01,826 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 80 selfloop transitions, 40 changer transitions 47/172 dead transitions. [2022-12-13 03:12:01,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 172 transitions, 1944 flow [2022-12-13 03:12:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:12:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:12:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 03:12:01,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 03:12:01,828 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-13 03:12:01,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 172 transitions, 1944 flow [2022-12-13 03:12:01,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 125 transitions, 1416 flow [2022-12-13 03:12:01,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:12:01,843 INFO L89 Accepts]: Start accepts. Operand has 50 places, 125 transitions, 1416 flow [2022-12-13 03:12:01,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:12:01,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:12:01,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 125 transitions, 1416 flow [2022-12-13 03:12:01,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 125 transitions, 1416 flow [2022-12-13 03:12:01,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 03:12:01,852 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:12:01,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:12:01,853 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 125 transitions, 1416 flow [2022-12-13 03:12:01,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:01,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:12:01,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:12:01,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:12:01,853 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:12:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:12:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1598924988, now seen corresponding path program 1 times [2022-12-13 03:12:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:12:01,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355068103] [2022-12-13 03:12:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:12:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:12:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:12:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:12:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:12:02,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355068103] [2022-12-13 03:12:02,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355068103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:12:02,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:12:02,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:12:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828728977] [2022-12-13 03:12:02,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:12:02,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:12:02,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:12:02,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:12:02,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:12:02,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 03:12:02,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 125 transitions, 1416 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:02,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:12:02,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 03:12:02,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:12:02,393 INFO L130 PetriNetUnfolder]: 1137/2024 cut-off events. [2022-12-13 03:12:02,393 INFO L131 PetriNetUnfolder]: For 4708/4723 co-relation queries the response was YES. [2022-12-13 03:12:02,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12413 conditions, 2024 events. 1137/2024 cut-off events. For 4708/4723 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12057 event pairs, 2 based on Foata normal form. 128/1802 useless extension candidates. Maximal degree in co-relation 12387. Up to 1569 conditions per place. [2022-12-13 03:12:02,403 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 139 selfloop transitions, 7 changer transitions 40/201 dead transitions. [2022-12-13 03:12:02,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 201 transitions, 2703 flow [2022-12-13 03:12:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:12:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:12:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 03:12:02,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6048387096774194 [2022-12-13 03:12:02,408 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-13 03:12:02,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 201 transitions, 2703 flow [2022-12-13 03:12:02,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 161 transitions, 2137 flow [2022-12-13 03:12:02,434 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:12:02,435 INFO L89 Accepts]: Start accepts. Operand has 53 places, 161 transitions, 2137 flow [2022-12-13 03:12:02,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:12:02,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:12:02,437 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 161 transitions, 2137 flow [2022-12-13 03:12:02,440 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 161 transitions, 2137 flow [2022-12-13 03:12:02,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 03:12:02,442 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:12:02,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 03:12:02,443 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 161 transitions, 2137 flow [2022-12-13 03:12:02,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:02,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:12:02,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:12:02,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:12:02,444 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:12:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:12:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash 798625342, now seen corresponding path program 2 times [2022-12-13 03:12:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:12:02,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739349163] [2022-12-13 03:12:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:12:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:12:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:12:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:12:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:12:03,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739349163] [2022-12-13 03:12:03,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739349163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:12:03,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:12:03,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:12:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949342458] [2022-12-13 03:12:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:12:03,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:12:03,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:12:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:12:03,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:12:03,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 03:12:03,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 161 transitions, 2137 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:03,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:12:03,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 03:12:03,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:12:03,973 INFO L130 PetriNetUnfolder]: 1274/2706 cut-off events. [2022-12-13 03:12:03,973 INFO L131 PetriNetUnfolder]: For 7399/7431 co-relation queries the response was YES. [2022-12-13 03:12:03,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17689 conditions, 2706 events. 1274/2706 cut-off events. For 7399/7431 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 20341 event pairs, 28 based on Foata normal form. 109/2395 useless extension candidates. Maximal degree in co-relation 17660. Up to 1913 conditions per place. [2022-12-13 03:12:03,985 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 182 selfloop transitions, 52 changer transitions 27/280 dead transitions. [2022-12-13 03:12:03,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 280 transitions, 4367 flow [2022-12-13 03:12:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:12:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:12:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 03:12:03,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5870967741935483 [2022-12-13 03:12:03,987 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-13 03:12:03,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 280 transitions, 4367 flow [2022-12-13 03:12:03,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 253 transitions, 3935 flow [2022-12-13 03:12:04,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:12:04,013 INFO L89 Accepts]: Start accepts. Operand has 57 places, 253 transitions, 3935 flow [2022-12-13 03:12:04,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:12:04,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:12:04,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 253 transitions, 3935 flow [2022-12-13 03:12:04,020 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 253 transitions, 3935 flow [2022-12-13 03:12:04,020 INFO L226 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-13 03:12:04,021 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:12:04,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:12:04,022 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 253 transitions, 3935 flow [2022-12-13 03:12:04,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:04,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:12:04,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:12:04,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:12:04,023 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:12:04,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:12:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash -727958983, now seen corresponding path program 1 times [2022-12-13 03:12:04,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:12:04,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67433514] [2022-12-13 03:12:04,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:12:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:12:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:12:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:12:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:12:05,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67433514] [2022-12-13 03:12:05,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67433514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:12:05,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:12:05,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:12:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456325715] [2022-12-13 03:12:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:12:05,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:12:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:12:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:12:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:12:05,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 03:12:05,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 253 transitions, 3935 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:05,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:12:05,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 03:12:05,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:12:05,774 INFO L130 PetriNetUnfolder]: 1196/2663 cut-off events. [2022-12-13 03:12:05,774 INFO L131 PetriNetUnfolder]: For 9700/9727 co-relation queries the response was YES. [2022-12-13 03:12:05,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19067 conditions, 2663 events. 1196/2663 cut-off events. For 9700/9727 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20784 event pairs, 10 based on Foata normal form. 33/2328 useless extension candidates. Maximal degree in co-relation 19035. Up to 1841 conditions per place. [2022-12-13 03:12:05,795 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 249 selfloop transitions, 51 changer transitions 1/320 dead transitions. [2022-12-13 03:12:05,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 320 transitions, 5621 flow [2022-12-13 03:12:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:12:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:12:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 03:12:05,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-13 03:12:05,798 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2022-12-13 03:12:05,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 320 transitions, 5621 flow [2022-12-13 03:12:05,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 319 transitions, 5603 flow [2022-12-13 03:12:05,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:12:05,846 INFO L89 Accepts]: Start accepts. Operand has 61 places, 319 transitions, 5603 flow [2022-12-13 03:12:05,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:12:05,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:12:05,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 319 transitions, 5603 flow [2022-12-13 03:12:05,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 319 transitions, 5603 flow [2022-12-13 03:12:05,860 INFO L226 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-13 03:12:05,862 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:12:05,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 03:12:05,864 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 319 transitions, 5603 flow [2022-12-13 03:12:05,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:05,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:12:05,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:12:05,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:12:05,865 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:12:05,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:12:05,866 INFO L85 PathProgramCache]: Analyzing trace with hash 116831579, now seen corresponding path program 1 times [2022-12-13 03:12:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:12:05,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354033222] [2022-12-13 03:12:05,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:12:05,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:12:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:12:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:12:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:12:06,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354033222] [2022-12-13 03:12:06,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354033222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:12:06,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:12:06,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:12:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586070528] [2022-12-13 03:12:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:12:06,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:12:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:12:06,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:12:06,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:12:06,043 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2022-12-13 03:12:06,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 319 transitions, 5603 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:06,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:12:06,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2022-12-13 03:12:06,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:12:06,461 INFO L130 PetriNetUnfolder]: 1030/2302 cut-off events. [2022-12-13 03:12:06,462 INFO L131 PetriNetUnfolder]: For 10205/10229 co-relation queries the response was YES. [2022-12-13 03:12:06,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18480 conditions, 2302 events. 1030/2302 cut-off events. For 10205/10229 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17619 event pairs, 10 based on Foata normal form. 138/2135 useless extension candidates. Maximal degree in co-relation 18445. Up to 1568 conditions per place. [2022-12-13 03:12:06,472 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 89 selfloop transitions, 79 changer transitions 146/317 dead transitions. [2022-12-13 03:12:06,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 317 transitions, 6187 flow [2022-12-13 03:12:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:12:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:12:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-13 03:12:06,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2022-12-13 03:12:06,474 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2022-12-13 03:12:06,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 317 transitions, 6187 flow [2022-12-13 03:12:06,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 171 transitions, 3326 flow [2022-12-13 03:12:06,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:12:06,495 INFO L89 Accepts]: Start accepts. Operand has 62 places, 171 transitions, 3326 flow [2022-12-13 03:12:06,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:12:06,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:12:06,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 171 transitions, 3326 flow [2022-12-13 03:12:06,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 171 transitions, 3326 flow [2022-12-13 03:12:06,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 03:12:07,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] L783-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [735] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_340 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_339 256) 0))) (.cse10 (not .cse12)) (.cse13 (= (mod v_~x$r_buff1_thd0~0_104 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_345 256) 0))) (let ((.cse7 (select |v_#memory_int_444| |v_~#x~0.base_233|)) (.cse4 (not .cse14)) (.cse5 (not .cse13)) (.cse3 (and .cse6 .cse10)) (.cse9 (not .cse11))) (and (let ((.cse0 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_93 256))) (.cse2 (= |v_ULTIMATE.start_main_#t~mem40#1_189| |v_ULTIMATE.start_main_#t~mem40#1_191|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_138 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_144) .cse1 .cse2) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~mem40#1_189|) (= |v_ULTIMATE.start_main_#t~mem40#1_189| (select (select |v_#memory_int_443| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96))))) (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_143)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~ite41#1_190|) (= v_~__unbuffered_p0_EAX~0_144 v_~__unbuffered_p0_EAX~0_143) .cse2))) (= v_~weak$$choice1~0_138 |v_ULTIMATE.start_main_#t~nondet39#1_117|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse6) (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= (store |v_#memory_int_444| |v_~#x~0.base_233| (store .cse7 |v_~#x~0.offset_233| |v_ULTIMATE.start_main_#t~ite38#1_114|)) |v_#memory_int_443|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem36#1_138| |v_ULTIMATE.start_main_#t~mem36#1_136|))) (or (and .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite37#1_135| |v_ULTIMATE.start_main_#t~ite37#1_133|) (= |v_ULTIMATE.start_main_#t~ite38#1_114| v_~x$w_buff0~0_217) .cse10) (and (or .cse11 .cse12) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~mem36#1_136|) (= (select .cse7 |v_~#x~0.offset_233|) |v_ULTIMATE.start_main_#t~mem36#1_136|) (or .cse13 .cse14)) (and .cse4 .cse8 (= |v_ULTIMATE.start_main_#t~ite37#1_133| v_~x$w_buff1~0_223) .cse5)) (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~ite38#1_114|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~__unbuffered_p0_EAX~0_143 1) (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~__unbuffered_p1_EAX~0_82 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_340) v_~x$w_buff0_used~0_339))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_217, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_191|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_135|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_138|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_340, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_144, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_190|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_444|, ~#x~0.base=|v_~#x~0.base_233|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_143, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_339, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_443|, ~#x~0.base=|v_~#x~0.base_233|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_113|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_136|, |v_ULTIMATE.start_main_#t~ite37#1_133|, |v_ULTIMATE.start_main_#t~ite41#1_188|, |v_ULTIMATE.start_main_#t~ite38#1_114|, |v_ULTIMATE.start_main_#t~mem40#1_189|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~pre34#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:12:08,245 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L783-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P0Thread1of1ForFork2_#res.offset_9| 0) (= |v_P0Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [735] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_340 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_339 256) 0))) (.cse10 (not .cse12)) (.cse13 (= (mod v_~x$r_buff1_thd0~0_104 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_345 256) 0))) (let ((.cse7 (select |v_#memory_int_444| |v_~#x~0.base_233|)) (.cse4 (not .cse14)) (.cse5 (not .cse13)) (.cse3 (and .cse6 .cse10)) (.cse9 (not .cse11))) (and (let ((.cse0 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_93 256))) (.cse2 (= |v_ULTIMATE.start_main_#t~mem40#1_189| |v_ULTIMATE.start_main_#t~mem40#1_191|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_138 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_144) .cse1 .cse2) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~mem40#1_189|) (= |v_ULTIMATE.start_main_#t~mem40#1_189| (select (select |v_#memory_int_443| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96))))) (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_143)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~ite41#1_190|) (= v_~__unbuffered_p0_EAX~0_144 v_~__unbuffered_p0_EAX~0_143) .cse2))) (= v_~weak$$choice1~0_138 |v_ULTIMATE.start_main_#t~nondet39#1_117|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse6) (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= (store |v_#memory_int_444| |v_~#x~0.base_233| (store .cse7 |v_~#x~0.offset_233| |v_ULTIMATE.start_main_#t~ite38#1_114|)) |v_#memory_int_443|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem36#1_138| |v_ULTIMATE.start_main_#t~mem36#1_136|))) (or (and .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite37#1_135| |v_ULTIMATE.start_main_#t~ite37#1_133|) (= |v_ULTIMATE.start_main_#t~ite38#1_114| v_~x$w_buff0~0_217) .cse10) (and (or .cse11 .cse12) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~mem36#1_136|) (= (select .cse7 |v_~#x~0.offset_233|) |v_ULTIMATE.start_main_#t~mem36#1_136|) (or .cse13 .cse14)) (and .cse4 .cse8 (= |v_ULTIMATE.start_main_#t~ite37#1_133| v_~x$w_buff1~0_223) .cse5)) (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~ite38#1_114|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~__unbuffered_p0_EAX~0_143 1) (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~__unbuffered_p1_EAX~0_82 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_340) v_~x$w_buff0_used~0_339))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_217, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_191|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_135|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_138|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_340, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_144, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_190|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_444|, ~#x~0.base=|v_~#x~0.base_233|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_143, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_339, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_443|, ~#x~0.base=|v_~#x~0.base_233|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_113|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_136|, |v_ULTIMATE.start_main_#t~ite37#1_133|, |v_ULTIMATE.start_main_#t~ite41#1_188|, |v_ULTIMATE.start_main_#t~ite38#1_114|, |v_ULTIMATE.start_main_#t~mem40#1_189|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~pre34#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:12:08,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [624] L833-->L836: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [735] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_340 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_339 256) 0))) (.cse10 (not .cse12)) (.cse13 (= (mod v_~x$r_buff1_thd0~0_104 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_345 256) 0))) (let ((.cse7 (select |v_#memory_int_444| |v_~#x~0.base_233|)) (.cse4 (not .cse14)) (.cse5 (not .cse13)) (.cse3 (and .cse6 .cse10)) (.cse9 (not .cse11))) (and (let ((.cse0 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_93 256))) (.cse2 (= |v_ULTIMATE.start_main_#t~mem40#1_189| |v_ULTIMATE.start_main_#t~mem40#1_191|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_138 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_144) .cse1 .cse2) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~mem40#1_189|) (= |v_ULTIMATE.start_main_#t~mem40#1_189| (select (select |v_#memory_int_443| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96))))) (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_143)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~ite41#1_190|) (= v_~__unbuffered_p0_EAX~0_144 v_~__unbuffered_p0_EAX~0_143) .cse2))) (= v_~weak$$choice1~0_138 |v_ULTIMATE.start_main_#t~nondet39#1_117|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse6) (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= (store |v_#memory_int_444| |v_~#x~0.base_233| (store .cse7 |v_~#x~0.offset_233| |v_ULTIMATE.start_main_#t~ite38#1_114|)) |v_#memory_int_443|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem36#1_138| |v_ULTIMATE.start_main_#t~mem36#1_136|))) (or (and .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite37#1_135| |v_ULTIMATE.start_main_#t~ite37#1_133|) (= |v_ULTIMATE.start_main_#t~ite38#1_114| v_~x$w_buff0~0_217) .cse10) (and (or .cse11 .cse12) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~mem36#1_136|) (= (select .cse7 |v_~#x~0.offset_233|) |v_ULTIMATE.start_main_#t~mem36#1_136|) (or .cse13 .cse14)) (and .cse4 .cse8 (= |v_ULTIMATE.start_main_#t~ite37#1_133| v_~x$w_buff1~0_223) .cse5)) (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~ite38#1_114|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~__unbuffered_p0_EAX~0_143 1) (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~__unbuffered_p1_EAX~0_82 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_340) v_~x$w_buff0_used~0_339))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_217, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_191|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_135|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_138|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_340, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_144, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_190|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_444|, ~#x~0.base=|v_~#x~0.base_233|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_143, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_339, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_443|, ~#x~0.base=|v_~#x~0.base_233|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_113|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_136|, |v_ULTIMATE.start_main_#t~ite37#1_133|, |v_ULTIMATE.start_main_#t~ite41#1_188|, |v_ULTIMATE.start_main_#t~ite38#1_114|, |v_ULTIMATE.start_main_#t~mem40#1_189|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~pre34#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:12:09,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L833-->P2FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P2Thread1of1ForFork1_#res.base_5| 0) (= |v_P2Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [735] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_340 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_339 256) 0))) (.cse10 (not .cse12)) (.cse13 (= (mod v_~x$r_buff1_thd0~0_104 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_345 256) 0))) (let ((.cse7 (select |v_#memory_int_444| |v_~#x~0.base_233|)) (.cse4 (not .cse14)) (.cse5 (not .cse13)) (.cse3 (and .cse6 .cse10)) (.cse9 (not .cse11))) (and (let ((.cse0 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_93 256))) (.cse2 (= |v_ULTIMATE.start_main_#t~mem40#1_189| |v_ULTIMATE.start_main_#t~mem40#1_191|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_138 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_144) .cse1 .cse2) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~mem40#1_189|) (= |v_ULTIMATE.start_main_#t~mem40#1_189| (select (select |v_#memory_int_443| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96))))) (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_143)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~ite41#1_190|) (= v_~__unbuffered_p0_EAX~0_144 v_~__unbuffered_p0_EAX~0_143) .cse2))) (= v_~weak$$choice1~0_138 |v_ULTIMATE.start_main_#t~nondet39#1_117|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse6) (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= (store |v_#memory_int_444| |v_~#x~0.base_233| (store .cse7 |v_~#x~0.offset_233| |v_ULTIMATE.start_main_#t~ite38#1_114|)) |v_#memory_int_443|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem36#1_138| |v_ULTIMATE.start_main_#t~mem36#1_136|))) (or (and .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite37#1_135| |v_ULTIMATE.start_main_#t~ite37#1_133|) (= |v_ULTIMATE.start_main_#t~ite38#1_114| v_~x$w_buff0~0_217) .cse10) (and (or .cse11 .cse12) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~mem36#1_136|) (= (select .cse7 |v_~#x~0.offset_233|) |v_ULTIMATE.start_main_#t~mem36#1_136|) (or .cse13 .cse14)) (and .cse4 .cse8 (= |v_ULTIMATE.start_main_#t~ite37#1_133| v_~x$w_buff1~0_223) .cse5)) (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~ite38#1_114|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~__unbuffered_p0_EAX~0_143 1) (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~__unbuffered_p1_EAX~0_82 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_340) v_~x$w_buff0_used~0_339))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_217, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_191|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_135|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_138|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_340, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_144, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_190|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_444|, ~#x~0.base=|v_~#x~0.base_233|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_143, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_339, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_443|, ~#x~0.base=|v_~#x~0.base_233|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_113|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_136|, |v_ULTIMATE.start_main_#t~ite37#1_133|, |v_ULTIMATE.start_main_#t~ite41#1_188|, |v_ULTIMATE.start_main_#t~ite38#1_114|, |v_ULTIMATE.start_main_#t~mem40#1_189|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~pre34#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:12:10,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L833-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_137 (+ v_~__unbuffered_cnt~0_138 1)) (= |v_P2Thread1of1ForFork1_#res.base_13| 0) (= |v_P2Thread1of1ForFork1_#res.offset_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [735] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_340 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_339 256) 0))) (.cse10 (not .cse12)) (.cse13 (= (mod v_~x$r_buff1_thd0~0_104 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_345 256) 0))) (let ((.cse7 (select |v_#memory_int_444| |v_~#x~0.base_233|)) (.cse4 (not .cse14)) (.cse5 (not .cse13)) (.cse3 (and .cse6 .cse10)) (.cse9 (not .cse11))) (and (let ((.cse0 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_93 256))) (.cse2 (= |v_ULTIMATE.start_main_#t~mem40#1_189| |v_ULTIMATE.start_main_#t~mem40#1_191|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_138 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_144) .cse1 .cse2) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~mem40#1_189|) (= |v_ULTIMATE.start_main_#t~mem40#1_189| (select (select |v_#memory_int_443| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96))))) (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_143)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~ite41#1_190|) (= v_~__unbuffered_p0_EAX~0_144 v_~__unbuffered_p0_EAX~0_143) .cse2))) (= v_~weak$$choice1~0_138 |v_ULTIMATE.start_main_#t~nondet39#1_117|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse6) (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= (store |v_#memory_int_444| |v_~#x~0.base_233| (store .cse7 |v_~#x~0.offset_233| |v_ULTIMATE.start_main_#t~ite38#1_114|)) |v_#memory_int_443|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem36#1_138| |v_ULTIMATE.start_main_#t~mem36#1_136|))) (or (and .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite37#1_135| |v_ULTIMATE.start_main_#t~ite37#1_133|) (= |v_ULTIMATE.start_main_#t~ite38#1_114| v_~x$w_buff0~0_217) .cse10) (and (or .cse11 .cse12) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~mem36#1_136|) (= (select .cse7 |v_~#x~0.offset_233|) |v_ULTIMATE.start_main_#t~mem36#1_136|) (or .cse13 .cse14)) (and .cse4 .cse8 (= |v_ULTIMATE.start_main_#t~ite37#1_133| v_~x$w_buff1~0_223) .cse5)) (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~ite38#1_114|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~__unbuffered_p0_EAX~0_143 1) (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~__unbuffered_p1_EAX~0_82 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_340) v_~x$w_buff0_used~0_339))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_217, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_191|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_135|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_138|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_340, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_144, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_190|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_444|, ~#x~0.base=|v_~#x~0.base_233|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_143, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_339, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_443|, ~#x~0.base=|v_~#x~0.base_233|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_113|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_136|, |v_ULTIMATE.start_main_#t~ite37#1_133|, |v_ULTIMATE.start_main_#t~ite41#1_188|, |v_ULTIMATE.start_main_#t~ite38#1_114|, |v_ULTIMATE.start_main_#t~mem40#1_189|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~pre34#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:12:11,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] L814-->L819: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [735] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_340 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_339 256) 0))) (.cse10 (not .cse12)) (.cse13 (= (mod v_~x$r_buff1_thd0~0_104 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_345 256) 0))) (let ((.cse7 (select |v_#memory_int_444| |v_~#x~0.base_233|)) (.cse4 (not .cse14)) (.cse5 (not .cse13)) (.cse3 (and .cse6 .cse10)) (.cse9 (not .cse11))) (and (let ((.cse0 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_93 256))) (.cse2 (= |v_ULTIMATE.start_main_#t~mem40#1_189| |v_ULTIMATE.start_main_#t~mem40#1_191|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_138 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_144) .cse1 .cse2) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~mem40#1_189|) (= |v_ULTIMATE.start_main_#t~mem40#1_189| (select (select |v_#memory_int_443| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96))))) (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_143)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~ite41#1_190|) (= v_~__unbuffered_p0_EAX~0_144 v_~__unbuffered_p0_EAX~0_143) .cse2))) (= v_~weak$$choice1~0_138 |v_ULTIMATE.start_main_#t~nondet39#1_117|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse6) (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= (store |v_#memory_int_444| |v_~#x~0.base_233| (store .cse7 |v_~#x~0.offset_233| |v_ULTIMATE.start_main_#t~ite38#1_114|)) |v_#memory_int_443|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem36#1_138| |v_ULTIMATE.start_main_#t~mem36#1_136|))) (or (and .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite37#1_135| |v_ULTIMATE.start_main_#t~ite37#1_133|) (= |v_ULTIMATE.start_main_#t~ite38#1_114| v_~x$w_buff0~0_217) .cse10) (and (or .cse11 .cse12) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~mem36#1_136|) (= (select .cse7 |v_~#x~0.offset_233|) |v_ULTIMATE.start_main_#t~mem36#1_136|) (or .cse13 .cse14)) (and .cse4 .cse8 (= |v_ULTIMATE.start_main_#t~ite37#1_133| v_~x$w_buff1~0_223) .cse5)) (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~ite38#1_114|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~__unbuffered_p0_EAX~0_143 1) (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~__unbuffered_p1_EAX~0_82 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_340) v_~x$w_buff0_used~0_339))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_217, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_191|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_135|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_138|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_340, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_144, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_190|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_444|, ~#x~0.base=|v_~#x~0.base_233|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_143, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_339, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_443|, ~#x~0.base=|v_~#x~0.base_233|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_113|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_136|, |v_ULTIMATE.start_main_#t~ite37#1_133|, |v_ULTIMATE.start_main_#t~ite41#1_188|, |v_ULTIMATE.start_main_#t~ite38#1_114|, |v_ULTIMATE.start_main_#t~mem40#1_189|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~pre34#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:12:11,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [717] L814-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P1Thread1of1ForFork0_#res.offset_5| 0) (= |v_P1Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [735] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_340 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_339 256) 0))) (.cse10 (not .cse12)) (.cse13 (= (mod v_~x$r_buff1_thd0~0_104 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_345 256) 0))) (let ((.cse7 (select |v_#memory_int_444| |v_~#x~0.base_233|)) (.cse4 (not .cse14)) (.cse5 (not .cse13)) (.cse3 (and .cse6 .cse10)) (.cse9 (not .cse11))) (and (let ((.cse0 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_93 256))) (.cse2 (= |v_ULTIMATE.start_main_#t~mem40#1_189| |v_ULTIMATE.start_main_#t~mem40#1_191|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_138 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_144) .cse1 .cse2) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~mem40#1_189|) (= |v_ULTIMATE.start_main_#t~mem40#1_189| (select (select |v_#memory_int_443| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96))))) (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_143)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~ite41#1_190|) (= v_~__unbuffered_p0_EAX~0_144 v_~__unbuffered_p0_EAX~0_143) .cse2))) (= v_~weak$$choice1~0_138 |v_ULTIMATE.start_main_#t~nondet39#1_117|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse6) (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= (store |v_#memory_int_444| |v_~#x~0.base_233| (store .cse7 |v_~#x~0.offset_233| |v_ULTIMATE.start_main_#t~ite38#1_114|)) |v_#memory_int_443|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem36#1_138| |v_ULTIMATE.start_main_#t~mem36#1_136|))) (or (and .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite37#1_135| |v_ULTIMATE.start_main_#t~ite37#1_133|) (= |v_ULTIMATE.start_main_#t~ite38#1_114| v_~x$w_buff0~0_217) .cse10) (and (or .cse11 .cse12) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~mem36#1_136|) (= (select .cse7 |v_~#x~0.offset_233|) |v_ULTIMATE.start_main_#t~mem36#1_136|) (or .cse13 .cse14)) (and .cse4 .cse8 (= |v_ULTIMATE.start_main_#t~ite37#1_133| v_~x$w_buff1~0_223) .cse5)) (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~ite38#1_114|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~__unbuffered_p0_EAX~0_143 1) (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~__unbuffered_p1_EAX~0_82 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_340) v_~x$w_buff0_used~0_339))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_217, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_191|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_135|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_138|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_340, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_144, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_190|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_444|, ~#x~0.base=|v_~#x~0.base_233|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_143, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_339, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_443|, ~#x~0.base=|v_~#x~0.base_233|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_113|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_136|, |v_ULTIMATE.start_main_#t~ite37#1_133|, |v_ULTIMATE.start_main_#t~ite41#1_188|, |v_ULTIMATE.start_main_#t~ite38#1_114|, |v_ULTIMATE.start_main_#t~mem40#1_189|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~pre34#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:12:12,359 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] L783-->L788: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [735] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_340 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_339 256) 0))) (.cse10 (not .cse12)) (.cse13 (= (mod v_~x$r_buff1_thd0~0_104 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_345 256) 0))) (let ((.cse7 (select |v_#memory_int_444| |v_~#x~0.base_233|)) (.cse4 (not .cse14)) (.cse5 (not .cse13)) (.cse3 (and .cse6 .cse10)) (.cse9 (not .cse11))) (and (let ((.cse0 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_93 256))) (.cse2 (= |v_ULTIMATE.start_main_#t~mem40#1_189| |v_ULTIMATE.start_main_#t~mem40#1_191|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_138 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_144) .cse1 .cse2) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~mem40#1_189|) (= |v_ULTIMATE.start_main_#t~mem40#1_189| (select (select |v_#memory_int_443| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96))))) (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_143)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~ite41#1_190|) (= v_~__unbuffered_p0_EAX~0_144 v_~__unbuffered_p0_EAX~0_143) .cse2))) (= v_~weak$$choice1~0_138 |v_ULTIMATE.start_main_#t~nondet39#1_117|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse6) (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= (store |v_#memory_int_444| |v_~#x~0.base_233| (store .cse7 |v_~#x~0.offset_233| |v_ULTIMATE.start_main_#t~ite38#1_114|)) |v_#memory_int_443|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem36#1_138| |v_ULTIMATE.start_main_#t~mem36#1_136|))) (or (and .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite37#1_135| |v_ULTIMATE.start_main_#t~ite37#1_133|) (= |v_ULTIMATE.start_main_#t~ite38#1_114| v_~x$w_buff0~0_217) .cse10) (and (or .cse11 .cse12) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~mem36#1_136|) (= (select .cse7 |v_~#x~0.offset_233|) |v_ULTIMATE.start_main_#t~mem36#1_136|) (or .cse13 .cse14)) (and .cse4 .cse8 (= |v_ULTIMATE.start_main_#t~ite37#1_133| v_~x$w_buff1~0_223) .cse5)) (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~ite38#1_114|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~__unbuffered_p0_EAX~0_143 1) (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~__unbuffered_p1_EAX~0_82 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_340) v_~x$w_buff0_used~0_339))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_217, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_191|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_135|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_138|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_340, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_144, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_190|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_444|, ~#x~0.base=|v_~#x~0.base_233|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_143, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_339, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_443|, ~#x~0.base=|v_~#x~0.base_233|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_113|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_136|, |v_ULTIMATE.start_main_#t~ite37#1_133|, |v_ULTIMATE.start_main_#t~ite41#1_188|, |v_ULTIMATE.start_main_#t~ite38#1_114|, |v_ULTIMATE.start_main_#t~mem40#1_189|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~pre34#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:12:13,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] L814-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P1Thread1of1ForFork0_#res.offset_17| 0) (= |v_P1Thread1of1ForFork0_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_17|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_17|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [735] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse12 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_340 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_339 256) 0))) (.cse10 (not .cse12)) (.cse13 (= (mod v_~x$r_buff1_thd0~0_104 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_345 256) 0))) (let ((.cse7 (select |v_#memory_int_444| |v_~#x~0.base_233|)) (.cse4 (not .cse14)) (.cse5 (not .cse13)) (.cse3 (and .cse6 .cse10)) (.cse9 (not .cse11))) (and (let ((.cse0 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_93 256))) (.cse2 (= |v_ULTIMATE.start_main_#t~mem40#1_189| |v_ULTIMATE.start_main_#t~mem40#1_191|))) (or (and (not .cse0) (let ((.cse1 (= (mod v_~weak$$choice1~0_138 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_144) .cse1 .cse2) (and (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~mem40#1_189|) (= |v_ULTIMATE.start_main_#t~mem40#1_189| (select (select |v_#memory_int_443| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96))))) (= |v_ULTIMATE.start_main_#t~ite41#1_188| v_~__unbuffered_p0_EAX~0_143)) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite41#1_188| |v_ULTIMATE.start_main_#t~ite41#1_190|) (= v_~__unbuffered_p0_EAX~0_144 v_~__unbuffered_p0_EAX~0_143) .cse2))) (= v_~weak$$choice1~0_138 |v_ULTIMATE.start_main_#t~nondet39#1_117|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_345) v_~x$w_buff1_used~0_344) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse6) (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse5)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_225 3) 1 0) 0) 0 1)) (= (store |v_#memory_int_444| |v_~#x~0.base_233| (store .cse7 |v_~#x~0.offset_233| |v_ULTIMATE.start_main_#t~ite38#1_114|)) |v_#memory_int_443|) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem36#1_138| |v_ULTIMATE.start_main_#t~mem36#1_136|))) (or (and .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite37#1_135| |v_ULTIMATE.start_main_#t~ite37#1_133|) (= |v_ULTIMATE.start_main_#t~ite38#1_114| v_~x$w_buff0~0_217) .cse10) (and (or .cse11 .cse12) (or (and (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~mem36#1_136|) (= (select .cse7 |v_~#x~0.offset_233|) |v_ULTIMATE.start_main_#t~mem36#1_136|) (or .cse13 .cse14)) (and .cse4 .cse8 (= |v_ULTIMATE.start_main_#t~ite37#1_133| v_~x$w_buff1~0_223) .cse5)) (= |v_ULTIMATE.start_main_#t~ite37#1_133| |v_ULTIMATE.start_main_#t~ite38#1_114|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~__unbuffered_p0_EAX~0_143 1) (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~__unbuffered_p1_EAX~0_82 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_340) v_~x$w_buff0_used~0_339))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_217, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_117|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_191|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_345, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_135|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_138|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_340, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_144, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_190|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_444|, ~#x~0.base=|v_~#x~0.base_233|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_143, ~weak$$choice1~0=v_~weak$$choice1~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_67|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ~#x~0.offset=|v_~#x~0.offset_233|, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_96, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_339, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_96, #memory_int=|v_#memory_int_443|, ~#x~0.base=|v_~#x~0.base_233|, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_113|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~mem36#1_136|, |v_ULTIMATE.start_main_#t~ite37#1_133|, |v_ULTIMATE.start_main_#t~ite41#1_188|, |v_ULTIMATE.start_main_#t~ite38#1_114|, |v_ULTIMATE.start_main_#t~mem40#1_189|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~pre34#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite37#1, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem36#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 03:12:13,764 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:12:13,765 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7270 [2022-12-13 03:12:13,765 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 169 transitions, 3340 flow [2022-12-13 03:12:13,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:12:13,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:12:13,765 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:12:13,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:12:13,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:12:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:12:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1912616169, now seen corresponding path program 1 times [2022-12-13 03:12:13,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:12:13,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525551730] [2022-12-13 03:12:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:12:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:12:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:12:13,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 03:12:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:12:13,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 03:12:13,895 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 03:12:13,895 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:12:13,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:12:13,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:12:13,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:12:13,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:12:13,897 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:12:13,900 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:12:13,900 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:12:13,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:12:13 BasicIcfg [2022-12-13 03:12:13,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:12:13,990 INFO L158 Benchmark]: Toolchain (without parser) took 24551.98ms. Allocated memory was 196.1MB in the beginning and 881.9MB in the end (delta: 685.8MB). Free memory was 158.6MB in the beginning and 449.9MB in the end (delta: -291.3MB). Peak memory consumption was 395.6MB. Max. memory is 8.0GB. [2022-12-13 03:12:13,990 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory is still 173.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:12:13,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.66ms. Allocated memory is still 196.1MB. Free memory was 158.1MB in the beginning and 130.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 03:12:13,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.51ms. Allocated memory is still 196.1MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:12:13,991 INFO L158 Benchmark]: Boogie Preprocessor took 51.01ms. Allocated memory is still 196.1MB. Free memory was 128.2MB in the beginning and 125.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 03:12:13,991 INFO L158 Benchmark]: RCFGBuilder took 807.12ms. Allocated memory is still 196.1MB. Free memory was 125.6MB in the beginning and 156.1MB in the end (delta: -30.5MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. [2022-12-13 03:12:13,991 INFO L158 Benchmark]: TraceAbstraction took 23066.16ms. Allocated memory was 196.1MB in the beginning and 881.9MB in the end (delta: 685.8MB). Free memory was 155.0MB in the beginning and 449.9MB in the end (delta: -294.9MB). Peak memory consumption was 390.9MB. Max. memory is 8.0GB. [2022-12-13 03:12:13,992 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory is still 173.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 556.66ms. Allocated memory is still 196.1MB. Free memory was 158.1MB in the beginning and 130.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.51ms. Allocated memory is still 196.1MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.01ms. Allocated memory is still 196.1MB. Free memory was 128.2MB in the beginning and 125.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 807.12ms. Allocated memory is still 196.1MB. Free memory was 125.6MB in the beginning and 156.1MB in the end (delta: -30.5MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. * TraceAbstraction took 23066.16ms. Allocated memory was 196.1MB in the beginning and 881.9MB in the end (delta: 685.8MB). Free memory was 155.0MB in the beginning and 449.9MB in the end (delta: -294.9MB). Peak memory consumption was 390.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 119 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 29 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1176, independent: 1085, independent conditional: 1085, independent unconditional: 0, dependent: 91, dependent conditional: 91, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1176, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1176, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1176, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 830, independent: 794, independent conditional: 0, independent unconditional: 794, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 830, independent: 774, independent conditional: 0, independent unconditional: 774, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 262, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1176, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 830, unknown conditional: 0, unknown unconditional: 830] , Statistics on independence cache: Total cache size (in pairs): 1234, Positive cache size: 1198, Positive conditional cache size: 0, Positive unconditional cache size: 1198, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 41 PlacesBefore, 41 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 244, independent conditional: 72, independent unconditional: 172, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 260, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 37, unknown conditional: 0, unknown unconditional: 37] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 190, independent: 176, independent conditional: 176, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 190, independent: 176, independent conditional: 96, independent unconditional: 80, dependent: 14, dependent conditional: 8, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 190, independent: 176, independent conditional: 0, independent unconditional: 176, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 190, independent: 176, independent conditional: 0, independent unconditional: 176, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 190, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 104, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 208, independent: 170, independent conditional: 170, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 208, independent: 170, independent conditional: 132, independent unconditional: 38, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 246, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 208, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 189, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 189, independent: 168, independent conditional: 147, independent unconditional: 21, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 231, independent: 168, independent conditional: 84, independent unconditional: 84, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 231, independent: 168, independent conditional: 84, independent unconditional: 84, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 231, independent: 168, independent conditional: 84, independent unconditional: 84, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 126, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 161 TransitionsBefore, 161 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 253 TransitionsBefore, 253 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 319 TransitionsBefore, 319 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 62 PlacesBefore, 60 PlacesAfterwards, 171 TransitionsBefore, 169 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1737; [L851] FCALL, FORK 0 pthread_create(&t1737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1737, ((void *)0), P0, ((void *)0))=-3, t1737={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] 0 pthread_t t1738; [L853] FCALL, FORK 0 pthread_create(&t1738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1738, ((void *)0), P1, ((void *)0))=-2, t1737={6:0}, t1738={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] 0 pthread_t t1739; [L855] FCALL, FORK 0 pthread_create(&t1739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1739, ((void *)0), P2, ((void *)0))=-1, t1737={6:0}, t1738={7:0}, t1739={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 2 y = 1 [L797] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 2 x$flush_delayed = weak$$choice2 [L803] EXPR 2 \read(x) [L803] 2 x$mem_tmp = x [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] EXPR 2 \read(x) [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L805] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L806] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L807] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L808] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L810] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 2 \read(x) [L811] 2 __unbuffered_p1_EBX = x [L812] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L812] EXPR 2 \read(x) [L812] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L812] 2 x = x$flush_delayed ? x$mem_tmp : x [L813] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L825] 3 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 \read(x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L830] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L831] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L832] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L857] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 3 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 3 !(!cond) [L859] RET 3 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 3 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 3 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 3 \read(x) [L861] EXPR 3 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 3 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 3 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 3 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 3 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L869] EXPR 3 \read(*__unbuffered_p0_EAX$read_delayed_var) [L869] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L869] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 3 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L870] 3 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L872] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 3 !expression [L19] 3 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 658 IncrementalHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 2 mSDtfsCounter, 658 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5603occurred in iteration=8, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 1257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 03:12:14,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...