/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:43:59,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:43:59,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:43:59,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:43:59,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:43:59,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:43:59,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:43:59,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:43:59,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:43:59,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:43:59,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:43:59,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:43:59,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:43:59,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:43:59,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:43:59,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:43:59,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:43:59,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:43:59,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:43:59,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:43:59,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:43:59,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:43:59,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:43:59,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:43:59,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:43:59,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:43:59,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:43:59,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:43:59,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:43:59,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:43:59,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:43:59,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:43:59,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:43:59,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:43:59,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:43:59,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:43:59,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:43:59,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:43:59,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:43:59,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:43:59,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:43:59,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 11:43:59,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:43:59,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:43:59,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:43:59,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:43:59,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:43:59,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:43:59,126 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:43:59,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:43:59,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:43:59,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:43:59,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:43:59,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:43:59,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:43:59,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:43:59,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:43:59,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:43:59,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:43:59,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:43:59,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:43:59,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:43:59,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:43:59,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:43:59,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:43:59,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:43:59,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:43:59,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:43:59,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:43:59,128 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:43:59,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:43:59,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:43:59,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:43:59,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:43:59,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:43:59,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:43:59,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:43:59,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:43:59,417 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:43:59,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i [2022-12-12 11:44:00,411 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:44:00,599 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:44:00,600 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i [2022-12-12 11:44:00,627 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f702f99f/8887418b5dab4300a975ef24ecea0728/FLAGc6fa34c78 [2022-12-12 11:44:00,641 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f702f99f/8887418b5dab4300a975ef24ecea0728 [2022-12-12 11:44:00,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:44:00,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:44:00,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:44:00,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:44:00,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:44:00,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:44:00" (1/1) ... [2022-12-12 11:44:00,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239911b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:00, skipping insertion in model container [2022-12-12 11:44:00,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:44:00" (1/1) ... [2022-12-12 11:44:00,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:44:00,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:44:00,841 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/mix006_tso.oepc.i[949,962] [2022-12-12 11:44:00,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:00,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:00,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:00,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:00,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:00,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:00,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:00,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:00,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:00,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:00,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:44:01,062 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:44:01,070 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/mix006_tso.oepc.i[949,962] [2022-12-12 11:44:01,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:44:01,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:44:01,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:44:01,158 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:44:01,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01 WrapperNode [2022-12-12 11:44:01,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:44:01,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:44:01,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:44:01,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:44:01,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,207 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 256 [2022-12-12 11:44:01,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:44:01,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:44:01,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:44:01,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:44:01,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,232 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:44:01,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:44:01,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:44:01,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:44:01,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (1/1) ... [2022-12-12 11:44:01,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:44:01,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:44:01,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 11:44:01,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 11:44:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:44:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:44:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:44:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:44:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:44:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 11:44:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 11:44:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 11:44:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 11:44:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 11:44:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 11:44:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:44:01,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:44:01,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:44:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:44:01,322 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:44:01,463 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:44:01,464 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:44:01,778 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:44:01,910 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:44:01,910 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 11:44:01,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:44:01 BoogieIcfgContainer [2022-12-12 11:44:01,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:44:01,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:44:01,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:44:01,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:44:01,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:44:00" (1/3) ... [2022-12-12 11:44:01,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fbd20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:44:01, skipping insertion in model container [2022-12-12 11:44:01,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:44:01" (2/3) ... [2022-12-12 11:44:01,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fbd20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:44:01, skipping insertion in model container [2022-12-12 11:44:01,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:44:01" (3/3) ... [2022-12-12 11:44:01,918 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_tso.oepc.i [2022-12-12 11:44:01,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:44:01,930 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-12 11:44:01,931 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:44:01,971 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:44:01,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-12-12 11:44:02,052 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-12 11:44:02,052 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:44:02,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-12 11:44:02,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 129 transitions, 273 flow [2022-12-12 11:44:02,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 126 transitions, 261 flow [2022-12-12 11:44:02,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:44:02,076 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1de85afc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:44:02,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-12 11:44:02,093 INFO L130 PetriNetUnfolder]: 0/74 cut-off events. [2022-12-12 11:44:02,093 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:44:02,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:02,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:02,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:02,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2006177264, now seen corresponding path program 1 times [2022-12-12 11:44:02,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:02,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76791005] [2022-12-12 11:44:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:02,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:02,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76791005] [2022-12-12 11:44:02,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76791005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:02,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:02,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:44:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480660603] [2022-12-12 11:44:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:02,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:44:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:02,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:44:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:44:02,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 129 [2022-12-12 11:44:02,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 126 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:02,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:02,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 129 [2022-12-12 11:44:02,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:02,927 INFO L130 PetriNetUnfolder]: 280/1423 cut-off events. [2022-12-12 11:44:02,927 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-12 11:44:02,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 1423 events. 280/1423 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11633 event pairs, 186 based on Foata normal form. 56/1342 useless extension candidates. Maximal degree in co-relation 1830. Up to 377 conditions per place. [2022-12-12 11:44:02,938 INFO L137 encePairwiseOnDemand]: 124/129 looper letters, 21 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2022-12-12 11:44:02,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 130 transitions, 318 flow [2022-12-12 11:44:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:44:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:44:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2022-12-12 11:44:02,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9250645994832042 [2022-12-12 11:44:02,955 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 0 predicate places. [2022-12-12 11:44:02,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 130 transitions, 318 flow [2022-12-12 11:44:02,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 130 transitions, 312 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-12 11:44:02,960 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 130 transitions, 312 flow [2022-12-12 11:44:02,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:02,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:02,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:02,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:44:02,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash -511730774, now seen corresponding path program 1 times [2022-12-12 11:44:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:02,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726356827] [2022-12-12 11:44:02,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:03,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:03,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726356827] [2022-12-12 11:44:03,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726356827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:03,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:03,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:44:03,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379037860] [2022-12-12 11:44:03,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:03,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:44:03,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:44:03,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:44:03,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 129 [2022-12-12 11:44:03,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 130 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:03,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:03,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 129 [2022-12-12 11:44:03,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:03,298 INFO L130 PetriNetUnfolder]: 221/1146 cut-off events. [2022-12-12 11:44:03,298 INFO L131 PetriNetUnfolder]: For 57/701 co-relation queries the response was YES. [2022-12-12 11:44:03,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1882 conditions, 1146 events. 221/1146 cut-off events. For 57/701 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8730 event pairs, 56 based on Foata normal form. 0/1078 useless extension candidates. Maximal degree in co-relation 1816. Up to 301 conditions per place. [2022-12-12 11:44:03,304 INFO L137 encePairwiseOnDemand]: 126/129 looper letters, 28 selfloop transitions, 3 changer transitions 0/138 dead transitions. [2022-12-12 11:44:03,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 138 transitions, 406 flow [2022-12-12 11:44:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:44:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:44:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2022-12-12 11:44:03,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9095607235142119 [2022-12-12 11:44:03,308 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, -2 predicate places. [2022-12-12 11:44:03,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 138 transitions, 406 flow [2022-12-12 11:44:03,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 138 transitions, 404 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 11:44:03,311 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 138 transitions, 404 flow [2022-12-12 11:44:03,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:03,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:03,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:03,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:44:03,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash 421270688, now seen corresponding path program 1 times [2022-12-12 11:44:03,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:03,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769346649] [2022-12-12 11:44:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:03,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:03,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:03,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769346649] [2022-12-12 11:44:03,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769346649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:03,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:03,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:44:03,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745329565] [2022-12-12 11:44:03,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:03,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:44:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:03,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:44:03,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:44:03,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 129 [2022-12-12 11:44:03,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 138 transitions, 404 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:03,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:03,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 129 [2022-12-12 11:44:03,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:04,501 INFO L130 PetriNetUnfolder]: 1671/3667 cut-off events. [2022-12-12 11:44:04,501 INFO L131 PetriNetUnfolder]: For 2251/6016 co-relation queries the response was YES. [2022-12-12 11:44:04,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9263 conditions, 3667 events. 1671/3667 cut-off events. For 2251/6016 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 27566 event pairs, 247 based on Foata normal form. 3/3579 useless extension candidates. Maximal degree in co-relation 9184. Up to 1393 conditions per place. [2022-12-12 11:44:04,535 INFO L137 encePairwiseOnDemand]: 123/129 looper letters, 53 selfloop transitions, 3 changer transitions 103/239 dead transitions. [2022-12-12 11:44:04,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 239 transitions, 1224 flow [2022-12-12 11:44:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:44:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:44:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 927 transitions. [2022-12-12 11:44:04,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7984496124031008 [2022-12-12 11:44:04,539 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 6 predicate places. [2022-12-12 11:44:04,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 239 transitions, 1224 flow [2022-12-12 11:44:04,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 239 transitions, 1118 flow, removed 53 selfloop flow, removed 0 redundant places. [2022-12-12 11:44:04,547 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 239 transitions, 1118 flow [2022-12-12 11:44:04,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:04,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:04,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:04,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:44:04,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1604333577, now seen corresponding path program 1 times [2022-12-12 11:44:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:04,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413862658] [2022-12-12 11:44:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:04,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:05,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413862658] [2022-12-12 11:44:05,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413862658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:05,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:05,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:44:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293854573] [2022-12-12 11:44:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:05,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:44:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:05,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:44:05,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:44:05,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 129 [2022-12-12 11:44:05,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 239 transitions, 1118 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:05,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:05,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 129 [2022-12-12 11:44:05,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:05,848 INFO L130 PetriNetUnfolder]: 2307/4953 cut-off events. [2022-12-12 11:44:05,848 INFO L131 PetriNetUnfolder]: For 1877/6369 co-relation queries the response was YES. [2022-12-12 11:44:05,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14570 conditions, 4953 events. 2307/4953 cut-off events. For 1877/6369 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 39325 event pairs, 127 based on Foata normal form. 5/4866 useless extension candidates. Maximal degree in co-relation 14489. Up to 1773 conditions per place. [2022-12-12 11:44:05,865 INFO L137 encePairwiseOnDemand]: 121/129 looper letters, 61 selfloop transitions, 6 changer transitions 245/392 dead transitions. [2022-12-12 11:44:05,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 392 transitions, 2612 flow [2022-12-12 11:44:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:44:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:44:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1018 transitions. [2022-12-12 11:44:05,868 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7891472868217054 [2022-12-12 11:44:05,869 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 15 predicate places. [2022-12-12 11:44:05,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 392 transitions, 2612 flow [2022-12-12 11:44:05,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 392 transitions, 2414 flow, removed 98 selfloop flow, removed 1 redundant places. [2022-12-12 11:44:05,878 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 392 transitions, 2414 flow [2022-12-12 11:44:05,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:05,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:05,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:05,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:44:05,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 643741033, now seen corresponding path program 1 times [2022-12-12 11:44:05,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:05,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463335721] [2022-12-12 11:44:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:06,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:06,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463335721] [2022-12-12 11:44:06,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463335721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:06,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:06,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:44:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229313363] [2022-12-12 11:44:06,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:06,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:44:06,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:06,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:44:06,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:44:06,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 129 [2022-12-12 11:44:06,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 392 transitions, 2414 flow. Second operand has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:06,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:06,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 129 [2022-12-12 11:44:06,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:07,280 INFO L130 PetriNetUnfolder]: 3653/7226 cut-off events. [2022-12-12 11:44:07,280 INFO L131 PetriNetUnfolder]: For 10516/11700 co-relation queries the response was YES. [2022-12-12 11:44:07,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22085 conditions, 7226 events. 3653/7226 cut-off events. For 10516/11700 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 53852 event pairs, 181 based on Foata normal form. 0/6940 useless extension candidates. Maximal degree in co-relation 22011. Up to 2505 conditions per place. [2022-12-12 11:44:07,306 INFO L137 encePairwiseOnDemand]: 119/129 looper letters, 127 selfloop transitions, 9 changer transitions 340/577 dead transitions. [2022-12-12 11:44:07,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 577 transitions, 4640 flow [2022-12-12 11:44:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:44:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:44:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1114 transitions. [2022-12-12 11:44:07,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8635658914728682 [2022-12-12 11:44:07,309 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 23 predicate places. [2022-12-12 11:44:07,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 577 transitions, 4640 flow [2022-12-12 11:44:07,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 577 transitions, 4636 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-12 11:44:07,317 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 577 transitions, 4636 flow [2022-12-12 11:44:07,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:07,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:07,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:07,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:44:07,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:07,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:07,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1250869470, now seen corresponding path program 1 times [2022-12-12 11:44:07,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:07,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485693484] [2022-12-12 11:44:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:07,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:07,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485693484] [2022-12-12 11:44:07,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485693484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:07,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:07,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:44:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998667339] [2022-12-12 11:44:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:07,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:44:07,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:07,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:44:07,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:44:07,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 129 [2022-12-12 11:44:07,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 577 transitions, 4636 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:07,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:07,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 129 [2022-12-12 11:44:07,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:08,507 INFO L130 PetriNetUnfolder]: 2514/4770 cut-off events. [2022-12-12 11:44:08,507 INFO L131 PetriNetUnfolder]: For 9808/11308 co-relation queries the response was YES. [2022-12-12 11:44:08,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18420 conditions, 4770 events. 2514/4770 cut-off events. For 9808/11308 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 32525 event pairs, 87 based on Foata normal form. 98/4682 useless extension candidates. Maximal degree in co-relation 18344. Up to 1637 conditions per place. [2022-12-12 11:44:08,532 INFO L137 encePairwiseOnDemand]: 119/129 looper letters, 132 selfloop transitions, 22 changer transitions 337/592 dead transitions. [2022-12-12 11:44:08,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 592 transitions, 5544 flow [2022-12-12 11:44:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:44:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:44:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1453 transitions. [2022-12-12 11:44:08,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8664281454979129 [2022-12-12 11:44:08,538 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 34 predicate places. [2022-12-12 11:44:08,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 592 transitions, 5544 flow [2022-12-12 11:44:08,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 592 transitions, 5114 flow, removed 207 selfloop flow, removed 4 redundant places. [2022-12-12 11:44:08,551 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 592 transitions, 5114 flow [2022-12-12 11:44:08,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:08,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:08,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:08,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:44:08,552 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1733649902, now seen corresponding path program 1 times [2022-12-12 11:44:08,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:08,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363790011] [2022-12-12 11:44:08,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:08,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:08,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:08,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363790011] [2022-12-12 11:44:08,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363790011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:08,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:08,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 11:44:08,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256336671] [2022-12-12 11:44:08,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:08,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 11:44:08,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:08,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 11:44:08,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 11:44:08,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 129 [2022-12-12 11:44:08,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 592 transitions, 5114 flow. Second operand has 8 states, 8 states have (on average 102.625) internal successors, (821), 8 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:08,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:08,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 129 [2022-12-12 11:44:08,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:09,830 INFO L130 PetriNetUnfolder]: 2410/4420 cut-off events. [2022-12-12 11:44:09,830 INFO L131 PetriNetUnfolder]: For 9408/10871 co-relation queries the response was YES. [2022-12-12 11:44:09,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19515 conditions, 4420 events. 2410/4420 cut-off events. For 9408/10871 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 30263 event pairs, 83 based on Foata normal form. 136/4414 useless extension candidates. Maximal degree in co-relation 19438. Up to 1474 conditions per place. [2022-12-12 11:44:09,848 INFO L137 encePairwiseOnDemand]: 119/129 looper letters, 117 selfloop transitions, 26 changer transitions 349/583 dead transitions. [2022-12-12 11:44:09,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 583 transitions, 6054 flow [2022-12-12 11:44:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 11:44:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 11:44:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1736 transitions. [2022-12-12 11:44:09,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8410852713178295 [2022-12-12 11:44:09,853 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 33 predicate places. [2022-12-12 11:44:09,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 583 transitions, 6054 flow [2022-12-12 11:44:09,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 583 transitions, 5378 flow, removed 311 selfloop flow, removed 7 redundant places. [2022-12-12 11:44:09,868 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 583 transitions, 5378 flow [2022-12-12 11:44:09,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.625) internal successors, (821), 8 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:09,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:09,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:09,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:44:09,870 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash -787456765, now seen corresponding path program 1 times [2022-12-12 11:44:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:09,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890191669] [2022-12-12 11:44:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:10,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:10,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890191669] [2022-12-12 11:44:10,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890191669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:10,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:10,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:44:10,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169590782] [2022-12-12 11:44:10,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:10,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:44:10,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:44:10,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:44:10,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 129 [2022-12-12 11:44:10,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 583 transitions, 5378 flow. Second operand has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:10,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:10,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 129 [2022-12-12 11:44:10,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:11,264 INFO L130 PetriNetUnfolder]: 4222/7726 cut-off events. [2022-12-12 11:44:11,264 INFO L131 PetriNetUnfolder]: For 25163/28684 co-relation queries the response was YES. [2022-12-12 11:44:11,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31850 conditions, 7726 events. 4222/7726 cut-off events. For 25163/28684 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 59923 event pairs, 150 based on Foata normal form. 219/7776 useless extension candidates. Maximal degree in co-relation 31771. Up to 2819 conditions per place. [2022-12-12 11:44:11,282 INFO L137 encePairwiseOnDemand]: 123/129 looper letters, 111 selfloop transitions, 1 changer transitions 645/874 dead transitions. [2022-12-12 11:44:11,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 874 transitions, 9872 flow [2022-12-12 11:44:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 11:44:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 11:44:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 753 transitions. [2022-12-12 11:44:11,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8338870431893688 [2022-12-12 11:44:11,285 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 32 predicate places. [2022-12-12 11:44:11,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 874 transitions, 9872 flow [2022-12-12 11:44:11,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 874 transitions, 9864 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 11:44:11,298 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 874 transitions, 9864 flow [2022-12-12 11:44:11,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:11,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:11,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:11,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:44:11,299 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash -227275249, now seen corresponding path program 2 times [2022-12-12 11:44:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:11,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995318888] [2022-12-12 11:44:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:11,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:12,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995318888] [2022-12-12 11:44:12,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995318888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:12,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:12,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 11:44:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346372658] [2022-12-12 11:44:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:12,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 11:44:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:12,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 11:44:12,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-12 11:44:12,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 129 [2022-12-12 11:44:12,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 874 transitions, 9864 flow. Second operand has 12 states, 12 states have (on average 92.75) internal successors, (1113), 12 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:12,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:12,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 129 [2022-12-12 11:44:12,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:14,166 INFO L130 PetriNetUnfolder]: 6620/11958 cut-off events. [2022-12-12 11:44:14,166 INFO L131 PetriNetUnfolder]: For 59629/69119 co-relation queries the response was YES. [2022-12-12 11:44:14,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55231 conditions, 11958 events. 6620/11958 cut-off events. For 59629/69119 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 97778 event pairs, 173 based on Foata normal form. 568/12378 useless extension candidates. Maximal degree in co-relation 55140. Up to 4327 conditions per place. [2022-12-12 11:44:14,198 INFO L137 encePairwiseOnDemand]: 116/129 looper letters, 79 selfloop transitions, 23 changer transitions 1110/1295 dead transitions. [2022-12-12 11:44:14,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1295 transitions, 17584 flow [2022-12-12 11:44:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 11:44:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 11:44:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1047 transitions. [2022-12-12 11:44:14,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7378435517970402 [2022-12-12 11:44:14,201 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 42 predicate places. [2022-12-12 11:44:14,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 1295 transitions, 17584 flow [2022-12-12 11:44:14,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1295 transitions, 16578 flow, removed 461 selfloop flow, removed 4 redundant places. [2022-12-12 11:44:14,226 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 1295 transitions, 16578 flow [2022-12-12 11:44:14,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 92.75) internal successors, (1113), 12 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:14,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:14,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:14,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 11:44:14,227 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:14,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1601956633, now seen corresponding path program 3 times [2022-12-12 11:44:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:14,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439321810] [2022-12-12 11:44:14,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:14,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:44:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:44:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:44:16,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439321810] [2022-12-12 11:44:16,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439321810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:44:16,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:44:16,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-12 11:44:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731951659] [2022-12-12 11:44:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:44:16,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 11:44:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:44:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 11:44:16,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-12 11:44:16,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2022-12-12 11:44:16,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1295 transitions, 16578 flow. Second operand has 15 states, 15 states have (on average 95.93333333333334) internal successors, (1439), 15 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:16,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:44:16,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2022-12-12 11:44:16,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:44:18,220 INFO L130 PetriNetUnfolder]: 7484/13880 cut-off events. [2022-12-12 11:44:18,220 INFO L131 PetriNetUnfolder]: For 87750/99102 co-relation queries the response was YES. [2022-12-12 11:44:18,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66070 conditions, 13880 events. 7484/13880 cut-off events. For 87750/99102 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 119241 event pairs, 179 based on Foata normal form. 1680/15418 useless extension candidates. Maximal degree in co-relation 65982. Up to 4811 conditions per place. [2022-12-12 11:44:18,264 INFO L137 encePairwiseOnDemand]: 116/129 looper letters, 66 selfloop transitions, 40 changer transitions 1437/1632 dead transitions. [2022-12-12 11:44:18,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1632 transitions, 24086 flow [2022-12-12 11:44:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 11:44:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 11:44:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1485 transitions. [2022-12-12 11:44:18,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7674418604651163 [2022-12-12 11:44:18,267 INFO L295 CegarLoopForPetriNet]: 134 programPoint places, 52 predicate places. [2022-12-12 11:44:18,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1632 transitions, 24086 flow [2022-12-12 11:44:18,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1632 transitions, 24055 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-12 11:44:18,296 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1632 transitions, 24055 flow [2022-12-12 11:44:18,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 95.93333333333334) internal successors, (1439), 15 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:44:18,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:44:18,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:18,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 11:44:18,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-12 11:44:18,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:44:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -443291217, now seen corresponding path program 4 times [2022-12-12 11:44:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:44:18,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863449262] [2022-12-12 11:44:18,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:44:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:44:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:44:18,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:44:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:44:18,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:44:18,611 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:44:18,612 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-12 11:44:18,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-12 11:44:18,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-12 11:44:18,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2022-12-12 11:44:18,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2022-12-12 11:44:18,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2022-12-12 11:44:18,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2022-12-12 11:44:18,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2022-12-12 11:44:18,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 11:44:18,614 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:44:18,618 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:44:18,619 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:44:18,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:44:18 BasicIcfg [2022-12-12 11:44:18,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:44:18,742 INFO L158 Benchmark]: Toolchain (without parser) took 18098.01ms. Allocated memory was 179.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 138.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 273.2MB. Max. memory is 8.0GB. [2022-12-12 11:44:18,742 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:44:18,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.60ms. Allocated memory is still 179.3MB. Free memory was 137.9MB in the beginning and 145.8MB in the end (delta: -7.9MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2022-12-12 11:44:18,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.80ms. Allocated memory is still 179.3MB. Free memory was 145.8MB in the beginning and 141.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-12 11:44:18,743 INFO L158 Benchmark]: Boogie Preprocessor took 28.09ms. Allocated memory is still 179.3MB. Free memory was 141.7MB in the beginning and 139.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:44:18,743 INFO L158 Benchmark]: RCFGBuilder took 674.01ms. Allocated memory is still 179.3MB. Free memory was 139.1MB in the beginning and 123.6MB in the end (delta: 15.5MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. [2022-12-12 11:44:18,744 INFO L158 Benchmark]: TraceAbstraction took 16827.39ms. Allocated memory was 179.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 122.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 256.4MB. Max. memory is 8.0GB. [2022-12-12 11:44:18,745 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.14ms. Allocated memory is still 179.3MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 512.60ms. Allocated memory is still 179.3MB. Free memory was 137.9MB in the beginning and 145.8MB in the end (delta: -7.9MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.80ms. Allocated memory is still 179.3MB. Free memory was 145.8MB in the beginning and 141.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.09ms. Allocated memory is still 179.3MB. Free memory was 141.7MB in the beginning and 139.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 674.01ms. Allocated memory is still 179.3MB. Free memory was 139.1MB in the beginning and 123.6MB in the end (delta: 15.5MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16827.39ms. Allocated memory was 179.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 122.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 256.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L723] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L724] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L725] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L726] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L727] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L728] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L729] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L730] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L731] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L732] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L733] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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}] [L734] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L735] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L736] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L737] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L739] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L740] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0] [L741] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0] [L742] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L743] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L744] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L745] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L746] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L747] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L748] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L749] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L750] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L751] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L752] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L753] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L754] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L755] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L899] 0 pthread_t t171; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t171={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L900] FCALL, FORK 0 pthread_create(&t171, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t171, ((void *)0), P0, ((void *)0))=-2, t171={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L901] 0 pthread_t t172; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171={5:0}, t172={6:0}, weak$$choice0=0, weak$$choice2=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L902] FCALL, FORK 0 pthread_create(&t172, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t172, ((void *)0), P1, ((void *)0))=-1, t171={5:0}, t172={6:0}, weak$$choice0=0, weak$$choice2=0, x=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 2 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L787] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L787] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L903] 0 pthread_t t173; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L904] FCALL, FORK 0 pthread_create(&t173, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t173, ((void *)0), P2, ((void *)0))=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 2 x$flush_delayed = weak$$choice2 [L798] 2 x$mem_tmp = x [L799] 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) [L800] 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)) [L801] 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)) [L802] 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)) [L803] 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)) [L804] 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)) [L805] 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)) [L806] 2 __unbuffered_p1_EAX = x [L807] 2 x = x$flush_delayed ? x$mem_tmp : x [L808] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 2 y$flush_delayed = weak$$choice2 [L814] 2 y$mem_tmp = y [L815] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L816] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L817] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L818] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L819] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L820] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L821] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L822] 2 __unbuffered_p1_EBX = y [L823] 2 y = y$flush_delayed ? y$mem_tmp : y [L824] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 3 y$w_buff1 = y$w_buff0 [L842] 3 y$w_buff0 = 1 [L843] 3 y$w_buff1_used = y$w_buff0_used [L844] 3 y$w_buff0_used = (_Bool)1 [L845] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L845] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L846] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L847] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L848] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L849] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L850] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 3 y$flush_delayed = weak$$choice2 [L856] 3 y$mem_tmp = y [L857] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L858] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L859] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L860] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L861] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L862] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L863] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L864] 3 __unbuffered_p2_EAX = y [L865] 3 y = y$flush_delayed ? y$mem_tmp : y [L866] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L869] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L872] 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) [L873] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L874] 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 [L875] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L876] 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 [L877] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L878] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L879] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L880] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L881] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L828] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L829] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L830] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L831] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L884] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L906] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L908] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L908] RET 0 assume_abort_if_not(main$tmp_guard0) [L910] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L911] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L912] 0 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 [L913] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L914] 0 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 [L915] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L916] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L917] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L918] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L919] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L922] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L923] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L924] 0 x$flush_delayed = weak$$choice2 [L925] 0 x$mem_tmp = x [L926] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L927] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L928] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L929] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L930] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L931] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L932] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L933] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L934] 0 x = x$flush_delayed ? x$mem_tmp : x [L935] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L937] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 900]: 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: 902]: 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: 904]: 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, 159 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 842 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 842 mSDsluCounter, 596 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 486 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1727 IncrementalHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 110 mSDtfsCounter, 1727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24055occurred in iteration=10, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 2467 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1022 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 4212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 11:44:18,782 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...