/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:45:25,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:45:25,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:45:25,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:45:25,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:45:25,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:45:25,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:45:25,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:45:25,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:45:25,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:45:25,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:45:25,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:45:25,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:45:25,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:45:25,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:45:25,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:45:25,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:45:25,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:45:25,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:45:25,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:45:25,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:45:25,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:45:25,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:45:25,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:45:25,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:45:25,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:45:25,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:45:25,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:45:25,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:45:25,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:45:25,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:45:25,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:45:25,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:45:25,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:45:25,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:45:25,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:45:25,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:45:25,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:45:25,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:45:25,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:45:25,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:45:25,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 11:45:25,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:45:25,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:45:25,623 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:45:25,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:45:25,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:45:25,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:45:25,625 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:45:25,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:45:25,625 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:45:25,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:45:25,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:45:25,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:45:25,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:45:25,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:45:25,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:45:25,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:45:25,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:45:25,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:45:25,627 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:45:25,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:45:25,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:45:25,627 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:45:25,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:45:25,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:45:25,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:45:25,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:45:25,884 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:45:25,885 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:45:25,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2022-12-12 11:45:26,755 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:45:26,980 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:45:26,980 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2022-12-12 11:45:26,997 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746867b0d/c7684b8551ee431bb655db3275fa1de9/FLAGe1f9998f1 [2022-12-12 11:45:27,010 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746867b0d/c7684b8551ee431bb655db3275fa1de9 [2022-12-12 11:45:27,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:45:27,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:45:27,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:45:27,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:45:27,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:45:27,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf1196d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27, skipping insertion in model container [2022-12-12 11:45:27,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:45:27,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:45:27,214 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/mix010.opt.i[944,957] [2022-12-12 11:45:27,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:45:27,418 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:45:27,426 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/mix010.opt.i[944,957] [2022-12-12 11:45:27,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:45:27,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:45:27,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:45:27,511 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:45:27,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27 WrapperNode [2022-12-12 11:45:27,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:45:27,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:45:27,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:45:27,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:45:27,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,575 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-12 11:45:27,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:45:27,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:45:27,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:45:27,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:45:27,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,601 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:45:27,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:45:27,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:45:27,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:45:27,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (1/1) ... [2022-12-12 11:45:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:45:27,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:45:27,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 11:45:27,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 11:45:27,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:45:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:45:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:45:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:45:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:45:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 11:45:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 11:45:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 11:45:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 11:45:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 11:45:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 11:45:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:45:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:45:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:45:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:45:27,695 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:45:27,858 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:45:27,859 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:45:28,105 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:45:28,216 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:45:28,217 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 11:45:28,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:45:28 BoogieIcfgContainer [2022-12-12 11:45:28,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:45:28,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:45:28,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:45:28,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:45:28,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:45:27" (1/3) ... [2022-12-12 11:45:28,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5d4bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:45:28, skipping insertion in model container [2022-12-12 11:45:28,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:45:27" (2/3) ... [2022-12-12 11:45:28,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5d4bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:45:28, skipping insertion in model container [2022-12-12 11:45:28,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:45:28" (3/3) ... [2022-12-12 11:45:28,223 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2022-12-12 11:45:28,236 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:45:28,236 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:45:28,236 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:45:28,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:45:28,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-12 11:45:28,345 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-12 11:45:28,345 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:45:28,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 11:45:28,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-12 11:45:28,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-12 11:45:28,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:45:28,364 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;@134ea64c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:45:28,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 11:45:28,386 INFO L130 PetriNetUnfolder]: 0/75 cut-off events. [2022-12-12 11:45:28,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:45:28,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:28,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:28,388 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-12 11:45:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1384860600, now seen corresponding path program 1 times [2022-12-12 11:45:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:28,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276164846] [2022-12-12 11:45:28,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:45:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:45:28,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:45:28,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276164846] [2022-12-12 11:45:28,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276164846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:45:28,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:45:28,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:45:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173008681] [2022-12-12 11:45:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:45:28,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:45:28,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:45:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:45:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:45:28,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2022-12-12 11:45:28,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:28,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:45:28,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2022-12-12 11:45:28,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:45:29,018 INFO L130 PetriNetUnfolder]: 14/181 cut-off events. [2022-12-12 11:45:29,019 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 11:45:29,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 181 events. 14/181 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 436 event pairs, 6 based on Foata normal form. 7/178 useless extension candidates. Maximal degree in co-relation 175. Up to 25 conditions per place. [2022-12-12 11:45:29,022 INFO L137 encePairwiseOnDemand]: 108/113 looper letters, 9 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2022-12-12 11:45:29,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 247 flow [2022-12-12 11:45:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:45:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:45:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2022-12-12 11:45:29,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9321533923303835 [2022-12-12 11:45:29,041 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2022-12-12 11:45:29,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 247 flow [2022-12-12 11:45:29,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 108 transitions, 240 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-12 11:45:29,047 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 240 flow [2022-12-12 11:45:29,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:29,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:29,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:29,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:45:29,048 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-12 11:45:29,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:29,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1602619752, now seen corresponding path program 1 times [2022-12-12 11:45:29,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:29,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62191475] [2022-12-12 11:45:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:45:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:45:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:45:29,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62191475] [2022-12-12 11:45:29,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62191475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:45:29,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:45:29,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:45:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133621322] [2022-12-12 11:45:29,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:45:29,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:45:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:45:29,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:45:29,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:45:29,421 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2022-12-12 11:45:29,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:29,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:45:29,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2022-12-12 11:45:29,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:45:29,834 INFO L130 PetriNetUnfolder]: 588/1553 cut-off events. [2022-12-12 11:45:29,834 INFO L131 PetriNetUnfolder]: For 303/478 co-relation queries the response was YES. [2022-12-12 11:45:29,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 1553 events. 588/1553 cut-off events. For 303/478 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10808 event pairs, 71 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 2816. Up to 460 conditions per place. [2022-12-12 11:45:29,848 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 30 selfloop transitions, 2 changer transitions 58/164 dead transitions. [2022-12-12 11:45:29,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 164 transitions, 576 flow [2022-12-12 11:45:29,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:45:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:45:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 851 transitions. [2022-12-12 11:45:29,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8367748279252704 [2022-12-12 11:45:29,852 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 5 predicate places. [2022-12-12 11:45:29,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 164 transitions, 576 flow [2022-12-12 11:45:29,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 164 transitions, 564 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-12 11:45:29,859 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 164 transitions, 564 flow [2022-12-12 11:45:29,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:29,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:29,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:29,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:45:29,860 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-12 11:45:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:29,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2134562070, now seen corresponding path program 1 times [2022-12-12 11:45:29,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:29,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963600659] [2022-12-12 11:45:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:45:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:45:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:45:30,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963600659] [2022-12-12 11:45:30,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963600659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:45:30,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:45:30,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:45:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293434995] [2022-12-12 11:45:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:45:30,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:45:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:45:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:45:30,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:45:30,071 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2022-12-12 11:45:30,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 164 transitions, 564 flow. Second operand has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:30,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:45:30,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2022-12-12 11:45:30,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:45:30,429 INFO L130 PetriNetUnfolder]: 807/2071 cut-off events. [2022-12-12 11:45:30,429 INFO L131 PetriNetUnfolder]: For 378/1093 co-relation queries the response was YES. [2022-12-12 11:45:30,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5138 conditions, 2071 events. 807/2071 cut-off events. For 378/1093 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15735 event pairs, 53 based on Foata normal form. 2/2043 useless extension candidates. Maximal degree in co-relation 5079. Up to 583 conditions per place. [2022-12-12 11:45:30,462 INFO L137 encePairwiseOnDemand]: 105/113 looper letters, 33 selfloop transitions, 5 changer transitions 147/259 dead transitions. [2022-12-12 11:45:30,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 259 transitions, 1362 flow [2022-12-12 11:45:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:45:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:45:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 928 transitions. [2022-12-12 11:45:30,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8212389380530973 [2022-12-12 11:45:30,465 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2022-12-12 11:45:30,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 259 transitions, 1362 flow [2022-12-12 11:45:30,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 259 transitions, 1294 flow, removed 33 selfloop flow, removed 1 redundant places. [2022-12-12 11:45:30,470 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 259 transitions, 1294 flow [2022-12-12 11:45:30,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:30,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:30,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:30,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:45:30,471 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-12 11:45:30,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1602662927, now seen corresponding path program 1 times [2022-12-12 11:45:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:30,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895718025] [2022-12-12 11:45:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:45:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:45:30,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:45:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895718025] [2022-12-12 11:45:30,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895718025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:45:30,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:45:30,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:45:30,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060950417] [2022-12-12 11:45:30,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:45:30,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:45:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:45:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:45:30,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:45:30,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-12-12 11:45:30,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 259 transitions, 1294 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:30,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:45:30,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-12-12 11:45:30,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:45:31,184 INFO L130 PetriNetUnfolder]: 1541/3746 cut-off events. [2022-12-12 11:45:31,184 INFO L131 PetriNetUnfolder]: For 2868/3234 co-relation queries the response was YES. [2022-12-12 11:45:31,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9534 conditions, 3746 events. 1541/3746 cut-off events. For 2868/3234 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 28938 event pairs, 96 based on Foata normal form. 1/3625 useless extension candidates. Maximal degree in co-relation 9476. Up to 1149 conditions per place. [2022-12-12 11:45:31,202 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 86 selfloop transitions, 15 changer transitions 118/343 dead transitions. [2022-12-12 11:45:31,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 343 transitions, 2132 flow [2022-12-12 11:45:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:45:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:45:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 981 transitions. [2022-12-12 11:45:31,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.868141592920354 [2022-12-12 11:45:31,206 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2022-12-12 11:45:31,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 343 transitions, 2132 flow [2022-12-12 11:45:31,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 343 transitions, 2128 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-12 11:45:31,211 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 343 transitions, 2128 flow [2022-12-12 11:45:31,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:31,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:31,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:31,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:45:31,211 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-12 11:45:31,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash -137474582, now seen corresponding path program 1 times [2022-12-12 11:45:31,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:31,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688874757] [2022-12-12 11:45:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:45:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:45:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:45:31,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688874757] [2022-12-12 11:45:31,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688874757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:45:31,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:45:31,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:45:31,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45300696] [2022-12-12 11:45:31,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:45:31,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:45:31,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:45:31,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:45:31,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:45:31,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-12-12 11:45:31,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 343 transitions, 2128 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:31,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:45:31,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-12-12 11:45:31,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:45:31,864 INFO L130 PetriNetUnfolder]: 986/2302 cut-off events. [2022-12-12 11:45:31,864 INFO L131 PetriNetUnfolder]: For 2768/3498 co-relation queries the response was YES. [2022-12-12 11:45:31,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7359 conditions, 2302 events. 986/2302 cut-off events. For 2768/3498 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15805 event pairs, 34 based on Foata normal form. 142/2375 useless extension candidates. Maximal degree in co-relation 7299. Up to 678 conditions per place. [2022-12-12 11:45:31,873 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 92 selfloop transitions, 32 changer transitions 137/353 dead transitions. [2022-12-12 11:45:31,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 353 transitions, 2604 flow [2022-12-12 11:45:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:45:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:45:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1278 transitions. [2022-12-12 11:45:31,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8699795779441797 [2022-12-12 11:45:31,878 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2022-12-12 11:45:31,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 353 transitions, 2604 flow [2022-12-12 11:45:31,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 353 transitions, 2372 flow, removed 108 selfloop flow, removed 4 redundant places. [2022-12-12 11:45:31,904 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 353 transitions, 2372 flow [2022-12-12 11:45:31,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:31,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:31,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:31,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:45:31,905 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-12 11:45:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:31,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1738551913, now seen corresponding path program 1 times [2022-12-12 11:45:31,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:31,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103220921] [2022-12-12 11:45:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:31,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:45:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:45:32,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:45:32,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103220921] [2022-12-12 11:45:32,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103220921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:45:32,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:45:32,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 11:45:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310223647] [2022-12-12 11:45:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:45:32,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 11:45:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:45:32,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 11:45:32,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 11:45:32,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-12-12 11:45:32,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 353 transitions, 2372 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:32,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:45:32,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-12-12 11:45:32,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:45:32,537 INFO L130 PetriNetUnfolder]: 919/2055 cut-off events. [2022-12-12 11:45:32,537 INFO L131 PetriNetUnfolder]: For 2598/3166 co-relation queries the response was YES. [2022-12-12 11:45:32,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7780 conditions, 2055 events. 919/2055 cut-off events. For 2598/3166 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14151 event pairs, 28 based on Foata normal form. 75/2089 useless extension candidates. Maximal degree in co-relation 7719. Up to 537 conditions per place. [2022-12-12 11:45:32,545 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 82 selfloop transitions, 38 changer transitions 143/345 dead transitions. [2022-12-12 11:45:32,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 345 transitions, 2864 flow [2022-12-12 11:45:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 11:45:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 11:45:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1539 transitions. [2022-12-12 11:45:32,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8512168141592921 [2022-12-12 11:45:32,549 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 32 predicate places. [2022-12-12 11:45:32,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 345 transitions, 2864 flow [2022-12-12 11:45:32,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 345 transitions, 2560 flow, removed 125 selfloop flow, removed 7 redundant places. [2022-12-12 11:45:32,555 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 345 transitions, 2560 flow [2022-12-12 11:45:32,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:32,556 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:32,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:32,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:45:32,556 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-12 11:45:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1248374769, now seen corresponding path program 1 times [2022-12-12 11:45:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:32,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168704648] [2022-12-12 11:45:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:32,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:45:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:45:32,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:45:32,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168704648] [2022-12-12 11:45:32,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168704648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:45:32,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:45:32,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:45:32,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496365547] [2022-12-12 11:45:32,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:45:32,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:45:32,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:45:32,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:45:32,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:45:32,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-12-12 11:45:32,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 345 transitions, 2560 flow. Second operand has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:32,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:45:32,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-12-12 11:45:32,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:45:32,927 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L810-->L826: Formula: (let ((.cse9 (= 0 (mod v_~z$r_buff1_thd3~0_58 256))) (.cse4 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_119 256) 0) .cse4)) (.cse6 (and .cse9 .cse4)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse1 (or .cse10 .cse6 .cse11)) (.cse2 (and .cse7 (not .cse11)))) (and (= |v_P2Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z~0_96 (ite .cse0 v_~z$mem_tmp~0_38 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$flush_delayed~0_56 0) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z$mem_tmp~0_38 v_~z~0_98) (= v_~__unbuffered_p2_EAX~0_10 (ite .cse1 v_~z~0_98 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_64))) (= (ite .cse0 v_~z$r_buff0_thd3~0_67 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd3~0_67 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd3~0_67))) v_~z$r_buff0_thd3~0_66) (= (ite .cse0 v_~z$r_buff1_thd3~0_58 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_66 256) 0))) (or .cse5 (and .cse3 .cse8) (and .cse9 .cse8))) v_~z$r_buff1_thd3~0_58 0)) v_~z$r_buff1_thd3~0_57) (= |v_P2Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_12) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse5 .cse10 .cse6) v_~z$w_buff1_used~0_119 0))) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse1 v_~z$w_buff0_used~0_132 (ite .cse2 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$w_buff1~0=v_~z$w_buff1~0_64, ~z~0=v_~z~0_98, P2Thread1of1ForFork1_#t~nondet6#1=|v_P2Thread1of1ForFork1_#t~nondet6#1_1|, P2Thread1of1ForFork1_#t~nondet5#1=|v_P2Thread1of1ForFork1_#t~nondet5#1_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet5#1, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, P2Thread1of1ForFork1_#t~nondet6#1][169], [51#L3true, 124#true, P2Thread1of1ForFork1InUse, 29#L773true, 73#L755true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 109#L826true, 127#true, 144#true, 219#(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)), 232#(= ~a~0 1)]) [2022-12-12 11:45:32,928 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-12 11:45:32,928 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:32,928 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:32,928 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:32,928 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][175], [146#(= ~__unbuffered_p2_EAX~0 0), 51#L3true, 124#true, P2Thread1of1ForFork1InUse, 73#L755true, 78#L789true, P0Thread1of1ForFork2InUse, 22#L810true, P1Thread1of1ForFork0InUse, 127#true, 219#(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)), 232#(= ~a~0 1)]) [2022-12-12 11:45:32,928 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-12 11:45:32,928 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:32,928 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:32,929 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:32,960 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L810-->L826: Formula: (let ((.cse9 (= 0 (mod v_~z$r_buff1_thd3~0_58 256))) (.cse4 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_119 256) 0) .cse4)) (.cse6 (and .cse9 .cse4)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse1 (or .cse10 .cse6 .cse11)) (.cse2 (and .cse7 (not .cse11)))) (and (= |v_P2Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z~0_96 (ite .cse0 v_~z$mem_tmp~0_38 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$flush_delayed~0_56 0) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z$mem_tmp~0_38 v_~z~0_98) (= v_~__unbuffered_p2_EAX~0_10 (ite .cse1 v_~z~0_98 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_64))) (= (ite .cse0 v_~z$r_buff0_thd3~0_67 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd3~0_67 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd3~0_67))) v_~z$r_buff0_thd3~0_66) (= (ite .cse0 v_~z$r_buff1_thd3~0_58 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_66 256) 0))) (or .cse5 (and .cse3 .cse8) (and .cse9 .cse8))) v_~z$r_buff1_thd3~0_58 0)) v_~z$r_buff1_thd3~0_57) (= |v_P2Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_12) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse5 .cse10 .cse6) v_~z$w_buff1_used~0_119 0))) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse1 v_~z$w_buff0_used~0_132 (ite .cse2 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$w_buff1~0=v_~z$w_buff1~0_64, ~z~0=v_~z~0_98, P2Thread1of1ForFork1_#t~nondet6#1=|v_P2Thread1of1ForFork1_#t~nondet6#1_1|, P2Thread1of1ForFork1_#t~nondet5#1=|v_P2Thread1of1ForFork1_#t~nondet5#1_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet5#1, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, P2Thread1of1ForFork1_#t~nondet6#1][169], [112#L3-1true, 124#true, P2Thread1of1ForFork1InUse, 29#L773true, 73#L755true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 109#L826true, 127#true, 144#true, 219#(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)), 232#(= ~a~0 1)]) [2022-12-12 11:45:32,960 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-12 11:45:32,960 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:32,960 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:32,960 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:32,960 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][175], [146#(= ~__unbuffered_p2_EAX~0 0), 112#L3-1true, 124#true, P2Thread1of1ForFork1InUse, 73#L755true, 78#L789true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 22#L810true, 127#true, 219#(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)), 232#(= ~a~0 1)]) [2022-12-12 11:45:32,960 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-12 11:45:32,961 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:32,961 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:32,961 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:33,174 INFO L130 PetriNetUnfolder]: 1797/3742 cut-off events. [2022-12-12 11:45:33,174 INFO L131 PetriNetUnfolder]: For 7480/8701 co-relation queries the response was YES. [2022-12-12 11:45:33,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13496 conditions, 3742 events. 1797/3742 cut-off events. For 7480/8701 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 29510 event pairs, 50 based on Foata normal form. 78/3709 useless extension candidates. Maximal degree in co-relation 13433. Up to 1057 conditions per place. [2022-12-12 11:45:33,185 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 55 selfloop transitions, 3 changer transitions 293/464 dead transitions. [2022-12-12 11:45:33,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 464 transitions, 4270 flow [2022-12-12 11:45:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 11:45:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 11:45:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 665 transitions. [2022-12-12 11:45:33,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8407079646017699 [2022-12-12 11:45:33,187 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 31 predicate places. [2022-12-12 11:45:33,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 464 transitions, 4270 flow [2022-12-12 11:45:33,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 464 transitions, 4262 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 11:45:33,193 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 464 transitions, 4262 flow [2022-12-12 11:45:33,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:33,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:33,194 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:33,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:45:33,194 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-12 11:45:33,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1899940089, now seen corresponding path program 2 times [2022-12-12 11:45:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:33,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692532066] [2022-12-12 11:45:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:33,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:45:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:45:33,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:45:33,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692532066] [2022-12-12 11:45:33,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692532066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:45:33,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:45:33,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:45:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95966905] [2022-12-12 11:45:33,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:45:33,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:45:33,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:45:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:45:33,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:45:33,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-12-12 11:45:33,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 464 transitions, 4262 flow. Second operand has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:33,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:45:33,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-12-12 11:45:33,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:45:33,671 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L810-->L826: Formula: (let ((.cse9 (= 0 (mod v_~z$r_buff1_thd3~0_58 256))) (.cse4 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_119 256) 0) .cse4)) (.cse6 (and .cse9 .cse4)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse1 (or .cse10 .cse6 .cse11)) (.cse2 (and .cse7 (not .cse11)))) (and (= |v_P2Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z~0_96 (ite .cse0 v_~z$mem_tmp~0_38 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$flush_delayed~0_56 0) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z$mem_tmp~0_38 v_~z~0_98) (= v_~__unbuffered_p2_EAX~0_10 (ite .cse1 v_~z~0_98 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_64))) (= (ite .cse0 v_~z$r_buff0_thd3~0_67 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd3~0_67 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd3~0_67))) v_~z$r_buff0_thd3~0_66) (= (ite .cse0 v_~z$r_buff1_thd3~0_58 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_66 256) 0))) (or .cse5 (and .cse3 .cse8) (and .cse9 .cse8))) v_~z$r_buff1_thd3~0_58 0)) v_~z$r_buff1_thd3~0_57) (= |v_P2Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_12) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse5 .cse10 .cse6) v_~z$w_buff1_used~0_119 0))) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse1 v_~z$w_buff0_used~0_132 (ite .cse2 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$w_buff1~0=v_~z$w_buff1~0_64, ~z~0=v_~z~0_98, P2Thread1of1ForFork1_#t~nondet6#1=|v_P2Thread1of1ForFork1_#t~nondet6#1_1|, P2Thread1of1ForFork1_#t~nondet5#1=|v_P2Thread1of1ForFork1_#t~nondet5#1_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet5#1, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, P2Thread1of1ForFork1_#t~nondet6#1][256], [247#(= ~x~0 1), 73#L755true, 109#L826true, 219#(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)), 38#L767true, 51#L3true, 124#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 129#(= ~__unbuffered_p1_EAX~0 0), 144#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:33,672 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-12 11:45:33,672 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 11:45:33,672 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 11:45:33,672 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-12 11:45:33,723 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L810-->L826: Formula: (let ((.cse9 (= 0 (mod v_~z$r_buff1_thd3~0_58 256))) (.cse4 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_119 256) 0) .cse4)) (.cse6 (and .cse9 .cse4)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse1 (or .cse10 .cse6 .cse11)) (.cse2 (and .cse7 (not .cse11)))) (and (= |v_P2Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z~0_96 (ite .cse0 v_~z$mem_tmp~0_38 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$flush_delayed~0_56 0) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z$mem_tmp~0_38 v_~z~0_98) (= v_~__unbuffered_p2_EAX~0_10 (ite .cse1 v_~z~0_98 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_64))) (= (ite .cse0 v_~z$r_buff0_thd3~0_67 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd3~0_67 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd3~0_67))) v_~z$r_buff0_thd3~0_66) (= (ite .cse0 v_~z$r_buff1_thd3~0_58 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_66 256) 0))) (or .cse5 (and .cse3 .cse8) (and .cse9 .cse8))) v_~z$r_buff1_thd3~0_58 0)) v_~z$r_buff1_thd3~0_57) (= |v_P2Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_12) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse5 .cse10 .cse6) v_~z$w_buff1_used~0_119 0))) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse1 v_~z$w_buff0_used~0_132 (ite .cse2 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$w_buff1~0=v_~z$w_buff1~0_64, ~z~0=v_~z~0_98, P2Thread1of1ForFork1_#t~nondet6#1=|v_P2Thread1of1ForFork1_#t~nondet6#1_1|, P2Thread1of1ForFork1_#t~nondet5#1=|v_P2Thread1of1ForFork1_#t~nondet5#1_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet5#1, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, P2Thread1of1ForFork1_#t~nondet6#1][256], [247#(= ~x~0 1), 73#L755true, 109#L826true, 219#(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)), 38#L767true, 112#L3-1true, 124#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 129#(= ~__unbuffered_p1_EAX~0 0), 144#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:33,724 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-12 11:45:33,724 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-12 11:45:33,724 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-12 11:45:33,724 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-12 11:45:33,778 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L810-->L826: Formula: (let ((.cse9 (= 0 (mod v_~z$r_buff1_thd3~0_58 256))) (.cse4 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_119 256) 0) .cse4)) (.cse6 (and .cse9 .cse4)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse1 (or .cse10 .cse6 .cse11)) (.cse2 (and .cse7 (not .cse11)))) (and (= |v_P2Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z~0_96 (ite .cse0 v_~z$mem_tmp~0_38 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$flush_delayed~0_56 0) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z$mem_tmp~0_38 v_~z~0_98) (= v_~__unbuffered_p2_EAX~0_10 (ite .cse1 v_~z~0_98 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_64))) (= (ite .cse0 v_~z$r_buff0_thd3~0_67 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd3~0_67 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd3~0_67))) v_~z$r_buff0_thd3~0_66) (= (ite .cse0 v_~z$r_buff1_thd3~0_58 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_66 256) 0))) (or .cse5 (and .cse3 .cse8) (and .cse9 .cse8))) v_~z$r_buff1_thd3~0_58 0)) v_~z$r_buff1_thd3~0_57) (= |v_P2Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_12) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse5 .cse10 .cse6) v_~z$w_buff1_used~0_119 0))) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse1 v_~z$w_buff0_used~0_132 (ite .cse2 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$w_buff1~0=v_~z$w_buff1~0_64, ~z~0=v_~z~0_98, P2Thread1of1ForFork1_#t~nondet6#1=|v_P2Thread1of1ForFork1_#t~nondet6#1_1|, P2Thread1of1ForFork1_#t~nondet5#1=|v_P2Thread1of1ForFork1_#t~nondet5#1_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet5#1, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, P2Thread1of1ForFork1_#t~nondet6#1][278], [247#(= ~x~0 1), 29#L773true, 73#L755true, 109#L826true, 219#(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)), 51#L3true, 124#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 127#true, 144#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:33,779 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-12 11:45:33,779 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:33,779 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:33,779 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:33,779 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][280], [247#(= ~x~0 1), 73#L755true, 219#(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)), 146#(= ~__unbuffered_p2_EAX~0 0), 51#L3true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, P0Thread1of1ForFork2InUse, 22#L810true, P1Thread1of1ForFork0InUse, 127#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:33,779 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-12 11:45:33,779 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:33,779 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:33,779 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-12 11:45:33,841 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L810-->L826: Formula: (let ((.cse9 (= 0 (mod v_~z$r_buff1_thd3~0_58 256))) (.cse4 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_119 256) 0) .cse4)) (.cse6 (and .cse9 .cse4)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse1 (or .cse10 .cse6 .cse11)) (.cse2 (and .cse7 (not .cse11)))) (and (= |v_P2Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z~0_96 (ite .cse0 v_~z$mem_tmp~0_38 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$flush_delayed~0_56 0) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z$mem_tmp~0_38 v_~z~0_98) (= v_~__unbuffered_p2_EAX~0_10 (ite .cse1 v_~z~0_98 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_64))) (= (ite .cse0 v_~z$r_buff0_thd3~0_67 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~z$r_buff0_thd3~0_67 (ite (and .cse7 (not .cse5)) 0 v_~z$r_buff0_thd3~0_67))) v_~z$r_buff0_thd3~0_66) (= (ite .cse0 v_~z$r_buff1_thd3~0_58 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_66 256) 0))) (or .cse5 (and .cse3 .cse8) (and .cse9 .cse8))) v_~z$r_buff1_thd3~0_58 0)) v_~z$r_buff1_thd3~0_57) (= |v_P2Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_12) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse5 .cse10 .cse6) v_~z$w_buff1_used~0_119 0))) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse1 v_~z$w_buff0_used~0_132 (ite .cse2 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$w_buff1~0=v_~z$w_buff1~0_64, ~z~0=v_~z~0_98, P2Thread1of1ForFork1_#t~nondet6#1=|v_P2Thread1of1ForFork1_#t~nondet6#1_1|, P2Thread1of1ForFork1_#t~nondet5#1=|v_P2Thread1of1ForFork1_#t~nondet5#1_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet5#1, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, P2Thread1of1ForFork1_#t~nondet6#1][278], [247#(= ~x~0 1), 29#L773true, 73#L755true, 109#L826true, 219#(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)), 112#L3-1true, 124#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 127#true, 144#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:33,841 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-12 11:45:33,841 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:33,841 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:33,841 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:33,841 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][280], [247#(= ~x~0 1), 73#L755true, 219#(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)), 146#(= ~__unbuffered_p2_EAX~0 0), 112#L3-1true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 22#L810true, 127#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:33,842 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-12 11:45:33,842 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:33,842 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:33,842 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:45:34,030 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][411], [247#(= ~x~0 1), 73#L755true, 62#L836true, 219#(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)), 51#L3true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 127#true, 144#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:34,031 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:45:34,031 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:45:34,031 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:45:34,031 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:45:34,076 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][411], [247#(= ~x~0 1), 73#L755true, 62#L836true, 219#(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)), 112#L3-1true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 127#true, 144#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:34,076 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:45:34,076 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:34,076 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:34,076 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:34,077 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][460], [247#(= ~x~0 1), 73#L755true, 5#L839true, 51#L3true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, P0Thread1of1ForFork2InUse, 221#(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)), P1Thread1of1ForFork0InUse, 176#(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)), 127#true, 144#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:34,077 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:45:34,077 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:34,077 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:34,077 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:34,111 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][460], [247#(= ~x~0 1), 73#L755true, 5#L839true, 112#L3-1true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, 221#(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)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 127#true, 176#(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)), 144#true, 232#(= ~a~0 1)]) [2022-12-12 11:45:34,111 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-12 11:45:34,111 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:45:34,111 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:45:34,111 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:45:34,206 INFO L130 PetriNetUnfolder]: 3197/6658 cut-off events. [2022-12-12 11:45:34,206 INFO L131 PetriNetUnfolder]: For 24362/27138 co-relation queries the response was YES. [2022-12-12 11:45:34,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26317 conditions, 6658 events. 3197/6658 cut-off events. For 24362/27138 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 58479 event pairs, 70 based on Foata normal form. 315/6844 useless extension candidates. Maximal degree in co-relation 26253. Up to 1677 conditions per place. [2022-12-12 11:45:34,230 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 26 selfloop transitions, 1 changer transitions 611/721 dead transitions. [2022-12-12 11:45:34,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 721 transitions, 8512 flow [2022-12-12 11:45:34,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 11:45:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 11:45:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 666 transitions. [2022-12-12 11:45:34,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8419721871049305 [2022-12-12 11:45:34,234 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 37 predicate places. [2022-12-12 11:45:34,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 721 transitions, 8512 flow [2022-12-12 11:45:34,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 721 transitions, 8504 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 11:45:34,248 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 721 transitions, 8504 flow [2022-12-12 11:45:34,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:34,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:34,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:34,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:45:34,249 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-12 11:45:34,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash -591473563, now seen corresponding path program 3 times [2022-12-12 11:45:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:34,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458599263] [2022-12-12 11:45:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:45:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:45:35,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:45:35,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458599263] [2022-12-12 11:45:35,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458599263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:45:35,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:45:35,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-12 11:45:35,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437023312] [2022-12-12 11:45:35,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:45:35,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 11:45:35,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:45:35,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 11:45:35,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-12 11:45:35,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2022-12-12 11:45:35,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 721 transitions, 8504 flow. Second operand has 13 states, 13 states have (on average 85.84615384615384) internal successors, (1116), 13 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:35,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:45:35,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2022-12-12 11:45:35,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:45:35,930 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][569], [247#(= ~x~0 1), 73#L755true, 62#L836true, 219#(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)), 51#L3true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 127#true, 144#true, 285#(and (or (not (= ~__unbuffered_p2_EAX~0 1)) (= ~__unbuffered_p1_EBX~0 1)) (or (= ~z~0 1) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd2~0 0)), 232#(= ~a~0 1)]) [2022-12-12 11:45:35,931 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:45:35,931 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:45:35,931 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:45:35,931 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:45:36,010 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][569], [247#(= ~x~0 1), 73#L755true, 62#L836true, 219#(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)), 112#L3-1true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 127#true, 144#true, 285#(and (or (not (= ~__unbuffered_p2_EAX~0 1)) (= ~__unbuffered_p1_EBX~0 1)) (or (= ~z~0 1) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd2~0 0)), 232#(= ~a~0 1)]) [2022-12-12 11:45:36,010 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:45:36,010 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:36,010 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:36,010 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:36,011 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][568], [247#(= ~x~0 1), 73#L755true, 5#L839true, 51#L3true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, 221#(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)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 127#true, 176#(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)), 144#true, 285#(and (or (not (= ~__unbuffered_p2_EAX~0 1)) (= ~__unbuffered_p1_EBX~0 1)) (or (= ~z~0 1) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd2~0 0)), 232#(= ~a~0 1)]) [2022-12-12 11:45:36,011 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:45:36,011 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:36,011 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:36,011 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:45:36,070 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([356] L773-->L789: Formula: (let ((.cse7 (= (mod v_~z$r_buff1_thd2~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_113 256) 0) .cse10)) (.cse3 (and .cse7 .cse10))) (let ((.cse8 (or .cse12 .cse1 .cse3)) (.cse9 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse8 v_~z~0_93 (ite .cse9 v_~z$w_buff0~0_61 v_~z$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse5 (= 0 (mod v_~z$w_buff1_used~0_112 256))) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff1_used~0_112 (ite .cse0 v_~z$w_buff1_used~0_113 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_113 0))) (= v_~weak$$choice2~0_62 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_36 .cse4)) (= v_~z$mem_tmp~0_36 v_~z~0_93) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~__unbuffered_p1_EBX~0_12 .cse4) (= v_~weak$$choice0~0_10 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$flush_delayed~0_52 0) (= (ite .cse0 v_~z$r_buff1_thd2~0_40 (ite (let ((.cse6 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or (and .cse5 .cse6) (and .cse7 .cse6) .cse2)) v_~z$r_buff1_thd2~0_40 0)) v_~z$r_buff1_thd2~0_39) (= (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse8 v_~z$w_buff0_used~0_124 (ite .cse9 0 v_~z$w_buff0_used~0_124))) v_~z$w_buff0_used~0_123) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse2 (and .cse5 .cse10) .cse3) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse2) .cse11) 0 v_~z$r_buff0_thd2~0_42))))))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_93, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_62, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][568], [247#(= ~x~0 1), 73#L755true, 5#L839true, 112#L3-1true, 124#true, P2Thread1of1ForFork1InUse, 78#L789true, P0Thread1of1ForFork2InUse, 221#(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)), P1Thread1of1ForFork0InUse, 127#true, 176#(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)), 144#true, 285#(and (or (not (= ~__unbuffered_p2_EAX~0 1)) (= ~__unbuffered_p1_EBX~0 1)) (or (= ~z~0 1) (not (= ~__unbuffered_p2_EAX~0 1))) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd2~0 0)), 232#(= ~a~0 1)]) [2022-12-12 11:45:36,071 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-12 11:45:36,071 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:45:36,071 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:45:36,071 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:45:36,218 INFO L130 PetriNetUnfolder]: 3701/8330 cut-off events. [2022-12-12 11:45:36,218 INFO L131 PetriNetUnfolder]: For 35959/38739 co-relation queries the response was YES. [2022-12-12 11:45:36,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32530 conditions, 8330 events. 3701/8330 cut-off events. For 35959/38739 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 80347 event pairs, 76 based on Foata normal form. 217/8429 useless extension candidates. Maximal degree in co-relation 32457. Up to 1671 conditions per place. [2022-12-12 11:45:36,241 INFO L137 encePairwiseOnDemand]: 99/113 looper letters, 16 selfloop transitions, 11 changer transitions 735/839 dead transitions. [2022-12-12 11:45:36,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 839 transitions, 11304 flow [2022-12-12 11:45:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 11:45:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 11:45:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions. [2022-12-12 11:45:36,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7643805309734514 [2022-12-12 11:45:36,248 INFO L295 CegarLoopForPetriNet]: 118 programPoint places, 52 predicate places. [2022-12-12 11:45:36,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 839 transitions, 11304 flow [2022-12-12 11:45:36,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 839 transitions, 10476 flow, removed 188 selfloop flow, removed 6 redundant places. [2022-12-12 11:45:36,266 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 839 transitions, 10476 flow [2022-12-12 11:45:36,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.84615384615384) internal successors, (1116), 13 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:45:36,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:45:36,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:36,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 11:45:36,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:45:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:45:36,267 INFO L85 PathProgramCache]: Analyzing trace with hash -751551765, now seen corresponding path program 4 times [2022-12-12 11:45:36,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:45:36,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276568733] [2022-12-12 11:45:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:45:36,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:45:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:45:36,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:45:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:45:36,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:45:36,343 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:45:36,343 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 11:45:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 11:45:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 11:45:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 11:45:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 11:45:36,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 11:45:36,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 11:45:36,346 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-12-12 11:45:36,350 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:45:36,350 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:45:36,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:45:36 BasicIcfg [2022-12-12 11:45:36,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:45:36,483 INFO L158 Benchmark]: Toolchain (without parser) took 9469.86ms. Allocated memory was 173.0MB in the beginning and 532.7MB in the end (delta: 359.7MB). Free memory was 147.5MB in the beginning and 494.0MB in the end (delta: -346.5MB). Peak memory consumption was 320.1MB. Max. memory is 8.0GB. [2022-12-12 11:45:36,483 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:45:36,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.60ms. Allocated memory is still 173.0MB. Free memory was 147.5MB in the beginning and 119.9MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 11:45:36,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.45ms. Allocated memory is still 173.0MB. Free memory was 119.6MB in the beginning and 117.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:45:36,484 INFO L158 Benchmark]: Boogie Preprocessor took 44.92ms. Allocated memory is still 173.0MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:45:36,484 INFO L158 Benchmark]: RCFGBuilder took 595.29ms. Allocated memory is still 173.0MB. Free memory was 115.0MB in the beginning and 121.1MB in the end (delta: -6.0MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-12-12 11:45:36,484 INFO L158 Benchmark]: TraceAbstraction took 8262.37ms. Allocated memory was 173.0MB in the beginning and 532.7MB in the end (delta: 359.7MB). Free memory was 119.5MB in the beginning and 494.0MB in the end (delta: -374.5MB). Peak memory consumption was 291.3MB. Max. memory is 8.0GB. [2022-12-12 11:45:36,485 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.12ms. Allocated memory is still 173.0MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.60ms. Allocated memory is still 173.0MB. Free memory was 147.5MB in the beginning and 119.9MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.45ms. Allocated memory is still 173.0MB. Free memory was 119.6MB in the beginning and 117.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.92ms. Allocated memory is still 173.0MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 595.29ms. Allocated memory is still 173.0MB. Free memory was 115.0MB in the beginning and 121.1MB in the end (delta: -6.0MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * TraceAbstraction took 8262.37ms. Allocated memory was 173.0MB in the beginning and 532.7MB in the end (delta: 359.7MB). Free memory was 119.5MB in the beginning and 494.0MB in the end (delta: -374.5MB). Peak memory consumption was 291.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L730] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L731] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L732] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L733] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L734] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L735] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L741] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L742] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L743] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L744] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L745] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 pthread_t t260; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260, ((void *)0), P0, ((void *)0))=-2, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t261; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261, ((void *)0), P1, ((void *)0))=-1, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t262; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262, ((void *)0), P2, ((void *)0))=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 438 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 348 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 983 IncrementalHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 90 mSDtfsCounter, 983 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10476occurred in iteration=9, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1471 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 3460 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 11:45:36,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...