/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:40:56,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:40:56,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:40:56,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:40:56,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:40:56,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:40:56,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:40:56,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:40:56,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:40:56,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:40:56,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:40:56,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:40:56,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:40:56,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:40:56,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:40:56,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:40:56,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:40:56,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:40:56,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:40:56,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:40:56,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:40:56,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:40:56,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:40:56,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:40:56,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:40:56,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:40:56,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:40:56,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:40:56,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:40:56,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:40:56,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:40:56,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:40:56,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:40:56,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:40:56,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:40:56,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:40:56,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:40:56,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:40:56,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:40:56,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:40:56,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:40:56,630 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-06 16:40:56,658 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:40:56,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:40:56,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:40:56,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:40:56,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:40:56,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:40:56,660 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:40:56,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:40:56,661 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:40:56,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:40:56,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:40:56,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:40:56,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:40:56,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:40:56,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:40:56,662 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:40:56,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:40:56,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:40:56,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:40:56,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:40:56,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:40:56,662 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:40:56,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:40:56,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:40:56,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:40:56,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:40:56,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:40:56,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:40:56,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:40:56,663 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:40:56,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:40:56,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:40:56,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:40:56,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:40:56,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:40:56,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:40:56,955 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:40:56,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:40:57,952 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:40:58,158 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:40:58,159 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:40:58,175 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c26bfabae/79a3e452d8744c5cb641d773c35dbd6c/FLAGfcce59f73 [2022-12-06 16:40:58,194 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c26bfabae/79a3e452d8744c5cb641d773c35dbd6c [2022-12-06 16:40:58,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:40:58,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:40:58,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:40:58,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:40:58,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:40:58,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2f6309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58, skipping insertion in model container [2022-12-06 16:40:58,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:40:58,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:40:58,361 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 16:40:58,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:40:58,565 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:40:58,575 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 16:40:58,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:58,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:58,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:40:58,660 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:40:58,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58 WrapperNode [2022-12-06 16:40:58,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:40:58,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:40:58,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:40:58,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:40:58,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,712 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-06 16:40:58,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:40:58,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:40:58,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:40:58,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:40:58,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,738 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:40:58,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:40:58,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:40:58,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:40:58,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (1/1) ... [2022-12-06 16:40:58,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:40:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:40:58,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 16:40:58,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 16:40:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:40:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:40:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:40:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:40:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:40:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:40:58,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:40:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:40:58,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:40:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:40:58,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:40:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:40:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:40:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:40:58,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:40:58,824 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:40:58,979 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:40:58,981 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:40:59,169 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:40:59,277 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:40:59,278 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:40:59,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:40:59 BoogieIcfgContainer [2022-12-06 16:40:59,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:40:59,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:40:59,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:40:59,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:40:59,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:40:58" (1/3) ... [2022-12-06 16:40:59,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73666f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:40:59, skipping insertion in model container [2022-12-06 16:40:59,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:58" (2/3) ... [2022-12-06 16:40:59,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73666f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:40:59, skipping insertion in model container [2022-12-06 16:40:59,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:40:59" (3/3) ... [2022-12-06 16:40:59,286 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:40:59,299 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:40:59,299 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:40:59,299 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:40:59,335 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:40:59,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 16:40:59,439 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-06 16:40:59,440 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:40:59,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 16:40:59,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 16:40:59,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-06 16:40:59,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:40:59,477 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;@4cb02939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:40:59,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:40:59,530 INFO L130 PetriNetUnfolder]: 0/68 cut-off events. [2022-12-06 16:40:59,530 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:40:59,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:40:59,530 INFO L213 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] [2022-12-06 16:40:59,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:40:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:40:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash 522631231, now seen corresponding path program 1 times [2022-12-06 16:40:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:40:59,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301059750] [2022-12-06 16:40:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:40:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:40:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:41:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:00,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301059750] [2022-12-06 16:41:00,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301059750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:00,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:00,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:41:00,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313599395] [2022-12-06 16:41:00,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:00,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:41:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:41:00,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:41:00,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2022-12-06 16:41:00,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:00,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:00,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2022-12-06 16:41:00,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:00,161 INFO L130 PetriNetUnfolder]: 10/165 cut-off events. [2022-12-06 16:41:00,161 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 16:41:00,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 165 events. 10/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 328 event pairs, 4 based on Foata normal form. 5/161 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2022-12-06 16:41:00,164 INFO L137 encePairwiseOnDemand]: 101/106 looper letters, 8 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2022-12-06 16:41:00,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 101 transitions, 231 flow [2022-12-06 16:41:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:41:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:41:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-12-06 16:41:00,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9339622641509434 [2022-12-06 16:41:00,183 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-12-06 16:41:00,183 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 231 flow [2022-12-06 16:41:00,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:00,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:00,184 INFO L213 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] [2022-12-06 16:41:00,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:41:00,185 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:41:00,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:00,186 INFO L85 PathProgramCache]: Analyzing trace with hash -890217232, now seen corresponding path program 1 times [2022-12-06 16:41:00,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:00,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809029946] [2022-12-06 16:41:00,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:00,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:41:00,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:00,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809029946] [2022-12-06 16:41:00,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809029946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:00,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:00,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:41:00,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905978971] [2022-12-06 16:41:00,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:00,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:41:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:00,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:41:00,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:41:00,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-06 16:41:00,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 101 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:00,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:00,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-06 16:41:00,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:01,078 INFO L130 PetriNetUnfolder]: 673/2013 cut-off events. [2022-12-06 16:41:01,078 INFO L131 PetriNetUnfolder]: For 358/672 co-relation queries the response was YES. [2022-12-06 16:41:01,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 2013 events. 673/2013 cut-off events. For 358/672 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15770 event pairs, 113 based on Foata normal form. 3/1952 useless extension candidates. Maximal degree in co-relation 3529. Up to 496 conditions per place. [2022-12-06 16:41:01,094 INFO L137 encePairwiseOnDemand]: 97/106 looper letters, 30 selfloop transitions, 6 changer transitions 62/168 dead transitions. [2022-12-06 16:41:01,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 168 transitions, 613 flow [2022-12-06 16:41:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:41:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:41:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 819 transitions. [2022-12-06 16:41:01,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8584905660377359 [2022-12-06 16:41:01,098 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2022-12-06 16:41:01,098 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 168 transitions, 613 flow [2022-12-06 16:41:01,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:01,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:01,099 INFO L213 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] [2022-12-06 16:41:01,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:41:01,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:41:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash -358306929, now seen corresponding path program 1 times [2022-12-06 16:41:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:01,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467505531] [2022-12-06 16:41:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:41:01,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:01,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467505531] [2022-12-06 16:41:01,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467505531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:01,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:01,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:41:01,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919928695] [2022-12-06 16:41:01,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:01,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:41:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:01,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:41:01,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:41:01,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-06 16:41:01,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 168 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:01,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:01,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-06 16:41:01,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:01,862 INFO L130 PetriNetUnfolder]: 1796/4369 cut-off events. [2022-12-06 16:41:01,862 INFO L131 PetriNetUnfolder]: For 2776/2924 co-relation queries the response was YES. [2022-12-06 16:41:01,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9589 conditions, 4369 events. 1796/4369 cut-off events. For 2776/2924 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 35837 event pairs, 105 based on Foata normal form. 75/4259 useless extension candidates. Maximal degree in co-relation 9530. Up to 1091 conditions per place. [2022-12-06 16:41:01,880 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 58 selfloop transitions, 9 changer transitions 53/227 dead transitions. [2022-12-06 16:41:01,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 227 transitions, 1099 flow [2022-12-06 16:41:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:41:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:41:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 913 transitions. [2022-12-06 16:41:01,882 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8613207547169811 [2022-12-06 16:41:01,883 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 17 predicate places. [2022-12-06 16:41:01,884 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 227 transitions, 1099 flow [2022-12-06 16:41:01,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:01,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:01,884 INFO L213 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] [2022-12-06 16:41:01,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:41:01,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:41:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1315728558, now seen corresponding path program 1 times [2022-12-06 16:41:01,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:01,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586440659] [2022-12-06 16:41:01,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:41:02,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:02,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586440659] [2022-12-06 16:41:02,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586440659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:02,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:02,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:41:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041023466] [2022-12-06 16:41:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:02,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:41:02,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:02,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:41:02,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:41:02,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-06 16:41:02,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 227 transitions, 1099 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:02,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:02,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-06 16:41:02,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:02,622 INFO L130 PetriNetUnfolder]: 1308/3141 cut-off events. [2022-12-06 16:41:02,622 INFO L131 PetriNetUnfolder]: For 2609/3128 co-relation queries the response was YES. [2022-12-06 16:41:02,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8975 conditions, 3141 events. 1308/3141 cut-off events. For 2609/3128 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 25035 event pairs, 48 based on Foata normal form. 249/3277 useless extension candidates. Maximal degree in co-relation 8912. Up to 690 conditions per place. [2022-12-06 16:41:02,632 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 78 selfloop transitions, 28 changer transitions 128/322 dead transitions. [2022-12-06 16:41:02,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 322 transitions, 2120 flow [2022-12-06 16:41:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:41:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:41:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1189 transitions. [2022-12-06 16:41:02,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.862844702467344 [2022-12-06 16:41:02,635 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 29 predicate places. [2022-12-06 16:41:02,635 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 322 transitions, 2120 flow [2022-12-06 16:41:02,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:02,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:02,636 INFO L213 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] [2022-12-06 16:41:02,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:41:02,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:41:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash -659187860, now seen corresponding path program 1 times [2022-12-06 16:41:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:02,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471559751] [2022-12-06 16:41:02,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:41:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:02,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471559751] [2022-12-06 16:41:02,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471559751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:02,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:02,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:41:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743593755] [2022-12-06 16:41:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:41:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:41:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:41:02,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-06 16:41:02,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 322 transitions, 2120 flow. Second operand has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:02,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:02,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-06 16:41:02,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:03,331 INFO L130 PetriNetUnfolder]: 1159/2699 cut-off events. [2022-12-06 16:41:03,332 INFO L131 PetriNetUnfolder]: For 2603/2935 co-relation queries the response was YES. [2022-12-06 16:41:03,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9916 conditions, 2699 events. 1159/2699 cut-off events. For 2603/2935 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 21482 event pairs, 41 based on Foata normal form. 184/2816 useless extension candidates. Maximal degree in co-relation 9849. Up to 578 conditions per place. [2022-12-06 16:41:03,342 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 61 selfloop transitions, 28 changer transitions 167/330 dead transitions. [2022-12-06 16:41:03,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 330 transitions, 2698 flow [2022-12-06 16:41:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:41:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:41:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1434 transitions. [2022-12-06 16:41:03,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8455188679245284 [2022-12-06 16:41:03,347 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 41 predicate places. [2022-12-06 16:41:03,347 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 330 transitions, 2698 flow [2022-12-06 16:41:03,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:03,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:03,348 INFO L213 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] [2022-12-06 16:41:03,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:41:03,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:41:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash 274943290, now seen corresponding path program 1 times [2022-12-06 16:41:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:03,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858696647] [2022-12-06 16:41:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:41:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:03,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858696647] [2022-12-06 16:41:03,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858696647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:03,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:03,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:41:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096573224] [2022-12-06 16:41:03,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:03,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:41:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:03,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:41:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:41:03,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-06 16:41:03,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 330 transitions, 2698 flow. Second operand has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:03,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:03,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-06 16:41:03,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:04,086 INFO L130 PetriNetUnfolder]: 1563/3571 cut-off events. [2022-12-06 16:41:04,087 INFO L131 PetriNetUnfolder]: For 5646/6505 co-relation queries the response was YES. [2022-12-06 16:41:04,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13950 conditions, 3571 events. 1563/3571 cut-off events. For 5646/6505 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 30493 event pairs, 46 based on Foata normal form. 279/3764 useless extension candidates. Maximal degree in co-relation 13877. Up to 796 conditions per place. [2022-12-06 16:41:04,103 INFO L137 encePairwiseOnDemand]: 98/106 looper letters, 50 selfloop transitions, 7 changer transitions 229/384 dead transitions. [2022-12-06 16:41:04,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 384 transitions, 3694 flow [2022-12-06 16:41:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:41:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:41:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 611 transitions. [2022-12-06 16:41:04,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8234501347708895 [2022-12-06 16:41:04,108 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 47 predicate places. [2022-12-06 16:41:04,108 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 384 transitions, 3694 flow [2022-12-06 16:41:04,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:04,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:04,108 INFO L213 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] [2022-12-06 16:41:04,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:41:04,109 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:41:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash 136245782, now seen corresponding path program 2 times [2022-12-06 16:41:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:04,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406080811] [2022-12-06 16:41:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:04,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:41:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:04,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406080811] [2022-12-06 16:41:04,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406080811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:04,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:04,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:41:04,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767685834] [2022-12-06 16:41:04,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:04,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:41:04,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:04,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:41:04,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:41:04,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-06 16:41:04,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 384 transitions, 3694 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:04,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:04,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-06 16:41:04,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:04,830 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][167], [120#true, 205#true, 170#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 44#L761true, 66#L754true, 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 117#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 98#L810true, 48#L3true, 226#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:41:04,831 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:41:04,831 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:41:04,831 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:41:04,831 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:41:04,831 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][285], [120#true, 220#(= ~x~0 1), 205#true, 63#L749true, 192#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 84#L779true, 166#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 117#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 147#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 98#L810true, 48#L3true]) [2022-12-06 16:41:04,831 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:41:04,832 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:41:04,832 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:41:04,832 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:41:04,885 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][167], [120#true, 205#true, 170#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 44#L761true, 66#L754true, 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 117#true, 105#L3-1true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 98#L810true, 226#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:41:04,885 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,885 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,885 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,885 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,886 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][285], [120#true, 220#(= ~x~0 1), 205#true, 63#L749true, 192#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 84#L779true, 166#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 117#true, 105#L3-1true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 147#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 98#L810true]) [2022-12-06 16:41:04,886 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,886 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,886 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,886 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,886 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][287], [120#true, 205#true, 44#L761true, 88#L813true, 66#L754true, 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 117#true, 174#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 200#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 48#L3true, 226#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1))]) [2022-12-06 16:41:04,886 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,886 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,887 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,887 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,887 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][327], [120#true, 220#(= ~x~0 1), 170#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 205#true, 88#L813true, 63#L749true, 84#L779true, 117#true, 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 48#L3true, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:41:04,887 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,887 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,887 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,887 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:41:04,928 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([305] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][287], [120#true, 205#true, 44#L761true, 88#L813true, 66#L754true, 117#true, 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 105#L3-1true, 174#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 200#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 226#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1))]) [2022-12-06 16:41:04,929 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:41:04,929 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:41:04,929 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:41:04,929 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:41:04,929 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([310] L761-->L779: Formula: (let ((.cse2 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_96 256) 0)) (.cse5 (and .cse10 .cse2)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_83 256) 0) .cse10))) (let ((.cse7 (or .cse12 .cse5 .cse6)) (.cse8 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse7 v_~y~0_53 (ite .cse8 v_~y$w_buff0~0_34 v_~y$w_buff1~0_25))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_82 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_95 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_34) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse1 (= 0 (mod v_~y$r_buff0_thd2~0_41 256)))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1))) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1_used~0_82 (ite .cse0 v_~y$w_buff1_used~0_83 (ite (or .cse3 .cse5 .cse6) v_~y$w_buff1_used~0_83 0))) (= (ite .cse0 v_~y$w_buff0_used~0_96 (ite .cse7 v_~y$w_buff0_used~0_96 (ite .cse8 0 v_~y$w_buff0_used~0_96))) v_~y$w_buff0_used~0_95) (= .cse9 v_~__unbuffered_p1_EAX~0_18) (= v_~y$w_buff1~0_25 v_~y$w_buff1~0_24) (= v_~y$w_buff0~0_34 v_~y$w_buff0~0_33) (= v_~y~0_52 (ite .cse0 v_~y$mem_tmp~0_20 .cse9)) (= v_~y~0_53 v_~y$mem_tmp~0_20) (= v_~y$r_buff0_thd2~0_41 (ite .cse0 v_~y$r_buff0_thd2~0_42 (ite (or .cse3 .cse5 (and .cse4 .cse10)) v_~y$r_buff0_thd2~0_42 (ite (and .cse11 (not .cse3)) 0 v_~y$r_buff0_thd2~0_42))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_25, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][327], [120#true, 220#(= ~x~0 1), 170#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 205#true, 88#L813true, 63#L749true, 84#L779true, 117#true, 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 105#L3-1true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:41:04,929 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:41:04,929 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:41:04,929 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:41:04,930 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:41:05,043 INFO L130 PetriNetUnfolder]: 2746/5940 cut-off events. [2022-12-06 16:41:05,043 INFO L131 PetriNetUnfolder]: For 18142/21728 co-relation queries the response was YES. [2022-12-06 16:41:05,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25353 conditions, 5940 events. 2746/5940 cut-off events. For 18142/21728 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 52636 event pairs, 47 based on Foata normal form. 794/6580 useless extension candidates. Maximal degree in co-relation 25273. Up to 1374 conditions per place. [2022-12-06 16:41:05,063 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 31 selfloop transitions, 9 changer transitions 449/568 dead transitions. [2022-12-06 16:41:05,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 568 transitions, 6924 flow [2022-12-06 16:41:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 16:41:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 16:41:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 689 transitions. [2022-12-06 16:41:05,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8125 [2022-12-06 16:41:05,065 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 54 predicate places. [2022-12-06 16:41:05,065 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 568 transitions, 6924 flow [2022-12-06 16:41:05,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:05,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:05,066 INFO L213 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] [2022-12-06 16:41:05,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:41:05,066 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:41:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:05,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1679295364, now seen corresponding path program 3 times [2022-12-06 16:41:05,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:05,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076025198] [2022-12-06 16:41:05,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:05,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:41:05,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:05,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076025198] [2022-12-06 16:41:05,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076025198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:05,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:05,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 16:41:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956862928] [2022-12-06 16:41:05,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:05,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 16:41:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:05,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 16:41:05,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 16:41:05,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-06 16:41:05,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 568 transitions, 6924 flow. Second operand has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:05,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:05,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-06 16:41:05,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:06,440 INFO L130 PetriNetUnfolder]: 3129/7370 cut-off events. [2022-12-06 16:41:06,441 INFO L131 PetriNetUnfolder]: For 25282/27474 co-relation queries the response was YES. [2022-12-06 16:41:06,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30664 conditions, 7370 events. 3129/7370 cut-off events. For 25282/27474 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 71860 event pairs, 50 based on Foata normal form. 326/7571 useless extension candidates. Maximal degree in co-relation 30574. Up to 1708 conditions per place. [2022-12-06 16:41:06,458 INFO L137 encePairwiseOnDemand]: 97/106 looper letters, 20 selfloop transitions, 7 changer transitions 532/642 dead transitions. [2022-12-06 16:41:06,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 642 transitions, 8850 flow [2022-12-06 16:41:06,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:41:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:41:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 840 transitions. [2022-12-06 16:41:06,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7924528301886793 [2022-12-06 16:41:06,460 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 63 predicate places. [2022-12-06 16:41:06,460 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 642 transitions, 8850 flow [2022-12-06 16:41:06,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:41:06,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:06,461 INFO L213 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] [2022-12-06 16:41:06,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:41:06,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:41:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1757105810, now seen corresponding path program 4 times [2022-12-06 16:41:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:06,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618374265] [2022-12-06 16:41:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:41:06,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:41:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:41:06,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:41:06,527 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:41:06,527 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:41:06,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:41:06,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:41:06,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:41:06,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:41:06,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:41:06,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:41:06,530 INFO L458 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-12-06 16:41:06,534 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:41:06,534 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:41:06,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:41:06 BasicIcfg [2022-12-06 16:41:06,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:41:06,650 INFO L158 Benchmark]: Toolchain (without parser) took 8453.24ms. Allocated memory was 166.7MB in the beginning and 1.1GB in the end (delta: 936.4MB). Free memory was 132.7MB in the beginning and 879.0MB in the end (delta: -746.3MB). Peak memory consumption was 191.6MB. Max. memory is 8.0GB. [2022-12-06 16:41:06,650 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:41:06,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.85ms. Allocated memory is still 166.7MB. Free memory was 132.2MB in the beginning and 106.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 16:41:06,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.99ms. Allocated memory is still 166.7MB. Free memory was 106.5MB in the beginning and 103.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 16:41:06,650 INFO L158 Benchmark]: Boogie Preprocessor took 28.25ms. Allocated memory is still 166.7MB. Free memory was 103.8MB in the beginning and 102.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 16:41:06,651 INFO L158 Benchmark]: RCFGBuilder took 537.84ms. Allocated memory is still 166.7MB. Free memory was 102.3MB in the beginning and 72.4MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 16:41:06,651 INFO L158 Benchmark]: TraceAbstraction took 7368.24ms. Allocated memory was 166.7MB in the beginning and 1.1GB in the end (delta: 936.4MB). Free memory was 71.9MB in the beginning and 879.0MB in the end (delta: -807.2MB). Peak memory consumption was 130.8MB. Max. memory is 8.0GB. [2022-12-06 16:41:06,652 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 463.85ms. Allocated memory is still 166.7MB. Free memory was 132.2MB in the beginning and 106.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.99ms. Allocated memory is still 166.7MB. Free memory was 106.5MB in the beginning and 103.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.25ms. Allocated memory is still 166.7MB. Free memory was 103.8MB in the beginning and 102.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 537.84ms. Allocated memory is still 166.7MB. Free memory was 102.3MB in the beginning and 72.4MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 7368.24ms. Allocated memory was 166.7MB in the beginning and 1.1GB in the end (delta: 936.4MB). Free memory was 71.9MB in the beginning and 879.0MB in the end (delta: -807.2MB). Peak memory consumption was 130.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=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] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L827] 0 pthread_t t2577; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-2, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L829] 0 pthread_t t2578; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=-1, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L831] 0 pthread_t t2579; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 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) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=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=2] [L805] 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) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, 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=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, 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=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, 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=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, 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=2] [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, 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=2] [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, 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=2] [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 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) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 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 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, 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=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, 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=2] [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, 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=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, 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=2] - 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: 830]: 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: 832]: 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: 828]: 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, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 742 IncrementalHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 76 mSDtfsCounter, 742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8850occurred in iteration=8, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 674 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 2072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 16:41:06,684 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...