/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:36:47,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:36:47,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:36:47,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:36:47,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:36:47,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:36:47,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:36:47,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:36:47,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:36:47,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:36:47,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:36:47,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:36:47,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:36:47,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:36:47,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:36:47,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:36:47,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:36:47,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:36:47,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:36:47,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:36:47,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:36:47,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:36:47,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:36:47,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:36:47,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:36:47,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:36:47,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:36:47,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:36:47,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:36:47,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:36:47,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:36:47,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:36:47,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:36:47,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:36:47,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:36:47,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:36:47,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:36:47,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:36:47,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:36:47,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:36:47,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:36:47,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 16:36:47,725 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:36:47,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:36:47,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:36:47,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:36:47,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:36:47,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:36:47,728 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:36:47,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:36:47,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:36:47,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:36:47,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:36:47,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:36:47,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:36:47,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:36:47,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:36:47,730 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:36:47,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:36:47,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:36:47,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:36:47,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:36:47,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:36:47,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:36:47,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:36:47,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:36:47,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:36:47,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:36:47,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:36:47,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:36:47,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:36:47,732 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:36:47,732 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:36:47,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:36:48,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:36:48,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:36:48,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:36:48,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:36:48,059 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:36:48,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:36:49,283 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:36:49,496 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:36:49,497 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:36:49,508 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e20f160c/a11b8192a80248a284e46095ef620626/FLAG024523eb8 [2022-12-06 16:36:49,524 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e20f160c/a11b8192a80248a284e46095ef620626 [2022-12-06 16:36:49,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:36:49,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:36:49,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:36:49,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:36:49,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:36:49,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:36:49" (1/1) ... [2022-12-06 16:36:49,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b8d486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:49, skipping insertion in model container [2022-12-06 16:36:49,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:36:49" (1/1) ... [2022-12-06 16:36:49,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:36:49,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:36:49,774 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 16:36:49,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:49,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:49,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:36:50,029 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:36:50,042 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 16:36:50,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:50,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:50,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:36:50,146 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:36:50,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50 WrapperNode [2022-12-06 16:36:50,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:36:50,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:36:50,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:36:50,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:36:50,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,206 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-06 16:36:50,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:36:50,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:36:50,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:36:50,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:36:50,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,238 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:36:50,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:36:50,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:36:50,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:36:50,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (1/1) ... [2022-12-06 16:36:50,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:36:50,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:36:50,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 16:36:50,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 16:36:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:36:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:36:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:36:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:36:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:36:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:36:50,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:36:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:36:50,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:36:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:36:50,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:36:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:36:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:36:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:36:50,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:36:50,323 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:36:50,512 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:36:50,513 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:36:50,749 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:36:50,907 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:36:50,908 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:36:50,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:36:50 BoogieIcfgContainer [2022-12-06 16:36:50,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:36:50,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:36:50,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:36:50,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:36:50,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:36:49" (1/3) ... [2022-12-06 16:36:50,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400acdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:36:50, skipping insertion in model container [2022-12-06 16:36:50,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:50" (2/3) ... [2022-12-06 16:36:50,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400acdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:36:50, skipping insertion in model container [2022-12-06 16:36:50,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:36:50" (3/3) ... [2022-12-06 16:36:50,917 INFO L112 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:36:50,934 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:36:50,934 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:36:50,934 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:36:50,994 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:36:51,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 16:36:51,079 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 16:36:51,080 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:36:51,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 16:36:51,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 16:36:51,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 16:36:51,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:36:51,116 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;@7983d3c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:36:51,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:36:51,160 INFO L130 PetriNetUnfolder]: 0/56 cut-off events. [2022-12-06 16:36:51,161 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:36:51,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:51,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:36:51,162 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:51,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1223185781, now seen corresponding path program 1 times [2022-12-06 16:36:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:51,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167922018] [2022-12-06 16:36:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:51,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:51,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167922018] [2022-12-06 16:36:51,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167922018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:51,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:51,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:36:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845273945] [2022-12-06 16:36:51,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:51,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:36:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:51,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:36:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:36:51,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 107 [2022-12-06 16:36:51,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:51,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:51,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 107 [2022-12-06 16:36:51,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:51,883 INFO L130 PetriNetUnfolder]: 37/215 cut-off events. [2022-12-06 16:36:51,883 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 16:36:51,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 215 events. 37/215 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 721 event pairs, 7 based on Foata normal form. 13/213 useless extension candidates. Maximal degree in co-relation 259. Up to 51 conditions per place. [2022-12-06 16:36:51,888 INFO L137 encePairwiseOnDemand]: 102/107 looper letters, 11 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2022-12-06 16:36:51,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 246 flow [2022-12-06 16:36:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:36:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:36:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-12-06 16:36:51,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9345794392523364 [2022-12-06 16:36:51,910 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 0 predicate places. [2022-12-06 16:36:51,910 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 104 transitions, 246 flow [2022-12-06 16:36:51,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:51,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:51,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:36:51,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:36:51,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -996834212, now seen corresponding path program 1 times [2022-12-06 16:36:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:51,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482675690] [2022-12-06 16:36:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:52,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482675690] [2022-12-06 16:36:52,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482675690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:52,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:52,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:36:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25910765] [2022-12-06 16:36:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:52,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:36:52,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:52,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:36:52,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:36:52,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-12-06 16:36:52,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:52,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:52,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-12-06 16:36:52,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:53,016 INFO L130 PetriNetUnfolder]: 1109/2888 cut-off events. [2022-12-06 16:36:53,016 INFO L131 PetriNetUnfolder]: For 689/1016 co-relation queries the response was YES. [2022-12-06 16:36:53,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5556 conditions, 2888 events. 1109/2888 cut-off events. For 689/1016 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 23566 event pairs, 191 based on Foata normal form. 0/2800 useless extension candidates. Maximal degree in co-relation 5501. Up to 737 conditions per place. [2022-12-06 16:36:53,035 INFO L137 encePairwiseOnDemand]: 98/107 looper letters, 35 selfloop transitions, 6 changer transitions 71/182 dead transitions. [2022-12-06 16:36:53,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 182 transitions, 711 flow [2022-12-06 16:36:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:36:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:36:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 823 transitions. [2022-12-06 16:36:53,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8546209761163032 [2022-12-06 16:36:53,039 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 8 predicate places. [2022-12-06 16:36:53,040 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 182 transitions, 711 flow [2022-12-06 16:36:53,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:53,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:53,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:36:53,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:36:53,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:53,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1225220893, now seen corresponding path program 1 times [2022-12-06 16:36:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270533971] [2022-12-06 16:36:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:53,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270533971] [2022-12-06 16:36:53,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270533971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:53,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:53,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:36:53,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682654451] [2022-12-06 16:36:53,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:53,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:36:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:53,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:36:53,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:36:53,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-12-06 16:36:53,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 182 transitions, 711 flow. Second operand has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:53,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:53,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-12-06 16:36:53,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:54,114 INFO L130 PetriNetUnfolder]: 1272/3404 cut-off events. [2022-12-06 16:36:54,114 INFO L131 PetriNetUnfolder]: For 1000/2031 co-relation queries the response was YES. [2022-12-06 16:36:54,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8521 conditions, 3404 events. 1272/3404 cut-off events. For 1000/2031 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 29404 event pairs, 46 based on Foata normal form. 18/3344 useless extension candidates. Maximal degree in co-relation 8460. Up to 871 conditions per place. [2022-12-06 16:36:54,131 INFO L137 encePairwiseOnDemand]: 98/107 looper letters, 45 selfloop transitions, 7 changer transitions 168/290 dead transitions. [2022-12-06 16:36:54,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 290 transitions, 1717 flow [2022-12-06 16:36:54,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:36:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:36:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1168 transitions. [2022-12-06 16:36:54,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8396836808051761 [2022-12-06 16:36:54,136 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 20 predicate places. [2022-12-06 16:36:54,136 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 290 transitions, 1717 flow [2022-12-06 16:36:54,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:54,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:54,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:36:54,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:36:54,137 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash -605088547, now seen corresponding path program 1 times [2022-12-06 16:36:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:54,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716527067] [2022-12-06 16:36:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:54,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:54,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716527067] [2022-12-06 16:36:54,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716527067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:54,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:54,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:36:54,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736418219] [2022-12-06 16:36:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:54,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:36:54,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:54,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:36:54,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:36:54,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:36:54,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 290 transitions, 1717 flow. Second operand has 7 states, 7 states have (on average 82.14285714285714) internal successors, (575), 7 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:54,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:54,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:36:54,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:55,587 INFO L130 PetriNetUnfolder]: 2436/6326 cut-off events. [2022-12-06 16:36:55,587 INFO L131 PetriNetUnfolder]: For 2687/11296 co-relation queries the response was YES. [2022-12-06 16:36:55,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18764 conditions, 6326 events. 2436/6326 cut-off events. For 2687/11296 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 60055 event pairs, 32 based on Foata normal form. 44/6268 useless extension candidates. Maximal degree in co-relation 18696. Up to 1507 conditions per place. [2022-12-06 16:36:55,630 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 72 selfloop transitions, 20 changer transitions 429/589 dead transitions. [2022-12-06 16:36:55,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 589 transitions, 4785 flow [2022-12-06 16:36:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 16:36:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 16:36:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1520 transitions. [2022-12-06 16:36:55,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8356239692138537 [2022-12-06 16:36:55,635 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 36 predicate places. [2022-12-06 16:36:55,635 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 589 transitions, 4785 flow [2022-12-06 16:36:55,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.14285714285714) internal successors, (575), 7 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:55,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:55,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:36:55,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:36:55,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1498649152, now seen corresponding path program 1 times [2022-12-06 16:36:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:55,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206776864] [2022-12-06 16:36:55,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:55,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:55,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:55,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206776864] [2022-12-06 16:36:55,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206776864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:55,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:55,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:36:55,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756413740] [2022-12-06 16:36:55,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:55,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:36:55,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:55,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:36:55,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:36:55,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:36:55,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 589 transitions, 4785 flow. Second operand has 8 states, 8 states have (on average 82.0) internal successors, (656), 8 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:55,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:55,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:36:55,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:57,336 INFO L130 PetriNetUnfolder]: 2871/7952 cut-off events. [2022-12-06 16:36:57,336 INFO L131 PetriNetUnfolder]: For 3502/13373 co-relation queries the response was YES. [2022-12-06 16:36:57,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27648 conditions, 7952 events. 2871/7952 cut-off events. For 3502/13373 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 80868 event pairs, 69 based on Foata normal form. 106/7956 useless extension candidates. Maximal degree in co-relation 27573. Up to 1897 conditions per place. [2022-12-06 16:36:57,366 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 44 selfloop transitions, 9 changer transitions 604/725 dead transitions. [2022-12-06 16:36:57,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 725 transitions, 7323 flow [2022-12-06 16:36:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 16:36:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 16:36:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1493 transitions. [2022-12-06 16:36:57,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8207806487080813 [2022-12-06 16:36:57,371 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 52 predicate places. [2022-12-06 16:36:57,371 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 725 transitions, 7323 flow [2022-12-06 16:36:57,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.0) internal successors, (656), 8 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:57,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:57,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:36:57,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:36:57,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:57,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1321608560, now seen corresponding path program 1 times [2022-12-06 16:36:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:57,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564383474] [2022-12-06 16:36:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:57,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:57,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:57,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564383474] [2022-12-06 16:36:57,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564383474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:57,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:57,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:36:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259715321] [2022-12-06 16:36:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:57,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:36:57,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:57,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:36:57,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:36:57,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2022-12-06 16:36:57,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 725 transitions, 7323 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:57,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:57,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2022-12-06 16:36:57,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:59,202 INFO L130 PetriNetUnfolder]: 3665/10712 cut-off events. [2022-12-06 16:36:59,202 INFO L131 PetriNetUnfolder]: For 6410/31146 co-relation queries the response was YES. [2022-12-06 16:36:59,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41616 conditions, 10712 events. 3665/10712 cut-off events. For 6410/31146 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 119222 event pairs, 14 based on Foata normal form. 31/10657 useless extension candidates. Maximal degree in co-relation 41537. Up to 3098 conditions per place. [2022-12-06 16:36:59,240 INFO L137 encePairwiseOnDemand]: 100/107 looper letters, 44 selfloop transitions, 5 changer transitions 869/993 dead transitions. [2022-12-06 16:36:59,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 993 transitions, 12053 flow [2022-12-06 16:36:59,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:36:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:36:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 831 transitions. [2022-12-06 16:36:59,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8629283489096573 [2022-12-06 16:36:59,243 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 60 predicate places. [2022-12-06 16:36:59,243 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 993 transitions, 12053 flow [2022-12-06 16:36:59,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:59,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:59,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:36:59,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:36:59,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1931025147, now seen corresponding path program 1 times [2022-12-06 16:36:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:59,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073264568] [2022-12-06 16:36:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:59,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073264568] [2022-12-06 16:36:59,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073264568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:59,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:59,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:36:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323506450] [2022-12-06 16:36:59,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:59,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:36:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:36:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:36:59,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-06 16:36:59,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 993 transitions, 12053 flow. Second operand has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:59,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:59,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-06 16:36:59,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:00,063 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][195], [248#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 56#L814true, 53#L3true, 91#L745true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:00,063 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,065 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,065 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,065 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,066 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][197], [248#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 53#L3true, 91#L745true, 118#true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:00,066 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,066 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,066 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,066 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,066 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][203], [248#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 14#L763true, 137#true, 53#L3true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 160#true, 223#true, 121#true]) [2022-12-06 16:37:00,066 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,067 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,067 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,067 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,068 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][290], [72#L4true, 162#(= ~y~0 0), 137#true, 91#L745true, 56#L814true, 118#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), 90#L784true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,068 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,068 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,068 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,068 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,069 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][243], [72#L4true, 162#(= ~y~0 0), 14#L763true, 137#true, 118#true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,069 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,069 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,069 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,069 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:00,291 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][251], [72#L4true, 56#L814true, 91#L745true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 250#(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)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:00,291 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,291 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,291 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,292 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,292 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][252], [72#L4true, 91#L745true, 118#true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), 250#(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)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:00,293 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,293 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,293 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,293 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,294 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][282], [72#L4true, 14#L763true, 137#true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 160#true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,294 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,294 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,294 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,295 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,340 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][286], [72#L4true, 14#L763true, 137#true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 160#true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,340 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,340 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,341 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,341 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,341 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][288], [72#L4true, 137#true, 91#L745true, 118#true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), 160#true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,341 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,341 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,341 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,341 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,342 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][316], [72#L4true, 137#true, 91#L745true, 56#L814true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 250#(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)), 160#true, 223#true, 121#true]) [2022-12-06 16:37:00,342 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,342 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,342 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,342 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,343 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][290], [162#(= ~y~0 0), 137#true, 56#L814true, 91#L745true, 118#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, 90#L784true, 78#L4-1true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,343 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,343 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,343 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,343 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,343 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][243], [162#(= ~y~0 0), 14#L763true, 137#true, 118#true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 200#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), 90#L784true, 78#L4-1true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,344 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,344 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,344 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,344 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:00,434 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][251], [56#L814true, 91#L745true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 250#(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)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:00,435 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,435 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,435 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,435 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,436 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][252], [91#L745true, 118#true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 250#(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)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:00,436 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,436 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,436 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,436 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,437 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][282], [14#L763true, 137#true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 160#true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,437 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,437 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,438 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,438 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,485 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][286], [14#L763true, 137#true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 160#true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,485 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,485 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,485 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,485 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,486 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][288], [137#true, 91#L745true, 118#true, P1Thread1of1ForFork0InUse, 25#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 250#(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)), 160#true, 223#true, 121#true]) [2022-12-06 16:37:00,486 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,486 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,486 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,486 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,486 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][316], [137#true, 56#L814true, 91#L745true, 118#true, 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 160#true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:00,486 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,486 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,487 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,487 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:01,684 INFO L130 PetriNetUnfolder]: 5600/13292 cut-off events. [2022-12-06 16:37:01,684 INFO L131 PetriNetUnfolder]: For 57939/66952 co-relation queries the response was YES. [2022-12-06 16:37:01,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53940 conditions, 13292 events. 5600/13292 cut-off events. For 57939/66952 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 131593 event pairs, 186 based on Foata normal form. 823/13768 useless extension candidates. Maximal degree in co-relation 53857. Up to 5161 conditions per place. [2022-12-06 16:37:01,744 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 142 selfloop transitions, 13 changer transitions 592/890 dead transitions. [2022-12-06 16:37:01,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 890 transitions, 11614 flow [2022-12-06 16:37:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:37:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:37:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 921 transitions. [2022-12-06 16:37:01,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8607476635514019 [2022-12-06 16:37:01,748 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 69 predicate places. [2022-12-06 16:37:01,748 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 890 transitions, 11614 flow [2022-12-06 16:37:01,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:01,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:01,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:37:01,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:37:01,749 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:37:01,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:01,750 INFO L85 PathProgramCache]: Analyzing trace with hash 196181524, now seen corresponding path program 1 times [2022-12-06 16:37:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:01,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995714376] [2022-12-06 16:37:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:37:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:37:01,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:37:01,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995714376] [2022-12-06 16:37:01,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995714376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:37:01,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:37:01,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:37:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455448583] [2022-12-06 16:37:01,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:37:01,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:37:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:37:01,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:37:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:37:01,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-06 16:37:01,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 890 transitions, 11614 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:01,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:37:01,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-06 16:37:01,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:03,491 INFO L130 PetriNetUnfolder]: 3857/8191 cut-off events. [2022-12-06 16:37:03,491 INFO L131 PetriNetUnfolder]: For 55726/68775 co-relation queries the response was YES. [2022-12-06 16:37:03,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38162 conditions, 8191 events. 3857/8191 cut-off events. For 55726/68775 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 71846 event pairs, 68 based on Foata normal form. 1210/9238 useless extension candidates. Maximal degree in co-relation 38075. Up to 3034 conditions per place. [2022-12-06 16:37:03,519 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 113 selfloop transitions, 17 changer transitions 551/780 dead transitions. [2022-12-06 16:37:03,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 780 transitions, 11189 flow [2022-12-06 16:37:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:37:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:37:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1200 transitions. [2022-12-06 16:37:03,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8626887131560029 [2022-12-06 16:37:03,523 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 72 predicate places. [2022-12-06 16:37:03,523 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 780 transitions, 11189 flow [2022-12-06 16:37:03,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:03,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:03,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:37:03,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:37:03,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:37:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1703359683, now seen corresponding path program 1 times [2022-12-06 16:37:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:03,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736042566] [2022-12-06 16:37:03,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:37:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:37:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:37:03,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736042566] [2022-12-06 16:37:03,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736042566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:37:03,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:37:03,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:37:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892425831] [2022-12-06 16:37:03,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:37:03,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:37:03,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:37:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:37:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:37:03,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-06 16:37:03,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 780 transitions, 11189 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:03,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:37:03,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-06 16:37:03,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:04,401 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][150], [248#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 53#L3true, 91#L745true, 118#true, 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 15#L794true, P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 293#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:37:04,401 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,401 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,401 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,401 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,401 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][152], [248#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 91#L745true, 53#L3true, 56#L814true, 118#true, 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 293#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:37:04,402 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,402 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,402 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,402 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,402 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][212], [248#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 14#L763true, 137#true, 53#L3true, 118#true, 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 160#true, 223#true, 121#true, 293#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:37:04,402 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,402 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,402 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,402 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:37:04,493 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][239], [72#L4true, 269#(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)), 91#L745true, 118#true, 295#(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)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), 250#(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)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:04,493 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,493 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,494 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,494 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,495 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][236], [72#L4true, 269#(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)), 91#L745true, 56#L814true, 118#true, 295#(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)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 250#(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)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:04,495 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,495 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,495 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,495 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,496 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][248], [72#L4true, 14#L763true, 137#true, 269#(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)), 118#true, 295#(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)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 160#true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:04,496 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,496 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,496 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,497 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:37:04,632 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][239], [269#(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)), 91#L745true, 118#true, 295#(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)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork2InUse, 15#L794true, 194#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 250#(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)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:04,632 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,632 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,632 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,632 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,633 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][236], [269#(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)), 91#L745true, 56#L814true, 118#true, 295#(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)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 140#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 250#(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)), 123#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 223#true, 163#(or (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 16:37:04,633 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,633 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,633 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,633 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,634 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][248], [14#L763true, 137#true, 269#(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)), 118#true, 295#(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)), 94#L787true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 25#L807true, P0Thread1of1ForFork2InUse, 194#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 160#true, 250#(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)), 223#true, 121#true]) [2022-12-06 16:37:04,634 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,634 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,634 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:04,634 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:05,042 INFO L130 PetriNetUnfolder]: 3738/7323 cut-off events. [2022-12-06 16:37:05,042 INFO L131 PetriNetUnfolder]: For 58084/76115 co-relation queries the response was YES. [2022-12-06 16:37:05,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40783 conditions, 7323 events. 3738/7323 cut-off events. For 58084/76115 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 62648 event pairs, 64 based on Foata normal form. 1239/8415 useless extension candidates. Maximal degree in co-relation 40692. Up to 2691 conditions per place. [2022-12-06 16:37:05,065 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 45 selfloop transitions, 16 changer transitions 566/704 dead transitions. [2022-12-06 16:37:05,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 704 transitions, 11205 flow [2022-12-06 16:37:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:37:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:37:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1443 transitions. [2022-12-06 16:37:05,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.842873831775701 [2022-12-06 16:37:05,071 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 66 predicate places. [2022-12-06 16:37:05,071 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 704 transitions, 11205 flow [2022-12-06 16:37:05,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:05,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:05,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:37:05,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:37:05,072 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:37:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:05,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1099401646, now seen corresponding path program 1 times [2022-12-06 16:37:05,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:05,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078728365] [2022-12-06 16:37:05,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:05,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:37:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:37:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:37:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078728365] [2022-12-06 16:37:05,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078728365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:37:05,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:37:05,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:37:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408125497] [2022-12-06 16:37:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:37:05,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:37:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:37:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:37:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:37:05,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-12-06 16:37:05,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 704 transitions, 11205 flow. Second operand has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:05,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:37:05,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-12-06 16:37:05,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:06,331 INFO L130 PetriNetUnfolder]: 4322/8934 cut-off events. [2022-12-06 16:37:06,331 INFO L131 PetriNetUnfolder]: For 78543/91958 co-relation queries the response was YES. [2022-12-06 16:37:06,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50093 conditions, 8934 events. 4322/8934 cut-off events. For 78543/91958 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 82501 event pairs, 90 based on Foata normal form. 2202/10989 useless extension candidates. Maximal degree in co-relation 49996. Up to 2919 conditions per place. [2022-12-06 16:37:06,386 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 31 selfloop transitions, 4 changer transitions 730/841 dead transitions. [2022-12-06 16:37:06,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 841 transitions, 15189 flow [2022-12-06 16:37:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:37:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:37:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2022-12-06 16:37:06,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8184245660881175 [2022-12-06 16:37:06,389 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 72 predicate places. [2022-12-06 16:37:06,389 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 841 transitions, 15189 flow [2022-12-06 16:37:06,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:06,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:06,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:37:06,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 16:37:06,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:37:06,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:06,393 INFO L85 PathProgramCache]: Analyzing trace with hash 16087848, now seen corresponding path program 2 times [2022-12-06 16:37:06,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:06,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766507760] [2022-12-06 16:37:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:37:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:37:07,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:37:07,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766507760] [2022-12-06 16:37:07,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766507760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:37:07,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:37:07,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:37:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649462624] [2022-12-06 16:37:07,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:37:07,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:37:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:37:07,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:37:07,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:37:07,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 107 [2022-12-06 16:37:07,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 841 transitions, 15189 flow. Second operand has 11 states, 11 states have (on average 76.54545454545455) internal successors, (842), 11 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:07,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:37:07,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 107 [2022-12-06 16:37:07,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:08,967 INFO L130 PetriNetUnfolder]: 5103/11066 cut-off events. [2022-12-06 16:37:08,967 INFO L131 PetriNetUnfolder]: For 106024/122336 co-relation queries the response was YES. [2022-12-06 16:37:08,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60987 conditions, 11066 events. 5103/11066 cut-off events. For 106024/122336 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 109311 event pairs, 92 based on Foata normal form. 2738/13678 useless extension candidates. Maximal degree in co-relation 60876. Up to 3073 conditions per place. [2022-12-06 16:37:08,991 INFO L137 encePairwiseOnDemand]: 93/107 looper letters, 27 selfloop transitions, 11 changer transitions 979/1084 dead transitions. [2022-12-06 16:37:08,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1084 transitions, 22025 flow [2022-12-06 16:37:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:37:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:37:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1029 transitions. [2022-12-06 16:37:08,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7397555715312725 [2022-12-06 16:37:08,995 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 84 predicate places. [2022-12-06 16:37:08,995 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 1084 transitions, 22025 flow [2022-12-06 16:37:08,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.54545454545455) internal successors, (842), 11 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:08,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:08,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:37:08,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 16:37:08,996 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:37:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1951502904, now seen corresponding path program 3 times [2022-12-06 16:37:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:08,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025703873] [2022-12-06 16:37:08,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:37:09,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:37:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:37:09,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:37:09,087 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:37:09,088 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:37:09,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:37:09,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:37:09,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:37:09,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:37:09,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:37:09,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 16:37:09,095 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:37:09,100 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:37:09,101 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:37:09,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:37:09 BasicIcfg [2022-12-06 16:37:09,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:37:09,203 INFO L158 Benchmark]: Toolchain (without parser) took 19675.72ms. Allocated memory was 179.3MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 139.0MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 480.6MB. Max. memory is 8.0GB. [2022-12-06 16:37:09,203 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:37:09,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.13ms. Allocated memory is still 179.3MB. Free memory was 139.0MB in the beginning and 112.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 16:37:09,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.82ms. Allocated memory is still 179.3MB. Free memory was 112.8MB in the beginning and 110.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:37:09,204 INFO L158 Benchmark]: Boogie Preprocessor took 34.75ms. Allocated memory is still 179.3MB. Free memory was 110.7MB in the beginning and 108.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:37:09,204 INFO L158 Benchmark]: RCFGBuilder took 666.96ms. Allocated memory is still 179.3MB. Free memory was 108.6MB in the beginning and 77.7MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 16:37:09,204 INFO L158 Benchmark]: TraceAbstraction took 18290.18ms. Allocated memory was 179.3MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 76.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 418.7MB. Max. memory is 8.0GB. [2022-12-06 16:37:09,205 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.11ms. Allocated memory is still 179.3MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 617.13ms. Allocated memory is still 179.3MB. Free memory was 139.0MB in the beginning and 112.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.82ms. Allocated memory is still 179.3MB. Free memory was 112.8MB in the beginning and 110.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.75ms. Allocated memory is still 179.3MB. Free memory was 110.7MB in the beginning and 108.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 666.96ms. Allocated memory is still 179.3MB. Free memory was 108.6MB in the beginning and 77.7MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 18290.18ms. Allocated memory was 179.3MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 76.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 418.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2073; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2073, ((void *)0), P0, ((void *)0))=-2, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2074; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2074, ((void *)0), P1, ((void *)0))=-1, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2075; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2075, ((void *)0), P2, ((void *)0))=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 923 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 923 mSDsluCounter, 681 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 544 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1401 IncrementalHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 137 mSDtfsCounter, 1401 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22025occurred in iteration=11, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 890 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 796 ConstructedInterpolants, 0 QuantifiedInterpolants, 3136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 16:37:09,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...