./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5babed9169ff1f82a919f6310b42a42108866edd5cf3c99389faf03347963192 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:07:46,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:07:46,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:07:46,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:07:46,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:07:46,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:07:46,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:07:46,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:07:46,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:07:46,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:07:46,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:07:46,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:07:46,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:07:46,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:07:46,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:07:46,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:07:46,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:07:46,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:07:46,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:07:46,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:07:46,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:07:46,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:07:46,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:07:46,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:07:46,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:07:46,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:07:46,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:07:46,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:07:46,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:07:46,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:07:46,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:07:46,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:07:46,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:07:46,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:07:46,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:07:46,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:07:46,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:07:46,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:07:46,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:07:46,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:07:46,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:07:46,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:07:46,624 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:07:46,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:07:46,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:07:46,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:07:46,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:07:46,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:07:46,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:07:46,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:07:46,628 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:07:46,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:07:46,629 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:07:46,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:07:46,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:07:46,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:07:46,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:07:46,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:07:46,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:07:46,630 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:07:46,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:07:46,630 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:07:46,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:07:46,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:07:46,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:07:46,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:07:46,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:07:46,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:07:46,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:07:46,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:07:46,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:07:46,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:07:46,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:07:46,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:07:46,633 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:07:46,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:07:46,633 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:07:46,634 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5babed9169ff1f82a919f6310b42a42108866edd5cf3c99389faf03347963192 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:07:46,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:07:46,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:07:46,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:07:46,987 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:07:46,987 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:07:46,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2023-08-30 23:07:48,232 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:07:48,538 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:07:48,540 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2023-08-30 23:07:48,560 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc8098af/4d8242e240bb436386052ed6ec7463d0/FLAGba3b2506f [2023-08-30 23:07:48,577 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc8098af/4d8242e240bb436386052ed6ec7463d0 [2023-08-30 23:07:48,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:07:48,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:07:48,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:07:48,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:07:48,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:07:48,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:07:48" (1/1) ... [2023-08-30 23:07:48,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286534de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:48, skipping insertion in model container [2023-08-30 23:07:48,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:07:48" (1/1) ... [2023-08-30 23:07:48,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:07:48,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:07:48,786 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i[949,962] [2023-08-30 23:07:49,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:07:49,036 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:07:49,048 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i[949,962] [2023-08-30 23:07:49,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:07:49,170 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:07:49,170 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:07:49,176 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:07:49,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49 WrapperNode [2023-08-30 23:07:49,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:07:49,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:07:49,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:07:49,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:07:49,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,276 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 282 [2023-08-30 23:07:49,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:07:49,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:07:49,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:07:49,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:07:49,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,333 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:07:49,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:07:49,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:07:49,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:07:49,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (1/1) ... [2023-08-30 23:07:49,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:07:49,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:07:49,374 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) [2023-08-30 23:07:49,400 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 [2023-08-30 23:07:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:07:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:07:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:07:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:07:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:07:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:07:49,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:07:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:07:49,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:07:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:07:49,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:07:49,417 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:07:49,417 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:07:49,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:07:49,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:07:49,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:07:49,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:07:49,419 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:07:49,601 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:07:49,603 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:07:50,091 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:07:50,341 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:07:50,342 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:07:50,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:07:50 BoogieIcfgContainer [2023-08-30 23:07:50,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:07:50,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:07:50,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:07:50,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:07:50,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:07:48" (1/3) ... [2023-08-30 23:07:50,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30515cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:07:50, skipping insertion in model container [2023-08-30 23:07:50,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:07:49" (2/3) ... [2023-08-30 23:07:50,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30515cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:07:50, skipping insertion in model container [2023-08-30 23:07:50,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:07:50" (3/3) ... [2023-08-30 23:07:50,353 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2023-08-30 23:07:50,360 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:07:50,369 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:07:50,370 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-30 23:07:50,370 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:07:50,438 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:07:50,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2023-08-30 23:07:50,558 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2023-08-30 23:07:50,559 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:07:50,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:07:50,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 150 transitions, 320 flow [2023-08-30 23:07:50,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 146 transitions, 304 flow [2023-08-30 23:07:50,577 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:07:50,595 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 304 flow [2023-08-30 23:07:50,599 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 304 flow [2023-08-30 23:07:50,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 304 flow [2023-08-30 23:07:50,658 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2023-08-30 23:07:50,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:07:50,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:07:50,664 INFO L119 LiptonReduction]: Number of co-enabled transitions 3210 [2023-08-30 23:07:55,892 INFO L134 LiptonReduction]: Checked pairs total: 9605 [2023-08-30 23:07:55,892 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-08-30 23:07:55,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:07:55,909 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=true, 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;@c41b466, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:07:55,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-30 23:07:55,913 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-08-30 23:07:55,913 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:07:55,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:55,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:07:55,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:07:55,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1221494971, now seen corresponding path program 1 times [2023-08-30 23:07:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:55,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609768427] [2023-08-30 23:07:55,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:55,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:56,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:56,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609768427] [2023-08-30 23:07:56,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609768427] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:56,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:56,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:07:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788698705] [2023-08-30 23:07:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:56,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:07:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:56,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:07:56,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:07:56,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 276 [2023-08-30 23:07:56,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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) [2023-08-30 23:07:56,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:56,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 276 [2023-08-30 23:07:56,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:07:58,248 INFO L130 PetriNetUnfolder]: 9255/12507 cut-off events. [2023-08-30 23:07:58,249 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-08-30 23:07:58,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25143 conditions, 12507 events. 9255/12507 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 66278 event pairs, 1807 based on Foata normal form. 432/11555 useless extension candidates. Maximal degree in co-relation 25131. Up to 10761 conditions per place. [2023-08-30 23:07:58,336 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 45 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-30 23:07:58,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 209 flow [2023-08-30 23:07:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:07:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:07:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-08-30 23:07:58,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5314009661835749 [2023-08-30 23:07:58,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-08-30 23:07:58,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-08-30 23:07:58,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:07:58,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-08-30 23:07:58,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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) [2023-08-30 23:07:58,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 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) [2023-08-30 23:07:58,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 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) [2023-08-30 23:07:58,373 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 440 transitions. [2023-08-30 23:07:58,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 209 flow [2023-08-30 23:07:58,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:07:58,379 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 76 flow [2023-08-30 23:07:58,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-30 23:07:58,384 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-08-30 23:07:58,385 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2023-08-30 23:07:58,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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) [2023-08-30 23:07:58,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:07:58,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:07:58,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:07:58,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:07:58,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:07:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1330532711, now seen corresponding path program 1 times [2023-08-30 23:07:58,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:07:58,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453379903] [2023-08-30 23:07:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:07:58,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:07:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:07:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:07:58,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:07:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453379903] [2023-08-30 23:07:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453379903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:07:58,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:07:58,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:07:58,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87960842] [2023-08-30 23:07:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:07:58,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:07:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:07:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:07:58,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:07:58,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 276 [2023-08-30 23:07:58,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2023-08-30 23:07:58,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:07:58,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 276 [2023-08-30 23:07:58,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:00,003 INFO L130 PetriNetUnfolder]: 7689/10893 cut-off events. [2023-08-30 23:08:00,003 INFO L131 PetriNetUnfolder]: For 435/435 co-relation queries the response was YES. [2023-08-30 23:08:00,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21901 conditions, 10893 events. 7689/10893 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 61268 event pairs, 1425 based on Foata normal form. 0/10169 useless extension candidates. Maximal degree in co-relation 21891. Up to 8281 conditions per place. [2023-08-30 23:08:00,060 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 38 selfloop transitions, 2 changer transitions 4/47 dead transitions. [2023-08-30 23:08:00,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 196 flow [2023-08-30 23:08:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-30 23:08:00,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2023-08-30 23:08:00,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-30 23:08:00,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-30 23:08:00,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:00,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-30 23:08:00,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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) [2023-08-30 23:08:00,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 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) [2023-08-30 23:08:00,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 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) [2023-08-30 23:08:00,068 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 3 states and 435 transitions. [2023-08-30 23:08:00,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 196 flow [2023-08-30 23:08:00,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:00,071 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-30 23:08:00,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-30 23:08:00,072 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-08-30 23:08:00,072 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-30 23:08:00,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2023-08-30 23:08:00,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:00,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:00,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:08:00,073 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:00,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:00,074 INFO L85 PathProgramCache]: Analyzing trace with hash 356018065, now seen corresponding path program 1 times [2023-08-30 23:08:00,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:00,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091489931] [2023-08-30 23:08:00,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091489931] [2023-08-30 23:08:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091489931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:00,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:00,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848519946] [2023-08-30 23:08:00,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:00,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:00,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:00,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 276 [2023-08-30 23:08:00,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 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) [2023-08-30 23:08:00,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:00,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 276 [2023-08-30 23:08:00,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:02,854 INFO L130 PetriNetUnfolder]: 12087/16547 cut-off events. [2023-08-30 23:08:02,854 INFO L131 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2023-08-30 23:08:02,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33713 conditions, 16547 events. 12087/16547 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 85790 event pairs, 2519 based on Foata normal form. 768/17311 useless extension candidates. Maximal degree in co-relation 33703. Up to 9057 conditions per place. [2023-08-30 23:08:02,931 INFO L137 encePairwiseOnDemand]: 262/276 looper letters, 44 selfloop transitions, 12 changer transitions 41/98 dead transitions. [2023-08-30 23:08:02,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 98 transitions, 404 flow [2023-08-30 23:08:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:08:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:08:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2023-08-30 23:08:02,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47929606625258797 [2023-08-30 23:08:02,936 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2023-08-30 23:08:02,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2023-08-30 23:08:02,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:02,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2023-08-30 23:08:02,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 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) [2023-08-30 23:08:02,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 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) [2023-08-30 23:08:02,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 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) [2023-08-30 23:08:02,944 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 7 states and 926 transitions. [2023-08-30 23:08:02,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 98 transitions, 404 flow [2023-08-30 23:08:02,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 98 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:02,950 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 182 flow [2023-08-30 23:08:02,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-30 23:08:02,952 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2023-08-30 23:08:02,954 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 182 flow [2023-08-30 23:08:02,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 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) [2023-08-30 23:08:02,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:02,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:02,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:08:02,956 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:02,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:02,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1346434484, now seen corresponding path program 1 times [2023-08-30 23:08:02,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:02,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145881818] [2023-08-30 23:08:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:03,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:03,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145881818] [2023-08-30 23:08:03,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145881818] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:03,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:08:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840625053] [2023-08-30 23:08:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:03,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:08:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:03,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:08:03,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:08:03,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 276 [2023-08-30 23:08:03,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 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) [2023-08-30 23:08:03,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:03,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 276 [2023-08-30 23:08:03,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:05,521 INFO L130 PetriNetUnfolder]: 12838/17623 cut-off events. [2023-08-30 23:08:05,522 INFO L131 PetriNetUnfolder]: For 17888/18010 co-relation queries the response was YES. [2023-08-30 23:08:05,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55633 conditions, 17623 events. 12838/17623 cut-off events. For 17888/18010 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 93852 event pairs, 3301 based on Foata normal form. 727/18156 useless extension candidates. Maximal degree in co-relation 55617. Up to 14715 conditions per place. [2023-08-30 23:08:05,646 INFO L137 encePairwiseOnDemand]: 266/276 looper letters, 59 selfloop transitions, 17 changer transitions 45/123 dead transitions. [2023-08-30 23:08:05,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 123 transitions, 820 flow [2023-08-30 23:08:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:08:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:08:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 957 transitions. [2023-08-30 23:08:05,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4953416149068323 [2023-08-30 23:08:05,650 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 957 transitions. [2023-08-30 23:08:05,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 957 transitions. [2023-08-30 23:08:05,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:05,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 957 transitions. [2023-08-30 23:08:05,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.71428571428572) internal successors, (957), 7 states have internal predecessors, (957), 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) [2023-08-30 23:08:05,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 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) [2023-08-30 23:08:05,658 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 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) [2023-08-30 23:08:05,658 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 182 flow. Second operand 7 states and 957 transitions. [2023-08-30 23:08:05,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 123 transitions, 820 flow [2023-08-30 23:08:05,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 123 transitions, 812 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:05,762 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 361 flow [2023-08-30 23:08:05,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=361, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2023-08-30 23:08:05,764 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2023-08-30 23:08:05,764 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 361 flow [2023-08-30 23:08:05,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 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) [2023-08-30 23:08:05,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:05,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:05,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:08:05,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:05,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:05,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1210186592, now seen corresponding path program 1 times [2023-08-30 23:08:05,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:05,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535199183] [2023-08-30 23:08:05,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535199183] [2023-08-30 23:08:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535199183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:06,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:06,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:06,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105428919] [2023-08-30 23:08:06,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:06,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:06,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:06,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:06,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 276 [2023-08-30 23:08:06,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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) [2023-08-30 23:08:06,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:06,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 276 [2023-08-30 23:08:06,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:08,516 INFO L130 PetriNetUnfolder]: 14062/19557 cut-off events. [2023-08-30 23:08:08,516 INFO L131 PetriNetUnfolder]: For 40226/40258 co-relation queries the response was YES. [2023-08-30 23:08:08,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72041 conditions, 19557 events. 14062/19557 cut-off events. For 40226/40258 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 105577 event pairs, 2501 based on Foata normal form. 642/20199 useless extension candidates. Maximal degree in co-relation 72020. Up to 13341 conditions per place. [2023-08-30 23:08:08,650 INFO L137 encePairwiseOnDemand]: 262/276 looper letters, 66 selfloop transitions, 35 changer transitions 38/141 dead transitions. [2023-08-30 23:08:08,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 141 transitions, 1107 flow [2023-08-30 23:08:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:08:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:08:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 937 transitions. [2023-08-30 23:08:08,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849896480331263 [2023-08-30 23:08:08,654 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 937 transitions. [2023-08-30 23:08:08,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 937 transitions. [2023-08-30 23:08:08,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:08,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 937 transitions. [2023-08-30 23:08:08,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.85714285714286) internal successors, (937), 7 states have internal predecessors, (937), 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) [2023-08-30 23:08:08,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 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) [2023-08-30 23:08:08,660 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 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) [2023-08-30 23:08:08,660 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 361 flow. Second operand 7 states and 937 transitions. [2023-08-30 23:08:08,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 141 transitions, 1107 flow [2023-08-30 23:08:08,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 141 transitions, 1087 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:08,749 INFO L231 Difference]: Finished difference. Result has 62 places, 71 transitions, 599 flow [2023-08-30 23:08:08,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=599, PETRI_PLACES=62, PETRI_TRANSITIONS=71} [2023-08-30 23:08:08,752 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2023-08-30 23:08:08,752 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 71 transitions, 599 flow [2023-08-30 23:08:08,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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) [2023-08-30 23:08:08,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:08,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:08,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:08:08,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:08,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1117555465, now seen corresponding path program 1 times [2023-08-30 23:08:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:08,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517941321] [2023-08-30 23:08:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:08,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:09,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:09,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517941321] [2023-08-30 23:08:09,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517941321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:09,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:09,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712491967] [2023-08-30 23:08:09,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:09,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:09,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:09,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:09,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:09,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 276 [2023-08-30 23:08:09,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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) [2023-08-30 23:08:09,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:09,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 276 [2023-08-30 23:08:09,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:11,669 INFO L130 PetriNetUnfolder]: 12827/17912 cut-off events. [2023-08-30 23:08:11,669 INFO L131 PetriNetUnfolder]: For 60865/60919 co-relation queries the response was YES. [2023-08-30 23:08:11,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77824 conditions, 17912 events. 12827/17912 cut-off events. For 60865/60919 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 96362 event pairs, 2243 based on Foata normal form. 662/18572 useless extension candidates. Maximal degree in co-relation 77798. Up to 9569 conditions per place. [2023-08-30 23:08:11,807 INFO L137 encePairwiseOnDemand]: 263/276 looper letters, 85 selfloop transitions, 21 changer transitions 38/146 dead transitions. [2023-08-30 23:08:11,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 146 transitions, 1411 flow [2023-08-30 23:08:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:08:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:08:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2023-08-30 23:08:11,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772256728778468 [2023-08-30 23:08:11,812 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2023-08-30 23:08:11,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2023-08-30 23:08:11,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:11,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2023-08-30 23:08:11,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 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) [2023-08-30 23:08:11,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 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) [2023-08-30 23:08:11,820 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 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) [2023-08-30 23:08:11,821 INFO L175 Difference]: Start difference. First operand has 62 places, 71 transitions, 599 flow. Second operand 7 states and 922 transitions. [2023-08-30 23:08:11,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 146 transitions, 1411 flow [2023-08-30 23:08:11,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 146 transitions, 1399 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-30 23:08:11,962 INFO L231 Difference]: Finished difference. Result has 68 places, 84 transitions, 851 flow [2023-08-30 23:08:11,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=851, PETRI_PLACES=68, PETRI_TRANSITIONS=84} [2023-08-30 23:08:11,965 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2023-08-30 23:08:11,965 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 84 transitions, 851 flow [2023-08-30 23:08:11,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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) [2023-08-30 23:08:11,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:11,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:11,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:08:11,967 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:11,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1308648227, now seen corresponding path program 1 times [2023-08-30 23:08:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:11,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254462936] [2023-08-30 23:08:11,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:11,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:12,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254462936] [2023-08-30 23:08:12,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254462936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:12,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:12,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:08:12,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496352695] [2023-08-30 23:08:12,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:12,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:08:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:12,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:08:12,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:08:12,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 276 [2023-08-30 23:08:12,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 84 transitions, 851 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2023-08-30 23:08:12,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:12,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 276 [2023-08-30 23:08:12,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:13,747 INFO L130 PetriNetUnfolder]: 6849/9848 cut-off events. [2023-08-30 23:08:13,748 INFO L131 PetriNetUnfolder]: For 49682/50805 co-relation queries the response was YES. [2023-08-30 23:08:13,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46615 conditions, 9848 events. 6849/9848 cut-off events. For 49682/50805 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 52996 event pairs, 1354 based on Foata normal form. 657/10274 useless extension candidates. Maximal degree in co-relation 46584. Up to 8042 conditions per place. [2023-08-30 23:08:13,830 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 120 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2023-08-30 23:08:13,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 140 transitions, 1643 flow [2023-08-30 23:08:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-30 23:08:13,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132850241545893 [2023-08-30 23:08:13,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-30 23:08:13,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-30 23:08:13,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:13,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-30 23:08:13,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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) [2023-08-30 23:08:13,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 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) [2023-08-30 23:08:13,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 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) [2023-08-30 23:08:13,836 INFO L175 Difference]: Start difference. First operand has 68 places, 84 transitions, 851 flow. Second operand 3 states and 425 transitions. [2023-08-30 23:08:13,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 140 transitions, 1643 flow [2023-08-30 23:08:13,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 140 transitions, 1608 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:13,903 INFO L231 Difference]: Finished difference. Result has 66 places, 88 transitions, 860 flow [2023-08-30 23:08:13,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=66, PETRI_TRANSITIONS=88} [2023-08-30 23:08:13,903 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2023-08-30 23:08:13,904 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 88 transitions, 860 flow [2023-08-30 23:08:13,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2023-08-30 23:08:13,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:13,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:13,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:08:13,905 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:13,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:13,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1394682624, now seen corresponding path program 1 times [2023-08-30 23:08:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:13,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310436230] [2023-08-30 23:08:13,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310436230] [2023-08-30 23:08:14,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310436230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:14,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:14,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:08:14,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116538037] [2023-08-30 23:08:14,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:14,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:14,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:14,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:14,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 276 [2023-08-30 23:08:14,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 88 transitions, 860 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 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) [2023-08-30 23:08:14,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:14,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 276 [2023-08-30 23:08:14,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:16,025 INFO L130 PetriNetUnfolder]: 9463/13868 cut-off events. [2023-08-30 23:08:16,025 INFO L131 PetriNetUnfolder]: For 51044/51064 co-relation queries the response was YES. [2023-08-30 23:08:16,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67388 conditions, 13868 events. 9463/13868 cut-off events. For 51044/51064 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 77319 event pairs, 2949 based on Foata normal form. 236/14104 useless extension candidates. Maximal degree in co-relation 67356. Up to 6760 conditions per place. [2023-08-30 23:08:16,139 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 92 selfloop transitions, 18 changer transitions 40/152 dead transitions. [2023-08-30 23:08:16,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 152 transitions, 1584 flow [2023-08-30 23:08:16,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:08:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:08:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2023-08-30 23:08:16,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4776570048309179 [2023-08-30 23:08:16,143 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2023-08-30 23:08:16,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2023-08-30 23:08:16,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:16,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2023-08-30 23:08:16,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 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) [2023-08-30 23:08:16,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 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) [2023-08-30 23:08:16,148 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 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) [2023-08-30 23:08:16,148 INFO L175 Difference]: Start difference. First operand has 66 places, 88 transitions, 860 flow. Second operand 6 states and 791 transitions. [2023-08-30 23:08:16,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 152 transitions, 1584 flow [2023-08-30 23:08:16,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 152 transitions, 1567 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 23:08:16,192 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 796 flow [2023-08-30 23:08:16,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=796, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2023-08-30 23:08:16,193 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2023-08-30 23:08:16,193 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 796 flow [2023-08-30 23:08:16,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 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) [2023-08-30 23:08:16,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:16,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:16,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:08:16,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:16,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash -242085473, now seen corresponding path program 1 times [2023-08-30 23:08:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:16,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28240486] [2023-08-30 23:08:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:16,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:16,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28240486] [2023-08-30 23:08:16,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28240486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:16,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:16,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239471851] [2023-08-30 23:08:16,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:16,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:16,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:16,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:16,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:16,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 276 [2023-08-30 23:08:16,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 796 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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) [2023-08-30 23:08:16,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:16,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 276 [2023-08-30 23:08:16,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:16,972 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][63], [Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 47#L832true, Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 206#(= ~x~0 0), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 204#true, P2Thread1of1ForFork2InUse, 188#true, P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 255#(<= ~__unbuffered_cnt~0 1), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 244#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 246#(and (= ~x~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-30 23:08:16,973 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:08:16,973 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:08:16,973 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:08:16,973 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:08:17,035 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][63], [Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 88#L848true, Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 206#(= ~x~0 0), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 204#true, P2Thread1of1ForFork2InUse, 188#true, P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), 255#(<= ~__unbuffered_cnt~0 1), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 244#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 246#(and (= ~x~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-30 23:08:17,035 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:08:17,035 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:08:17,035 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:08:17,035 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:08:17,093 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][63], [20#L855true, Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 206#(= ~x~0 0), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 204#true, P2Thread1of1ForFork2InUse, 188#true, P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 255#(<= ~__unbuffered_cnt~0 1), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 244#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 246#(and (= ~x~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-30 23:08:17,093 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:08:17,094 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:08:17,094 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:08:17,094 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:08:17,193 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][116], [Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 49#P2EXITtrue, 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 206#(= ~x~0 0), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 204#true, P2Thread1of1ForFork2InUse, 188#true, P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 252#true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 244#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 246#(and (= ~x~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-30 23:08:17,194 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 23:08:17,194 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 23:08:17,194 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 23:08:17,194 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 23:08:17,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][116], [Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 84#L935true, Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 49#P2EXITtrue, 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 206#(= ~x~0 0), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 204#true, P2Thread1of1ForFork2InUse, 188#true, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 252#true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 244#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 246#(and (= ~x~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-30 23:08:17,240 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 23:08:17,240 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 23:08:17,240 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 23:08:17,240 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 23:08:17,378 INFO L130 PetriNetUnfolder]: 4474/6872 cut-off events. [2023-08-30 23:08:17,378 INFO L131 PetriNetUnfolder]: For 30262/30894 co-relation queries the response was YES. [2023-08-30 23:08:17,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33751 conditions, 6872 events. 4474/6872 cut-off events. For 30262/30894 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 39188 event pairs, 686 based on Foata normal form. 676/7438 useless extension candidates. Maximal degree in co-relation 33716. Up to 3331 conditions per place. [2023-08-30 23:08:17,408 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 122 selfloop transitions, 9 changer transitions 8/154 dead transitions. [2023-08-30 23:08:17,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 154 transitions, 1802 flow [2023-08-30 23:08:17,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:08:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:08:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-08-30 23:08:17,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153985507246377 [2023-08-30 23:08:17,410 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-08-30 23:08:17,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-08-30 23:08:17,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:17,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-08-30 23:08:17,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 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) [2023-08-30 23:08:17,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 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) [2023-08-30 23:08:17,414 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 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) [2023-08-30 23:08:17,414 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 796 flow. Second operand 4 states and 569 transitions. [2023-08-30 23:08:17,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 154 transitions, 1802 flow [2023-08-30 23:08:17,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 154 transitions, 1780 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:17,432 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 806 flow [2023-08-30 23:08:17,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=806, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2023-08-30 23:08:17,433 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2023-08-30 23:08:17,433 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 806 flow [2023-08-30 23:08:17,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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) [2023-08-30 23:08:17,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:17,434 INFO L208 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] [2023-08-30 23:08:17,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:08:17,434 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:17,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1858921483, now seen corresponding path program 1 times [2023-08-30 23:08:17,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:17,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947264552] [2023-08-30 23:08:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:17,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947264552] [2023-08-30 23:08:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947264552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:17,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:17,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:08:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023927] [2023-08-30 23:08:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:17,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:17,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:17,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:17,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 276 [2023-08-30 23:08:17,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 806 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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) [2023-08-30 23:08:17,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:17,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 276 [2023-08-30 23:08:17,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:18,338 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][63], [Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 47#L832true, Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 206#(= ~x~0 0), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 204#true, 188#true, P2Thread1of1ForFork2InUse, 261#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 255#(<= ~__unbuffered_cnt~0 1), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-30 23:08:18,339 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:08:18,339 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:08:18,339 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:08:18,339 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:08:18,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][63], [Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 88#L848true, Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 206#(= ~x~0 0), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 204#true, 188#true, P2Thread1of1ForFork2InUse, 261#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), 255#(<= ~__unbuffered_cnt~0 1), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-30 23:08:18,410 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:08:18,411 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:08:18,411 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:08:18,411 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:08:18,468 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][63], [20#L855true, Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 206#(= ~x~0 0), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 204#true, 188#true, P2Thread1of1ForFork2InUse, 261#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 255#(<= ~__unbuffered_cnt~0 1), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-30 23:08:18,469 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:08:18,469 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:08:18,469 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:08:18,469 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:08:18,520 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][115], [Black: 255#(<= ~__unbuffered_cnt~0 1), 262#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 49#P2EXITtrue, 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 206#(= ~x~0 0), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 204#true, 188#true, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 252#true, 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-30 23:08:18,521 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 23:08:18,521 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 23:08:18,521 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 23:08:18,521 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 23:08:18,608 INFO L130 PetriNetUnfolder]: 3326/5119 cut-off events. [2023-08-30 23:08:18,608 INFO L131 PetriNetUnfolder]: For 24700/25225 co-relation queries the response was YES. [2023-08-30 23:08:18,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27038 conditions, 5119 events. 3326/5119 cut-off events. For 24700/25225 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 28623 event pairs, 505 based on Foata normal form. 463/5497 useless extension candidates. Maximal degree in co-relation 27002. Up to 2427 conditions per place. [2023-08-30 23:08:18,636 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 132 selfloop transitions, 13 changer transitions 17/177 dead transitions. [2023-08-30 23:08:18,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 177 transitions, 2069 flow [2023-08-30 23:08:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:08:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:08:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2023-08-30 23:08:18,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152173913043478 [2023-08-30 23:08:18,639 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 711 transitions. [2023-08-30 23:08:18,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions. [2023-08-30 23:08:18,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:18,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions. [2023-08-30 23:08:18,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 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) [2023-08-30 23:08:18,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 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) [2023-08-30 23:08:18,644 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 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) [2023-08-30 23:08:18,644 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 806 flow. Second operand 5 states and 711 transitions. [2023-08-30 23:08:18,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 177 transitions, 2069 flow [2023-08-30 23:08:18,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 177 transitions, 2039 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 23:08:18,678 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 807 flow [2023-08-30 23:08:18,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=807, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2023-08-30 23:08:18,679 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2023-08-30 23:08:18,679 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 807 flow [2023-08-30 23:08:18,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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) [2023-08-30 23:08:18,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:18,680 INFO L208 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] [2023-08-30 23:08:18,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:08:18,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:18,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash 977347383, now seen corresponding path program 1 times [2023-08-30 23:08:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980634780] [2023-08-30 23:08:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980634780] [2023-08-30 23:08:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980634780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:19,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:19,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:08:19,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875542118] [2023-08-30 23:08:19,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:19,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:08:19,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:19,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:08:19,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:08:19,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 276 [2023-08-30 23:08:19,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 807 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 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) [2023-08-30 23:08:19,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:19,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 276 [2023-08-30 23:08:19,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:19,645 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][63], [Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 262#(<= ~__unbuffered_cnt~0 2), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 47#L832true, Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 188#true, P2Thread1of1ForFork2InUse, 204#true, 261#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), 268#(<= ~__unbuffered_cnt~0 1), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 255#(<= ~__unbuffered_cnt~0 1), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 174#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-30 23:08:19,645 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:08:19,645 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:08:19,646 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:08:19,646 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:08:19,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][63], [Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 88#L848true, Black: 262#(<= ~__unbuffered_cnt~0 2), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 188#true, P2Thread1of1ForFork2InUse, 204#true, 261#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), 268#(<= ~__unbuffered_cnt~0 1), 255#(<= ~__unbuffered_cnt~0 1), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 174#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-30 23:08:19,696 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:08:19,696 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:08:19,696 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:08:19,696 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:08:19,736 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][63], [20#L855true, Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 262#(<= ~__unbuffered_cnt~0 2), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 188#true, P2Thread1of1ForFork2InUse, 204#true, 261#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), 268#(<= ~__unbuffered_cnt~0 1), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 255#(<= ~__unbuffered_cnt~0 1), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 174#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-30 23:08:19,736 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:08:19,736 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:08:19,736 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:08:19,736 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:08:19,766 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L796: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_84) v_~y$w_buff0_used~0_83) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_16) v_~y$r_buff1_thd2~0_15) (= v_~y$r_buff0_thd2~0_21 (ite .cse3 0 v_~y$r_buff0_thd2~0_22)) (= v_~y$w_buff1_used~0_66 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_63 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse4 v_~y$w_buff1~0_25 v_~y~0_64)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][115], [Black: 255#(<= ~__unbuffered_cnt~0 1), 262#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 190#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 192#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 197#(and (= ~y$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 49#P2EXITtrue, 39#L796true, Black: 207#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 242#(= ~x~0 1), P1Thread1of1ForFork1InUse, 126#P0EXITtrue, 188#true, P2Thread1of1ForFork2InUse, 204#true, P0Thread1of1ForFork3InUse, 9#L930-3true, P3Thread1of1ForFork0InUse, 172#true, Black: 221#(= ~__unbuffered_p2_EAX~0 0), 269#(<= ~__unbuffered_cnt~0 2), Black: 222#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), 97#L894true, 219#true, Black: 237#(= ~__unbuffered_cnt~0 0), Black: 175#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 180#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 243#(and (or (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), Black: 174#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-30 23:08:19,766 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 23:08:19,766 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 23:08:19,766 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 23:08:19,767 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 23:08:19,835 INFO L130 PetriNetUnfolder]: 3182/4870 cut-off events. [2023-08-30 23:08:19,835 INFO L131 PetriNetUnfolder]: For 24411/24923 co-relation queries the response was YES. [2023-08-30 23:08:19,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25822 conditions, 4870 events. 3182/4870 cut-off events. For 24411/24923 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 27324 event pairs, 493 based on Foata normal form. 273/5061 useless extension candidates. Maximal degree in co-relation 25786. Up to 2285 conditions per place. [2023-08-30 23:08:19,860 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 122 selfloop transitions, 17 changer transitions 21/171 dead transitions. [2023-08-30 23:08:19,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 171 transitions, 1987 flow [2023-08-30 23:08:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:08:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:08:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2023-08-30 23:08:19,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054347826086957 [2023-08-30 23:08:19,862 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2023-08-30 23:08:19,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2023-08-30 23:08:19,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:19,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2023-08-30 23:08:19,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 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) [2023-08-30 23:08:19,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 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) [2023-08-30 23:08:19,867 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 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) [2023-08-30 23:08:19,868 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 807 flow. Second operand 6 states and 837 transitions. [2023-08-30 23:08:19,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 171 transitions, 1987 flow [2023-08-30 23:08:19,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 171 transitions, 1870 flow, removed 36 selfloop flow, removed 6 redundant places. [2023-08-30 23:08:19,972 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 685 flow [2023-08-30 23:08:19,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=685, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2023-08-30 23:08:19,973 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2023-08-30 23:08:19,973 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 685 flow [2023-08-30 23:08:19,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 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) [2023-08-30 23:08:19,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:19,974 INFO L208 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] [2023-08-30 23:08:19,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:08:19,974 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:19,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 69293782, now seen corresponding path program 1 times [2023-08-30 23:08:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:19,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198685119] [2023-08-30 23:08:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:19,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:21,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198685119] [2023-08-30 23:08:21,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198685119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:21,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:21,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:08:21,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248420042] [2023-08-30 23:08:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:21,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:08:21,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:21,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:08:21,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:08:21,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 276 [2023-08-30 23:08:21,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 685 flow. Second operand has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 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) [2023-08-30 23:08:21,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:21,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 276 [2023-08-30 23:08:21,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:22,109 INFO L130 PetriNetUnfolder]: 1734/2708 cut-off events. [2023-08-30 23:08:22,109 INFO L131 PetriNetUnfolder]: For 12515/12518 co-relation queries the response was YES. [2023-08-30 23:08:22,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14757 conditions, 2708 events. 1734/2708 cut-off events. For 12515/12518 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12758 event pairs, 94 based on Foata normal form. 4/2712 useless extension candidates. Maximal degree in co-relation 14723. Up to 1293 conditions per place. [2023-08-30 23:08:22,121 INFO L137 encePairwiseOnDemand]: 262/276 looper letters, 69 selfloop transitions, 18 changer transitions 126/215 dead transitions. [2023-08-30 23:08:22,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 215 transitions, 2279 flow [2023-08-30 23:08:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 23:08:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 23:08:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1471 transitions. [2023-08-30 23:08:22,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44414251207729466 [2023-08-30 23:08:22,125 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1471 transitions. [2023-08-30 23:08:22,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1471 transitions. [2023-08-30 23:08:22,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:22,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1471 transitions. [2023-08-30 23:08:22,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 122.58333333333333) internal successors, (1471), 12 states have internal predecessors, (1471), 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) [2023-08-30 23:08:22,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 276.0) internal successors, (3588), 13 states have internal predecessors, (3588), 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) [2023-08-30 23:08:22,133 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 276.0) internal successors, (3588), 13 states have internal predecessors, (3588), 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) [2023-08-30 23:08:22,133 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 685 flow. Second operand 12 states and 1471 transitions. [2023-08-30 23:08:22,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 215 transitions, 2279 flow [2023-08-30 23:08:22,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 215 transitions, 1948 flow, removed 101 selfloop flow, removed 8 redundant places. [2023-08-30 23:08:22,179 INFO L231 Difference]: Finished difference. Result has 84 places, 62 transitions, 511 flow [2023-08-30 23:08:22,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=511, PETRI_PLACES=84, PETRI_TRANSITIONS=62} [2023-08-30 23:08:22,180 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 38 predicate places. [2023-08-30 23:08:22,180 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 62 transitions, 511 flow [2023-08-30 23:08:22,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 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) [2023-08-30 23:08:22,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:22,181 INFO L208 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] [2023-08-30 23:08:22,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:08:22,181 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:22,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1954448890, now seen corresponding path program 2 times [2023-08-30 23:08:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:22,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551870852] [2023-08-30 23:08:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:23,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:23,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551870852] [2023-08-30 23:08:23,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551870852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:23,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:23,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:08:23,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300039446] [2023-08-30 23:08:23,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:23,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:08:23,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:23,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:08:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:08:23,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-08-30 23:08:23,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 62 transitions, 511 flow. Second operand has 8 states, 8 states have (on average 128.375) internal successors, (1027), 8 states have internal predecessors, (1027), 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) [2023-08-30 23:08:23,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:23,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-08-30 23:08:23,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:24,159 INFO L130 PetriNetUnfolder]: 999/1663 cut-off events. [2023-08-30 23:08:24,159 INFO L131 PetriNetUnfolder]: For 6784/6792 co-relation queries the response was YES. [2023-08-30 23:08:24,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7998 conditions, 1663 events. 999/1663 cut-off events. For 6784/6792 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8071 event pairs, 165 based on Foata normal form. 7/1670 useless extension candidates. Maximal degree in co-relation 7967. Up to 769 conditions per place. [2023-08-30 23:08:24,171 INFO L137 encePairwiseOnDemand]: 266/276 looper letters, 113 selfloop transitions, 24 changer transitions 7/147 dead transitions. [2023-08-30 23:08:24,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 147 transitions, 1392 flow [2023-08-30 23:08:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:08:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:08:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1209 transitions. [2023-08-30 23:08:24,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4867149758454106 [2023-08-30 23:08:24,174 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1209 transitions. [2023-08-30 23:08:24,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1209 transitions. [2023-08-30 23:08:24,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:24,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1209 transitions. [2023-08-30 23:08:24,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 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) [2023-08-30 23:08:24,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 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) [2023-08-30 23:08:24,181 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 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) [2023-08-30 23:08:24,181 INFO L175 Difference]: Start difference. First operand has 84 places, 62 transitions, 511 flow. Second operand 9 states and 1209 transitions. [2023-08-30 23:08:24,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 147 transitions, 1392 flow [2023-08-30 23:08:24,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 147 transitions, 1225 flow, removed 21 selfloop flow, removed 11 redundant places. [2023-08-30 23:08:24,204 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 612 flow [2023-08-30 23:08:24,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=612, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2023-08-30 23:08:24,205 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2023-08-30 23:08:24,205 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 612 flow [2023-08-30 23:08:24,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.375) internal successors, (1027), 8 states have internal predecessors, (1027), 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) [2023-08-30 23:08:24,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:24,206 INFO L208 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] [2023-08-30 23:08:24,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:08:24,206 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:24,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1715804778, now seen corresponding path program 3 times [2023-08-30 23:08:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:24,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760546113] [2023-08-30 23:08:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:25,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:25,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760546113] [2023-08-30 23:08:25,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760546113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:25,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:25,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:08:25,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289168937] [2023-08-30 23:08:25,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:25,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:08:25,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:25,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:08:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:08:25,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 276 [2023-08-30 23:08:25,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 612 flow. Second operand has 9 states, 9 states have (on average 119.22222222222223) internal successors, (1073), 9 states have internal predecessors, (1073), 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) [2023-08-30 23:08:25,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:25,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 276 [2023-08-30 23:08:25,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:26,152 INFO L130 PetriNetUnfolder]: 1141/1905 cut-off events. [2023-08-30 23:08:26,152 INFO L131 PetriNetUnfolder]: For 6559/6559 co-relation queries the response was YES. [2023-08-30 23:08:26,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9474 conditions, 1905 events. 1141/1905 cut-off events. For 6559/6559 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9618 event pairs, 171 based on Foata normal form. 2/1907 useless extension candidates. Maximal degree in co-relation 9441. Up to 1060 conditions per place. [2023-08-30 23:08:26,162 INFO L137 encePairwiseOnDemand]: 266/276 looper letters, 79 selfloop transitions, 25 changer transitions 17/121 dead transitions. [2023-08-30 23:08:26,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 1178 flow [2023-08-30 23:08:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:08:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:08:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2023-08-30 23:08:26,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45410628019323673 [2023-08-30 23:08:26,164 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2023-08-30 23:08:26,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2023-08-30 23:08:26,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:26,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2023-08-30 23:08:26,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 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) [2023-08-30 23:08:26,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 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) [2023-08-30 23:08:26,169 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 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) [2023-08-30 23:08:26,169 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 612 flow. Second operand 6 states and 752 transitions. [2023-08-30 23:08:26,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 1178 flow [2023-08-30 23:08:26,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 121 transitions, 1145 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-30 23:08:26,198 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 754 flow [2023-08-30 23:08:26,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2023-08-30 23:08:26,199 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 37 predicate places. [2023-08-30 23:08:26,199 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 754 flow [2023-08-30 23:08:26,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.22222222222223) internal successors, (1073), 9 states have internal predecessors, (1073), 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) [2023-08-30 23:08:26,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:26,200 INFO L208 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] [2023-08-30 23:08:26,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:08:26,200 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-30 23:08:26,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1989300482, now seen corresponding path program 4 times [2023-08-30 23:08:26,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:26,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290817729] [2023-08-30 23:08:26,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:26,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:08:26,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:08:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:08:26,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:08:26,486 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:08:26,487 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-08-30 23:08:26,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-08-30 23:08:26,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-08-30 23:08:26,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-08-30 23:08:26,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-08-30 23:08:26,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-08-30 23:08:26,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-30 23:08:26,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-08-30 23:08:26,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-08-30 23:08:26,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 23:08:26,496 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:26,503 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:08:26,503 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:08:26,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:08:26 BasicIcfg [2023-08-30 23:08:26,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:08:26,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:08:26,632 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:08:26,633 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:08:26,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:07:50" (3/4) ... [2023-08-30 23:08:26,638 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:08:26,731 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:08:26,731 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:08:26,732 INFO L158 Benchmark]: Toolchain (without parser) took 38150.12ms. Allocated memory was 69.2MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 41.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 582.4MB. Max. memory is 16.1GB. [2023-08-30 23:08:26,732 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 69.2MB. Free memory is still 47.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:08:26,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.01ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 41.6MB in the beginning and 56.7MB in the end (delta: -15.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2023-08-30 23:08:26,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.85ms. Allocated memory is still 92.3MB. Free memory was 56.7MB in the beginning and 52.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 23:08:26,733 INFO L158 Benchmark]: Boogie Preprocessor took 61.83ms. Allocated memory is still 92.3MB. Free memory was 52.5MB in the beginning and 49.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:08:26,733 INFO L158 Benchmark]: RCFGBuilder took 1004.42ms. Allocated memory is still 92.3MB. Free memory was 49.7MB in the beginning and 66.3MB in the end (delta: -16.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-08-30 23:08:26,734 INFO L158 Benchmark]: TraceAbstraction took 36285.27ms. Allocated memory was 92.3MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 65.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 559.9MB. Max. memory is 16.1GB. [2023-08-30 23:08:26,734 INFO L158 Benchmark]: Witness Printer took 99.05ms. Allocated memory is still 3.1GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 23:08:26,735 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.19ms. Allocated memory is still 69.2MB. Free memory is still 47.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.01ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 41.6MB in the beginning and 56.7MB in the end (delta: -15.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.85ms. Allocated memory is still 92.3MB. Free memory was 56.7MB in the beginning and 52.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.83ms. Allocated memory is still 92.3MB. Free memory was 52.5MB in the beginning and 49.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1004.42ms. Allocated memory is still 92.3MB. Free memory was 49.7MB in the beginning and 66.3MB in the end (delta: -16.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 36285.27ms. Allocated memory was 92.3MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 65.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 559.9MB. Max. memory is 16.1GB. * Witness Printer took 99.05ms. Allocated memory is still 3.1GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 157 PlacesBefore, 46 PlacesAfterwards, 146 TransitionsBefore, 34 TransitionsAfterwards, 3210 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 9605 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3780, independent: 3527, independent conditional: 0, independent unconditional: 3527, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1706, independent: 1661, independent conditional: 0, independent unconditional: 1661, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3780, independent: 1866, independent conditional: 0, independent unconditional: 1866, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 1706, unknown conditional: 0, unknown unconditional: 1706] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L923] 0 pthread_t t233; [L924] FCALL, FORK 0 pthread_create(&t233, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t233, ((void *)0), P0, ((void *)0))=-3, t233={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L925] 0 pthread_t t234; [L926] FCALL, FORK 0 pthread_create(&t234, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t234, ((void *)0), P1, ((void *)0))=-2, t233={5:0}, t234={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L927] 0 pthread_t t235; [L928] FCALL, FORK 0 pthread_create(&t235, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t235, ((void *)0), P2, ((void *)0))=-1, t233={5:0}, t234={6:0}, t235={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L929] 0 pthread_t t236; [L805] 3 y$w_buff1 = y$w_buff0 [L806] 3 y$w_buff0 = 2 [L807] 3 y$w_buff1_used = y$w_buff0_used [L808] 3 y$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L810] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L811] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L812] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L813] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L814] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L815] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L930] FCALL, FORK 0 pthread_create(&t236, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t236, ((void *)0), P3, ((void *)0))=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 4 z$w_buff1 = z$w_buff0 [L865] 4 z$w_buff0 = 1 [L866] 4 z$w_buff1_used = z$w_buff0_used [L867] 4 z$w_buff0_used = (_Bool)1 [L868] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L868] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L869] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L870] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L871] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L872] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L873] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L874] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 3 y$flush_delayed = weak$$choice2 [L821] 3 y$mem_tmp = y [L822] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L823] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L824] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L825] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L826] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L828] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L829] 3 __unbuffered_p2_EAX = y [L830] 3 y = y$flush_delayed ? y$mem_tmp : y [L831] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 3 z$flush_delayed = weak$$choice2 [L837] 3 z$mem_tmp = z [L838] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L839] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L840] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L841] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L842] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L843] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L844] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L845] 3 __unbuffered_p2_EBX = z [L846] 3 z = z$flush_delayed ? z$mem_tmp : z [L847] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L878] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L879] 4 z$flush_delayed = weak$$choice2 [L880] 4 z$mem_tmp = z [L881] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L882] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L883] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L884] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L885] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L886] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L887] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L888] 4 __unbuffered_p3_EAX = z [L889] 4 z = z$flush_delayed ? z$mem_tmp : z [L890] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L785] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L896] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L897] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L898] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L899] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L900] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L901] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L902] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L903] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L904] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L905] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L850] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L851] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L852] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L854] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L857] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L859] 3 return 0; [L908] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L910] 4 return 0; [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L932] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L934] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L934] RET 0 assume_abort_if_not(main$tmp_guard0) [L936] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L937] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L938] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L939] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L940] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L941] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L942] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L943] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L944] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L945] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L948] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L949] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L950] 0 y$flush_delayed = weak$$choice2 [L951] 0 y$mem_tmp = y [L952] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L953] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L954] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L955] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L956] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L957] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L958] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L959] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L960] 0 y = y$flush_delayed ? y$mem_tmp : y [L961] 0 y$flush_delayed = (_Bool)0 [L963] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 926]: 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: 928]: 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: 924]: 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: 930]: 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 9 procedures, 188 locations, 9 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: 36.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1050 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 848 mSDsluCounter, 683 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 553 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2267 IncrementalHoareTripleChecker+Invalid, 2453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 130 mSDtfsCounter, 2267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=7, InterpolantAutomatonStates: 85, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 2531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2023-08-30 23:08:26,758 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE